I have a real matrix $A$, $(m+1) \times m$ and a vector $b \in \mathbb R^{m+1}$ such that $b_{m+1}=0$. For any vector $u\in \mathbb R^m$, $Au=0 \Rightarrow u=0$. This means that $A$ is a rectangular matrix of maximal rank, i.e. of rank $m$.
Since $m< \infty$, I'm told this means there is a solution $u\in \mathbb R^m$ to $Au=b$. I don't understand why: if $\operatorname{rk}(A)=m$, then the dimension of the image of the linear application defined by $A$ in $\mathbb R^{m+1}$ is $m$. So for $b\in\mathbb R^m$ we could guarantee a solution, but how can we guarantee the solution satisfies our $b\in\mathbb R^{m+1}$?
Is there something simple I'm missing? (I've asked a couple of classmates who didn't know either, and my professor who told me this in the first place told me to look it up in a book that's in a library that's closed until next week.)