Here is the question itself.
Suppose that ∼ and ≈ are two equivalence relations on the same set A. Assume that there are at least two equivalence classes for ∼. Suppose that any two elements which are different equivalence classes for ∼ are in the same equivalence class for ≈. As completely as possible, describe the equivalence classes of ≈, and prove your description is correct.
I know how to proof for equivalence class for ∼, that is to show reflexive, symmetric, and transitive. And to proof for ≈, I can proof bijective function. But for this question, I just confused on what it's asking and how should I continue.