Is there a proof that the factorial function $!:\mathbb N\to\mathbb N$ is nonelementary?
If it were equal to an elementary function (call it $P(n)$), then it would extend the factorial function to the real and complex numbers. This sounds like the Gamma function, but we have $\dfrac{\Gamma(n+1)}{\Gamma(n)}=n$ for all real $n$. It's entirely possible that $\dfrac{P(n)}{P(n-1)}$ isn't $n$, but rather something like $n+\sin(\pi n)$ which is only equal to $n$ at the integers. (Also, I've never found a proof that Gamma is nonelementary, either. I do know that the incomplete Gamma function is nonelementary, due to differential Galois theory.)
Also, the fact that $\pi$ appears in limits involving factorials isn't a proof, by the way. For example, the fact that: $$\lim_{n\to\infty}\frac{(n!)^2(n+1)^{2n^2+n}}{n^{2n^2+3n+1}}=2\pi,$$ which comes from Stirling's approximation, doesn't prove that it can't be elementary; we also have: $$\lim_{n\to\infty}n(-1)^{1/n}-n=i\pi$$ so it's possible for elementary functions to have $\pi$ as a limiting value.
So, is there any proof that the factorial function is nonelementary?