Congruence by Product of Moduli

Theorem
Let $a, b, z \in \R$.

Let $a \equiv b \pmod z$ denote that $a$ is congruent to $b$ modulo $z$.

Then $\forall y \in \R, y \ne 0$:
 * $a \equiv b \pmod z \iff y a \equiv y b \pmod {y z}$

Proof
Let $y \in \R: y \ne 0$.

Then:

Hence the result.

Note the invalidity of the third step when $y = 0$.