The equivalence closure of a binary relation is the least equivalence relation containing it. Add diagonal and reversed pairs, then connect points by finite chains. Constant chains prove reflexivity, reversed chains prove symmetry, and concatenated chains prove transitivity. Any equivalence relation extending contains every such chain endpoint by induction.
New to topics? Read the docs here!