I constructed the following proof after doing a bit of Googling of proofs of the ergodic theorem. (In particular, it combines ideas from the paper https://doi.org/10.1214/074921706000000266 of Keane and Peterson - which, to be fair, is already a pretty impressively short proof even for general $L^1$ observables - with proofs I've seen in online lectures notes on ergodic theory; but, of course, I also use boundedness to help get a very short proof.)
I will prove the theorem for ergodic transformations, but it is not at all difficult to extend (in the appropriate manner) to more general measure-preserving transformations. I have tried to write out the proof sufficiently explicitly to be smoothly readable in about 2-5 minutes.
Proof. Since $\overline{\lim}_{N \to \infty} P_N(f)$ is $T$-invariant, it is $\mu$-a.e. equal to a constant $\overline{f}$. We will show $\overline{f} \leq \mathbb{E}_\mu[f]$; then, applying this to $-f$ as well as $f$ gives the result. Fixing arbitrary $\varepsilon>0$, let $g=f+\varepsilon-\overline{f}$. Define the monotone sequences \begin{align*} m_N^{[g]} := & \, \max\big\{ \, g \ , \ g \!+\! (g \circ T) \ , \ \ldots\ldots \ , \ g \!+\! (g \circ T) \!+\! \ldots \!+\! (g \circ T^{N-1}) \, \big\} \\ E_N^{[g]} := & \, \{ x \in X : m_N^{[g]}(x)>0 \}. \end{align*} For $N \geq 2$, $$\ m_N^{[g]} - g = \max\big\{ \, 0 \ , \ g \circ T \ , \ \ldots\ldots \ , \ (g \circ T) \!+\! \ldots \!+\! (g \circ T^{N-1}) \, \big\} = (m_{N-1}^{[g]})^+ \circ T.$$\begin{align*} (m_N^{[g]} - g)(x) &= \max\big\{ \, 0 \ , \ g(T(x)) \ , \ \ldots\ldots \ , \ g(T(x)) \!+\! \ldots \!+\! g(T^{N-1}(x)) \, \big\} \\ &= (m_{N-1}^{[g]})^+(T(x)). \end{align*} Integrating over $E_N^{[g]}$ gives \begin{align*} \int_{E_N^{[g]}} g \, d\mu \ &= \ \int_{E_N^{[g]}} m_N^{[g]} \, d\mu - \int_{E_N^{[g]}} (m_{N-1}^{[g]})^+ \circ T \, d\mu \\ &= \int_X (m_N^{[g]})^+ \, d\mu - \int_{E_N^{[g]}} (m_{N-1}^{[g]})^+ \circ T \, d\mu \\ &\geq \int_X (m_N^{[g]})^+ \, d\mu - \int_X (m_N^{[g]})^+ \circ T \, d\mu \ = \ 0. \end{align*} Now $\ \bigcup_{N=1}^\infty \! E_N^{[g]} = \{x \, : \, \exists n \in \mathbb{N} \text{ s.t. } P_n(f)(x) > \overline{f} - \varepsilon \}$, which \begin{align*} \bigcup_{N=1}^\infty \! E_N^{[g]} &= \{x \, : \, \exists n \in \mathbb{N} \text{ s.t. } P_n(g)(x) > 0 \} \\ &= \{x \, : \, \exists n \in \mathbb{N} \text{ s.t. } P_n(f)(x) > \overline{f} - \varepsilon \}, \end{align*} which is clearly a $\mu$-full measure set by definition of $\overline{f}$. Hence by the dominated convergence theorem, taking the limit of the above as $N \to \infty$ gives $\mathbb{E}_\mu[g] \geq 0$$\int_X g \, d\mu \geq 0$, i.e. $\mathbb{E}_\mu[f] \geq \overline{f}-\varepsilon$. But $\varepsilon$ was arbitrary. QED.