Sort a pile of socks by colour. Every sock goes into exactly one pile, socks in the same pile count as interchangeable, and socks in different piles do not. Each pile is an equivalence class of the relation 'has the same colour as'. Integers sort the same way under 'leaves the same remainder when divided by 3': the class of 2 is {…,−4,−1,2,5,8,…}, and the three classes [0], [1], [2] hold every integer exactly once.
Three properties make such clean piles possible. Reflexive: every element is related to itself. Symmetric: if a∼b then b∼a. Transitive: if a∼b and b∼c then a∼c. Transitivity does the heavy lifting, since it guarantees that two classes sharing even one element are the same class. So classes never partly overlap, and any member can serve as the representative: [2]=[5]=[−1].
A relation can sound like sameness and still fail. 'Is within 1 cm of' is reflexive and symmetric, but heights of 150, 150.8 and 151.6 cm break transitivity: the first is within 1 cm of the second and the second within 1 cm of the third, yet the first and third differ by 1.6 cm. Grouping by that relation gives overlapping groups with no consistent boundary, so it has no equivalence classes.
Think of it like this. Equivalence classes work like amounts of money: a $10 note, two $5 notes and ten $1 bills are different objects, but for paying a bill they are the same amount, and every pile of cash has exactly one amount. The picture fits because 'has the same value as' is reflexive, symmetric and transitive.
Core idea. An equivalence class collects every element related to a given one, treating them all as a single object.