Although it is a duplicate of If $H \triangleleft G$ and $|G/H|=m$, show that $x^m \in H$ for $\forall x \in G$, I didn't find the answer all too useful as some parts are just said 'to be true' without much explanation. Also, from the answer I couldn't conclude the necessity of $H\triangleleft G$, which was required in the following question:
Suppose $H\triangleleft G$ and $n=[G:H]<\infty$. Prove $\forall_{g\in > G}:g^n\in H$. Also give an explicit example from which it can be concluded that it is necessary that $H$ is a normal subgroup of $G$.
I approached it relatively similarly to the answer from the duplicate question;
$[G:H]=\#(G/H)=n$. As all orders of elements of a group are divisors of the order of the group, in particular it holds that $(gH)^n=eH$ for all $g\in G$.
After all: suppose $\operatorname{ord}(gH)=m$ such that $n=pm$ for a $p\in\mathbb{N}$. By definition: $$(gH)^m=eH$$$$(gH)^n=(gH)^{mp}=((gH)^m)^p=(eH)^p=eH=H$$
As $(gH)^n=g^nH=H$, we have that $g^n\in H$.
I don't particularly see where I used that $H$ must be normal in $G$. Is it implicit in the assumption that $G/H$ exists as a group, of which we use the order?