[step:Bound the expected total number of upcrossings using $L^1$-boundedness]
For rationals $a < b$, let $N_n([a, b], X)$ denote the number of upcrossings of $[a, b]$ by time $n$. The [Doob's Upcrossing Inequality](/theorems/1156) gives:
\begin{align*}
(b - a) \, \mathbb{E}[N_n([a, b], X)] \leq \mathbb{E}[(X_n - a)^-] \leq \mathbb{E}[|X_n|] + |a|.
\end{align*}
The second inequality uses $(X_n - a)^- = \max(a - X_n, 0) \leq |X_n - a| \leq |X_n| + |a|$. Since $N_n([a, b], X)$ is non-negative and increasing in $n$ with limit $N([a, b], X) = \lim_{n \to \infty} N_n([a, b], X)$, the [Monotone Convergence Theorem](/theorems/509) gives:
\begin{align*}
(b - a) \, \mathbb{E}[N([a, b], X)] = \lim_{n \to \infty} (b - a) \, \mathbb{E}[N_n([a, b], X)] \leq \sup_{n \geq 0} \bigl(\mathbb{E}[|X_n|] + |a|\bigr) < \infty.
\end{align*}
Therefore $N([a, b], X) < \infty$ a.s. for each rational pair $a < b$.
[/step]