Please check if my proof is fine or it contains any error!
Theorem: Let $I_m=\{i\in\mathbb N\mid i\leq m\},I_n=\{i\in\mathbb N\mid i\leq n\},\text{ and } f:I_m\to I_n$ be injective. Then $m\leq n$.
Let $T=\{m\in\mathbb N\mid \forall n\in\Bbb N(f:I_m\to I_n\text{ be injective }\implies m\leq n)\}$. Since $0\leq n$ for all $n\in\mathbb N,0\in T$. Assume $k\in T$, then $\forall n\in\Bbb N(f:I_k\to I_n\text{ is injective }\implies k\leq n)$. I will prove $k+1\in T$ as follows.
Let $g:I_{k+1}\to I_n$ be injective. $I_{k+1}$ contains at least two points and $g$ is injective, so does $I_n$, or equivalently $n=t+1$. Let $\tau:I_n\to I_n$ be a mapping that transposes $g(k+1)$ and $n$, and leaves the other elements of $I_n$ fixed. Then $\tau\circ g:I_{k+1}\to I_n$ is injective, and $\tau\circ g(k+1)=n$. As a result, ${\tau\circ g}_{|I_k}I_k\to I_t$ is injective $\implies k\leq t$ [Since the theorem is true for $m=k$] $\implies k+1\leq t+1\implies k+1\leq n$. Thus $k+1\in T$.
By principle of induction, $T=\mathbb N$, and consequently the theorem is proved. $\blacksquare$