Subset is Right Compatible with Ordinal Addition

Theorem
Let $x$, $y$, and $z$ be ordinals. Then:


 * $\displaystyle x \le y \implies ( x + z ) \le ( y + z )$

Proof
By Transfinite Induction on $z$.