Given two distinct $3$-cycles $x$ and $y$ in $S_4$ such that $x\neq y^{-1}$, I would like to show that $A_4$ is generated by any such pair of $x$ and $y$.
The only times where $3$-cycles in $S_4$ can be the inverse of each other is when they can be written in the form $(a\;b\;c),(a\;c\;b)$. Excluding this case, the possible pairs of cycles should only be of the form $$(a\;b\;c),(a\;b\;d)\qquad\text{or}\qquad(a\;b\;c),(a\;d\;b).$$ Suppose the two $3$-cycles are of the form $(a\;b\;c),(a\;b\;d)$, then I can say the element $$(a\;b\;c)(a\;b\;d)=(c\;a)(d\;b)$$ is in the subgroup generated by $(a\;b\;c),(a\;b\;d)$.
From here I am not sure how I should go about showing that the generated set must be $a_4$. Should I keep discovering every possible element in the generated set display that the sets are equivalent? Or is there a more clever way than brute forcing it like this for every valid pair of 3-cycles?
Given a pair $x,y$ with property $x \neq y^{-1}$ you have distinct elements $e,x,y,x^2,y^2$. It is sufficient to show that $xy$ and $x^2y^2$ are two new elements distinct from $e,x,y,x^2,y^2$. And we obtain 7 elements in the respective subgroup of $A_4$. So, this subgroup is $A_4$ (by Lagrange's theorem).