Let $G$ be a group with relation ~ defined as:
If $a,b \in G\,, \,\text{write}\,\, a$~$b$ to mean that $ \exists\, g \in G $ such that
$$ga = bg$$
(a) Prove that ~ is an equivalence relation. (b) Let $x \in G$. Prove that if $[x] = \text{{$x$}}$ then $x$ commutes with every element of $G$. That is, show that for any $y\in G$, we have $xy = yx$.
I've attempted part (a) and managed to prove Reflexivity by arguing that if one chooses $g$ to be $e$ (the identity element) then $a$~$a$. However, I have no idea how to tackle Symmetricity, Transitivity or part (b).
Any guidance would be appreciated.
Suppose that the equivalence class of $x$ is {$x$}
Choose some $g\in G$ and denote $$y:=g^{-1}xg$$
This implies $x$~$y$ , but the equivalence class of $x$ only contains $x$, which implies $y=x$ and therefore $x=g^{-1}xg$ and therefore $gx=xg$