This question doesn't really make sense. Can you try to rephrase it?
Given a (non-empty) set ##X##, an equivalence relation ##R## is a subset ##R \subseteq X \times X## such that
(1) ##(x,x) \in R## for all ##x \in X##
(2) For all ##x,y \in X: (x,y) \in R \implies (y,x) \in R##
(3) For all ##x,y,z \in X: (x,y) \in R, (y,z) \in R \implies (x,z) \in R##
An equivalence class of an element ##x\in X## is then the set of all elements that are in relation with ##x##, i.e. the set ##[x]:=\{y \in X: (x,y) \in R\}##.
It is true though that ##X = \bigcup_{x \in X} [x]## and that every element of ##X## is in precisely one equivalence class. Thus the equivalence classes partition the set ##X##.