Ordinal Multiplication is Left Cancellable

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


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

Proof
For the proof, $<$, $\in$, and $\subsetneq$ will be used interchangeably. This is justified by Ordinal Proper Subset Membership.