Combination Theorem for Sequences/Real/Multiple Rule

Theorem
Let $\sequence {x_n}$ be a sequences in $\R$.

Let $\sequence {x_n}$ be convergent to the following limit:


 * $\displaystyle \lim_{n \mathop \to \infty} x_n = l$

Let $\lambda \in \R$.

Then:
 * $\displaystyle \lim_{n \mathop \to \infty} \paren {\lambda x_n} = \lambda l$

Proof
Let $\epsilon > 0$.

We need to find $N$ such that:
 * $\forall n > N: \left\vert{\lambda x_n - \lambda l}\right\vert < \epsilon$

If $\lambda = 0$ the result is trivial.

So, assume $\lambda \ne 0$.

Then $\left\vert{\lambda}\right\vert > 0$ from the definition of the modulus of $\lambda$.

Hence $\displaystyle\frac {\epsilon} {\left\vert{\lambda}\right\vert} > 0$.

We have that $x_n \to l$ as $n \to \infty$.

Thus it follows that:
 * $\exists N: \forall n > N: \left\vert{x_n - l}\right\vert < \dfrac {\epsilon} {\left\vert{\lambda}\right\vert}$

That is:
 * $\forall n > N: \left\vert{\lambda}\right\vert \left\vert{x_n - l}\right\vert < \epsilon$

But we have:

Hence:
 * $\displaystyle \lim_{n \to \infty} \left({\lambda x_n}\right) = \lambda l$