Subset is Right Compatible with Ordinal Addition

Theorem
Let $x, y, z$ be ordinals.

Then:


 * $x \le y \implies \left({x + z}\right) \le \left({y + z}\right)$

Proof
The proof proceeds by transfinite induction on $z$.

Limit Case
The result follows by transfinite induction.