In my real analysis class my professor gave us the problem of proving that if $F: \mathbb{R}^{m} \rightarrow \mathbb{R}^{m}$ is continuous and satisfies $\| F(x) - F(y)\| \geq \lambda \| x - y \|$ then $F$ is a bijection with continuous inverse. ($∥⋅∥$ is the Eucliden norm and $\lambda$ is some positive real number.)
The problem of injectivity is easy enough since if $x \neq y$ then $\|F(x) - F(y)\| \geq \lambda \|x-y\| > 0$.
Also given that F is a continuous bijection then the continuity of the inverse $g$ is also obvious since fixing $x = F(u)$ and $y = F(v)$ we have that $\|g(x) - g(y)\| = \|u-v\| \leq \frac{1}{\lambda}\|x-y\|$ so g is Lipschitz and therefore continuous.
My question is, how exactly is one supposed to prove surjectivity? It seems easy enough by intermediate value theorem if we restrict $F:\mathbb{R} \rightarrow \mathbb{R}$. But I can't seem to figure it out more generally. any hints would be much appreciated!