My question is this. I have Let $H\le G, a,b\in G$ Define $Hx=\{hx|h\in H\}$ Show that $Ha=Hb$ or $Ha\cap Hb=\emptyset$.
I thought I would do a proof by contradiction. So suppose that $Ha\cap Hb$ is nonempty. Then there exists an element $x$ such that $x\in Ha$ and$ x\in Hb$ Thus we can write $x$ as $$x=h_1a,\text{ and } x=h_2b$$ Then $h_1a=h_2b$ and thus $a=h_1^{-1}h_2b$.
This is where I'm getting stuck. I just don't know how to go about showing that there exists a contradiction.