# Properties of Equivalence Relation Compared with Equality

I'm reading about congruences in number theory and my textbook states the following:

The congruence relation on $\mathbb{Z}$ enjoys many (but not all!) of the properties satisfied by the usual relation of equality on $\mathbb{Z}$.

The text then does not go into detail as to what properties they are describing. So what are the properties they are talking about? I've already showed that congruences are reflexive, symmetric, and transitive, so why in general is this not the same as equality? Is there some property that all equivalence relations will never share with the equality relation? I appreciate all responses.

An equivalence relation is the equality relation if and only if its congruence classes are all singletons. Most equivalence relations do not have this characteristic. The equivalence classes of (most) congruence relations on $\Bbb Z$, for example, are infinite.
Equality is also an equivalence relation. However, equality is the finest of all equivalence relations. That is: If $\sim$ is an equvalence relation, we always have $x=y\Rightarrow x\sim y$, but the converse may not hold. In fact, for any formula $\Phi(x)$ we have that $x=y$ implies $\Phi(x)\leftrightarrow \Phi(y)$. For every other equivalence relation there must be at least one $\Phi$ violating this.