Subset is Left Compatible with Ordinal Addition

Theorem

Let $x, y, z$ be ordinals.

Then:

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

Proof

The result follows from Membership is Left Compatible with Ordinal Addition.

$\blacksquare$