Natural Numbers are Comparable

Theorem
Let $\N$ be the natural numbers.

Let $m, n \in \N$.

Then $m$ and $n$ are comparable by the ordering relation $\le$.

That is, either:
 * $(1): \quad m \le n$

or:
 * $(2): \quad n \le m$

or possibly both.