Answer to Question #76239 in Discrete Mathematics for Amy

Question

Let X be a non-empty set, and let R be an equivalence relation on X. Let C be the set of all equivalence classes of R. So C={A⊆X such that A=[x] for some x ∈ X}.

Now, define f : X → C by the rule f(x) = [x] for all x ∈ X.

Prove that if x ∈ X, then there is one and only one equivalence class
which contains x.