Equal Numbers are Congruent

Theorem

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

where $x \equiv y \pmod z$ denotes congruence modulo $z$.

Also see

 * Congruent Numbers are not necessarily Equal