Claim. If $x,y \in \mathbb N$, then at least one of these is true: (a) $x>y$; (b) $x=y$; or (c) $x<y$.
It seems that the usual proof of this claim uses induction. Is it possible to prove this without induction? (Or is perhaps this claim false without the axiom of induction?)