Proof (by contradiction). Suppose $x_n$ converges to $L \in \mathbb{R}$ with $x_n \leq B$ for all $n \in \mathbb{N}$ and that $\lim_{n\to\infty} x_n = L > B$. Then, since $x_n$ converges to $L > B$, it follows that $(\forall \varepsilon > 0)$ $(\exists N\in \mathbb{N})$($\forall n\in \mathbb{N}$) $(n\geq N \Longrightarrow |x_n - L| < L -B)$. (I am allowed to choose an epsilon that makes this work since $x_n$ is a convergent sequence). Since $|x_n - L| < L -B$, it follows that $-(L-B) < x_n - L < (L-B)$. Therefore, $B < x_n < 2L-B$. This is a contradiction. Since we assumed that $x_n \leq B$ for all $n\in \mathbb{N}$. Therefore it must be the case that $\lim_{n\to\infty} x_n = L \leq B$.
I am not super confident in this proof. Let me know what you think of the proof and what could be improved.