Well I know that since $|x|,|y|$ are both positive integers then we have that $$|x||y| = \gcd(|x|,|y|)\operatorname{lcm}(|x|,|y|)$$
And since we are given that $|x|,|y|$ are coprime then we have $gcd(|x|,|y|)=1$ and so $$|x||y| = \operatorname{lcm}(|x|,|y|)$$
Now all I need to show is that $|x||y| = |xy|$.
Now let $|x| =n,|y| = m$ and also let $|xy|=k$ and consider $(xy)^{mn}$.
$(xy)^{mn} = (x)^{mn}(y)^{mn} = (x^n)^m(y^m)^n = e^me^n = ee= e$. However, since we have $|xy|=k$ then we know that $$k\leq mn.$$ Now I need to show that $mn \leq k$ to conclude that $k=mn$ and so $|x||y| = |xy|$. But I am stuck in here. I know for sure that I need to use the fact that $xy=yx$. But I dunno how