Well some of these groups will be infinite so that's impossible but for finite groups I guess it would work but would be a tad tedious. We're looking for a more generic proof.
Consider the following,
Let [itex]H \subset G[/itex]. The group [itex]G[/itex] is abelian and therefore has commutivity of elements by design i.e.
[itex]ah=ha[/itex]
However, this holds [itex]\forall h \in H[/itex] and [itex]\forall a \in G[/itex]
[itex]\Rightarrow aH=Ha \Rightarrow a^{-1}aH=a^{-1}Ha[/itex]
[itex]a^{-1}Ha=H[/itex]