Equivalence classes and relations.

Quote:

Prove that an equivalence relation can on a set S uniquely defines a partition of that set.

Suppose S can be separated into partitions.

Hence . Assume that reflexivity, symmetry and transitivity hold.

1). Reflexivity since an element from one subset cannot belong to another subset (property 2 of a partition- the intersections are empty).

This is where I have no idea where to go. Symmetry and transitivity I cannot connect to the definition of a partition.

I was wondering if this is the right idea to follow.