Proposition: Let $G$ be a group and $a,b \in G$. Show that $|ab| = |ba|$.
Proposed Proof: Assume that $|ab| = n<\infty$. This tells us that $(ab)^n = b^na^n = 1$, from which we conclude that $b^n = (a^n)^{-1}$. Using this we can conclude that $$(ba)^n = a^nb^n = a^n(a^n)^{-1} = 1.$$ So again it remains to show that it is of lowest order. Assume for contradiction that there exists some $s \in \mathbb{N}$ with $s<n$ for which $(ba)^s = 1$. Then $a^sb^s = 1$, implying that $b^s = (a^s)^{-1}$. If we then consider $(ab)^s$, we get that $$ (ab)^s = b^sa^s = (a^s)^{-1}a^s = 1, $$ which contradicts the minimality of $n$ as $|ab| = n$. Therefore $|ba| = n$ as required.
Questions: Is this the best way to show the proof? Specifically for minimality is there a better way to do this without resorting to a contradiction? If I remember from algebra courses I've taken it feels like a standard approach but it's been a while. Any advice or fixes if the proof is wrong is appreciated!