Subset is Left Compatible with Ordinal Multiplication

Theorem

Let $x, y, z$ be ordinals.

Then:

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

Proof

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

$\blacksquare$