Subset is Left Compatible with Ordinal Multiplication

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

Then:


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

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