Hello I want to make sure my work is correct!
Suppose that $\{a_n\}$ and $\{b_n\}$ are sequences such that $a_n \leq b_n$ for all $n $ and $b_n \to b$. Prove that $\lim \sup a_n \leq b.$
Let $\epsilon > 0$ be given. Choose an $N$ s.t. $|b_n-b|<\epsilon$ for $n\geq N$ where $b = \lim \sup b_n$.
$a = \lim \sup a_n$.
Proof by contradiction: If $a \geq b$, then, since $a_n\leq b$,
$b\leq a\leq b_n$, meaning $|b_n-a|<|b_n-b|<\epsilon $, implying $b_n \to a$. This is a contradiction,
therefore, $a\leq b$.