I am trying to grasp some moments of First Sylow's Theorem from Herstein's book:
Theorem (Sylow): If $p$ is a prime number and $p^{\alpha}\mid o(G)$, then $G$ has a subgroup of order $p^{\alpha}$.
Firstly he proves the following combinatorial fact: If $n=p^{\alpha}m$ and $\nu_p(m)=r$ i.e., $p^r\mid m$ but $p^{r+1}\nmid m$. Then $\nu_p(\binom{p^{\alpha} m }{p^{\alpha}})=r$.
Proof (by Wielandt): Let $\mathcal{M}$ be the set of all subsets of $G$ which have $p^{\alpha}$ elements. Thus $\mathcal{M}$ has $\binom{p^{\alpha} m }{p^{\alpha}}$ elements. Given $M_1, M_2\in \mathcal{M}$ define $M_1\sim M_2$ if there exists an element $g\in G$ such that $M_1=M_2g$. It is easy to verify that this defines an equivalence relation on $\mathcal{M}$. It's easy to see that there is at least one equivalence class of elements in $\mathcal{M}$ such that the number of elements in this class is not a multiple of $p^{r+1}$. Let $\{M_1, \dots, M_n\}$ be such an equivalence class in $\mathcal{M}$ where $p^{r+1}\nmid n.$ By our very definition of equivalence in $\mathcal{M}$, for any $g\in G$, for each $i=1,\dots, n$ exists $j=1,\dots, n$ such that $M_ig=M_j$.
I have understood almost everything except the last sentence. How to show that if $g\in G$ and $i\in \{1,\dots,n\}$ then $\exists j\in \{1,\dots,n\}$ such that $M_ig=M_j$.
I have tried by contradiction but it does not give result.
Would be very grateful for help.