The reason of a more modest version of your statement (your big claim is not right) is that the sum
$$\sum_{n=-\infty}^{\infty} |a_n|^2 $$
has to converge. That's because this sum is proportional to
$$ \int_0^{2\pi} |f(x)|^2 dx $$
which converges for bounded functions (a basic insight about Fourier expansions and Hilbert spaces of periodic functions). That's why, for example, power law
$$ |a_n| \sim \frac{1}{n^\epsilon} $$
require $\epsilon>0.5$ or, if some logarithmic corrections are included, at least $\epsilon\geq 0.5$. If the Fourier coefficients were not dropping at least this quickly, the function wouldn't be $L^2$-integrable: the sum above wouldn't converge.
Of course, this convergence requirement doesn't prevent some coefficients from being larger than $C/n^\epsilon$ as long as most others drop quickly. Still, there can't be infinitely many coefficients $a_n$ such that $a_n > \delta$ for a pre-given positive $\delta$ because the sum would still diverge.
Distributions which are not really functions such as $f(x)=\delta(x)$ may have Fourier coefficients that don't drop: of course, $\delta(x)^2$ doesn't have a finite integral, anyway. The same holds for unbounded functions.
The condition $a_1 > a_2 > a_3 > \dots$ is much stronger and is obviously violated for "most functions": you may simply choose coefficients that don't agree with this strict ordering and construct a corresponding function. Still, simple enough functions tend to obey even this strict ordering because the calculation of $a_n$ leads to a simple enough and monotonic function of $n$.
Perfectly smooth functions have $a_n$ decreasing faster than any power law; functions with steps have $a_n\sim 1/n$; continuous functions with $|x|$-like unsmooth points have $a_n\sim 1/n^2$ for large $n$, and so on.