# Successor of Ordinal Smaller than Limit Ordinal is also Smaller

## Theorem

Let $\On$ denote the class of all ordinals.

Let $\lambda \in \On$ be a limit ordinal.

Then:

$\forall \alpha \in \On: \alpha < \lambda \implies \alpha^+ < \lambda$

## Proof 1

Let $\lambda$ be a limit ordinal such that $\alpha < \lambda$.

Then as $\alpha^+$ is the successor set of $\alpha$ it follows that:

$\alpha^+ \le \lambda$

But as $\lambda$ is not a successor ordinal:

$\alpha^+ \ne \lambda$

Hence:

$\alpha^+ < \lambda$

$\blacksquare$

## Proof 2

Because $\lambda$ is a limit ordinal:

$\lambda \ne \alpha^+$

Moreover, by Successor of Element of Ordinal is Subset:

$\alpha \in \lambda \implies \alpha^+ \subseteq \lambda$
$\alpha^+ \subset \lambda$ and $\alpha^+ \in \lambda$

$\blacksquare$