None of the limit superior inequality proofs in MSE did the trick for me, this is the inequality which I am trying to prove:
$$\lim \sup(a_n+b_n)\leq \lim \sup(a_n)+\lim\sup(b_n)$$
for $a_n$, $b_n$ bounded.
My reasoning is as such: if $a_n$ and $b_n$ are bounded, then surely $a_n + b_n$ is bounded as well. That means we can find subsequences $a_{n_k}$ and $b_{n_k}$ such that the sum of their limits is equal to the limit superior of the sum:
$$\lim\sup(a_n+b_n)=\lim(a_{n_k})+\lim(b_{n_k})$$
Then, I claim that $a_{n_k}$ and $b_{n_k}$ are not necessarily the subsequences that converge to the bigger of the sublimits of $a_n$ and $b_n$, and so we have:
$$\lim(a_{n_k})+\lim(b_{n_k})\leq\lim\sup(a_n)+\lim\sup(b_n)$$
Which concludes the proof. Is this correct? If yes, how can I make it more rigorous?