Finite Ordinal is equal to Natural Number

Theorem

Let $n$ be an element of the minimally inductive set.

Let $x$ be an ordinal.

Then:

$n \sim x \implies n = x$

Proof

Let $n \ne x$.

Then either $n < x$ or $x < n$ by Ordinal Membership is Trichotomy.

If $x < n$, then by Subset of Finite Set is Finite both $x$ and $n$ are finite.

Therefore by No Bijection between Finite Set and Proper Subset:

$x \not \sim n$

Suppose $n < x$.

Then $x \sim n$ implies that $x$ is finite by definition.

$x \not \sim n$

Therefore by Rule of Transposition:

$n \sim x \implies n = x$

$\blacksquare$