Definition of $\mathbb{N}_m$ is a set $\{x \in \mathbb{Z}^+ | 1 \leq x \leq m\}$.
The book "An introduction mathematical reasoning" by Eccles has this proof written out on 3 pages. They use induction on $n$ to prove it. But I fail to see why you need to go to such lengths to prove it.
In my head, without providing a rigorous proof, this is quite clear just from the definition of injection. Namely, given function $f: X \rightarrow Y$, it is injection if: $\forall x_1,x_2 \in X, (x_1 \neq x_2 \implies f(x_1) \neq f(x_2))$. Meaning each element in $\mathbb{N}_m$ will map to at most one element in $\mathbb{N}_n$. Therefore, $|N_m| \leq |N_n| \implies m \leq n$. Is this intuition valid? Because if not, then that would explain the lengthy proof in the book.