Suppose $a_n \to L$ in $\mathbb{R}$. Prove $2^{a_n} \to 2^L$.
I tried to start from $| 2^{a_n} - 2^L | < \epsilon$ and work my way to $|a_n - L| < \epsilon$, but logarithms are showing up and I think the problem is too simply to need to prove an inequality with a logarithm or exponential.
I cannot use the continuity of $2^n$ in this question.
Any help is appreciated.
Let $\varepsilon>0$. Since $a_n\rightarrow L$ we can choose $N$ such that for all $n>N$ we have $|a_n-L|<\log_2(1+\frac{\varepsilon}{2^L})$
Now for this $N$ we have for all $n>N$
$$|2^{a_n}-2^L| = |2^{a_n - L + L}-2^L|=2^L |2^{a_n-L}-1|$$
Since $|a_n-L|<\log_2(1+\frac{\varepsilon}{2^L})$ we have that $|2^{a_n-L}|<1+\frac{\varepsilon}{2^L}$ which means that $1-\frac{\varepsilon}{2^L}<2^{a_n-L}<1+\frac{\varepsilon}{2^L}$ and so by the above equation $-\varepsilon <2^{a_n}-2^L <\varepsilon$, equivalently $|2^{a_n}-2^L |<\varepsilon$. This completes the proof.