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: \cmod {\lambda x_n - \lambda l} < \epsilon$

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

So, assume $\lambda \ne 0$.

Then $\cmod {\lambda} > 0$ from the definition of the modulus of $\lambda$.

Hence $\dfrac \epsilon {\cmod \lambda} > 0$.

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

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

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

But we have:

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