Show that $\binom{2n}{n}\geq2^n$ for all $n\in\mathbb{N}_0$. Show that $\binom{2n}{n}\geq2^n$ for all $n\in\mathbb{N}_0$.

First, observe that $\binom{2n}{n} = \frac{(2n)!}{n!(2n-n)!}=\frac{(2n)!}{(n!)^2}=\frac{1\cdot 2\cdot 3\cdot...\cdot 2n-1\cdot 2n}{(n!)^2}=\frac{(1\cdot 3\cdot 5\cdot ... \cdot 2n-1)\cdot(2\cdot 4\cdot 6\cdot ... \cdot 2n)}{(n!)^2}=\frac{(1\cdot 3\cdot 5\cdot ... \cdot 2n-1)\cdot(2\cdot 1\cdot 2\cdot 2\cdot 2\cdot 3\cdot ... \cdot 2n)}{(n!)^2}=\frac{(1\cdot 3\cdot 5\cdot ... \cdot 2n-1)\cdot 2^n\cdot n!}{(n!)^2}=2^n\cdot\frac{1\cdot 3\cdot 5\cdot ... \cdot 2n-1}{(n!)}.$
For $n=0$ we have:
$\frac{(2*0)!}{(0!)^2}=1=2^0.$
Now to our inductive step $n+1$:
\begin{align*}
& \frac{(2(n+1))!}{((n+1)!)^2}\geq2^{n+1}\\
\Leftrightarrow\,\, & \frac{(2n+2)!}{((n+1)!)^2}\geq2^{n+1}\\
\Leftrightarrow\,\, & \frac{1\cdot 2\cdot 3\cdot...\cdot 2n+1 \cdot 2n+2}{((n+1)!)^2}\geq2^{n+1}\\
\Leftrightarrow\,\, & \frac{(1\cdot 3\cdot 5\cdot ... \cdot 2n+1)\cdot(2\cdot 4\cdot 6\cdot ... \cdot 2n \cdot 2n+2)}{((n+1)!)^2}\geq2^{n+1}\\
\Leftrightarrow\,\, & \frac{(1\cdot 3\cdot 5\cdot ... \cdot 2n+1)\cdot 2^{n+1} \cdot (n+1)!}{((n+1)!)^2}\geq2^{n+1}\\
\Leftrightarrow\,\, & 2^{n+1}\cdot \frac{(1\cdot 3\cdot 5\cdot ... \cdot 2n+1)}{((n+1)!)}\geq2^{n+1}\\
\end{align*}

Is this proof correct/sufficient? Was induction even needed here or should I have argued instead that $\frac{1\cdot 3\cdot 5\cdot ... \cdot 2n-1}{(n!)}>0$? Is this step necessary even for the induction?

This proof does not look complete. You reduced the question to a more manageable one, but you didn't actually prove that the more manageable one is true. It also never makes use of the inductive hypothesis - as it stands, it's basically a direct proof, not a inductive proof.
I'd also recommend rewriting it because it's somewhat unclear as it is - it moves backwards, starting at its conclusion and simplifying from there. This is logically fine - as you have the statements are equivalent - but it can be clarified by writing prose to indicate that you are reducing the problem to a simpler one. You could also be more precise by saying that you are actually just rewriting the left hand side - that is, we are dealing with a series of equal expressions more than with a series of equivalent statements.

Letting my $n$ be your $n+1$ to keep the expressions clean, you've shown that
$${2n\choose n}=\frac{(2n)!}{(n!)^2}=2^n\cdot \frac{1\cdot 3 \cdot \ldots \cdot (2n-1)}{1\cdot 2 \cdot \ldots \cdot n}.$$
You are trying to claim that this is at least $2^n$. So, what you need to show is that $\frac{1\cdot 3 \cdot \ldots (2n-1)}{1\cdot 2\cdot \ldots \cdot n}$ is at least $1$. An easy way to see that is to break it apart as $\frac{1}{1}\cdot \frac{3}1\cdot \ldots \cdot \frac{2n-1}n$, where every factor is at least $1$, so so is their product.  (Or, more directly, you can use the method in @zhw's answer)
You can also argue this inductively by noting that if $\frac{1\cdot \ldots \cdot (2n-1)}{1\cdot 2 \cdot\ldots \cdot n}\geq 1$, then multiplying both sides by $\frac{2n+1}{n+1}\geq 1$ we get $\frac{1\cdot 3 \cdot \ldots\cdot (2n+1)}{1\cdot 2 \cdot\ldots\cdot (n+1)}\geq \frac{2n}{n+1}\geq 1$. Or, going that route, you can also note that
$$\frac{(2n+2)!}{((n+1)!)^2}=\frac{(2n+1)\cdot (2n+2)}{(n+1)^2}\cdot \frac{(2n)!}{(n!)^2} =2\cdot \frac{2n+1}{n+1}\cdot \frac{(2n)!}{(n!)^2}\geq 2\cdot {2n \choose n}$$
from which point the inductive proof is easy enough construct, since your expression is at least doubling at each step
