We use:
A matrix $M$ is diagonalizable if and only if the minimal polynomial for $M$ has no repeated roots.
Also:
Give a matrix $M$ and a polynomial $p$ such that $p(A)=0,$ then $p(x)$ is divisible by the minimal polynomial of $M$.
Now, let $m_A(x)$ be the minimal polynomial for a matrix $A.$
If $m_{T^m}(x)$ has no repeated roots, then $p(x)=m_{T^m}(x^m)$ can only have $x=0$ as a repeated root. (I'll leave that to you to prove [*].)
But $p(A)=M_{T^m}(T^m)=0$, so $p(x)$ is divisible by the minimal polynomial, $m_{A}(x),$ of $A.$ If $A$ is non-singular, then $0$ is not a root of $m_{A}(x).$ So the minimal polynomial for $A$ has no repeated roots.
For [*] you'll need to prove this in some form:
Over an algebraically closed field $k$ of characteristic $0,$ (such as $\mathbb C,)$ there are no repeated roots to $x^n-1.$
From there you can conclude that:
For $a\in k,$ $x^n-a$ has repeated roots if and only if $a=0.$