I am trying to prove the following proposition.
Proposition. Given that $(a_n)\to a$. If every $(a_n)$ is an upper bound for a set $B$, then $a$ is also an upper bound for $B$.
Proof. We prove the contrapositive. Assume that $a<b$ for some $b\in B$, then by hypothesis there exists an $N\in\mathbf{N}$ such that $|a_n-a|<\frac{|b-a|}{2},\forall n\ge N$.
Now geometrically I can see that this should imply that $a_N<b$ but I can't seem to prove this any suggestions?
Assume that $a<b$ for some $b\in B$. Call $\delta=b-a>0$. Then, by convergence there exists $n_0\in \mathbb{N}$ such that $|a-a_n|<\delta$ for $n\geq n_0$. If $a_n\leq a$ for some $n$ then you're done because $a_n\leq a< b$. If not, then $a_n-a<b-a$, and then $a_n<b$ for every $n$ big enough.