Subset is Right Compatible with Ordinal Addition

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

Then:


 * $x \le y \implies \paren {x + z} \le \paren {y + z}$

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

Limit Case
The result follows by transfinite induction.