Congruence of Product
Let $a, b, z \in \R$.
Let $a$ be congruent to $b$ modulo $z$, that is:
- $a \equiv b \pmod z$
- $\forall m \in \Z: m a \equiv m b \pmod z$
Let $m \in \Z$ and $a \equiv b \pmod z$.
Suppose $m = 0$.
Then the right hand side of the assertion degenerates to $0 \equiv 0 \pmod z$ which is trivially true.
Otherwise, from Congruence by Product of Moduli, we have:
- $a \equiv b \iff m a \equiv m b \pmod z$
As $m \in \Z$, it follows that $m z$ is an integer multiple of $z$.
Hence from Congruence by Divisor of Modulus, it follows that:
- $m a \equiv m b \implies m a \equiv m b \pmod z$