Equal Numbers are Congruent

Theorem

 * $$\forall x, y, z \in \R: x = y \implies x \equiv y\, \bmod \, z$$

where $$x \equiv y \, \bmod \, z$$ denotes congruence modulo $z$.

Proof
$$ $$ $$ $$