Define the relation ~ over as follows: ~ :A(,) (,)B Prove that ~ is an equivalence relation (i.e., it is reflexive, symmetric, and transitive).

Now we use the fact that every equivalence relation over a set partitions the elements of the underlying set into equivalence classes. Let [] denote the equivalence class of , so that [] = { :~}