This is a fairly standard lemma in undergraduate calculus courses, to the point that in my opinion in a paper you definitely do not need to include a proof, or even a reference.
So... basically: if $0<a \leq 1$, then $\frac{a^n}{n!} \leq \frac{1}{n!}$ and it's obvious.
If $a > 1$, apply the ratio test: $\frac{a^{n+1}}{(n+1)!}\cdot \frac{n!}{a^n} = \frac{a}{n+1}$ which tends to $0$.
Not a proof, but an intuitive explanation of the fact that, asymptotically, $a^n < n!$ can be obtained by taking the $\log$ of both sides:
$$n \log(a) <^? \sum_{i=1}^n \log(i)$$
from which you can see that, as $n$ increases to $n+1$, you always add $\log(a)$ to the left (constant increase) but you add $\log(n+1)$ to the right, which is bigger for $n$ big enough. It stands to reason that then, eventually, the right side will prevail.