Theorem
Let $f,g: A \to \mathbb R^m$ be well defined on $A \subset \mathbb R^k$.
If $$f(x) \to b, g(x) \to c, \text{ for } x \to a, x \in A$ $$
then
$$f+g \to b +c$$
Proof
$\forall x \in A$ is
$$||(f+g)-(b+c)|| \le ||f-b||+||g-c||$$
[Q1: Where does this inequality come from? I thought it is the triangular inequality but I can not see how it is applied ]
For an arbitrary $\epsilon > 0$ we can choose $\delta_1 > 0$ such that
$$||f-b|| < \epsilon /2$$ for all $x$ with $|x-a|| < \delta_1$
The same is written for $g,b \text{ and } \delta_2$
[Q2: Where does the above come from? Where did $...< \epsilon / 2$ come from?]
If we set $\delta = \min\{\delta_1,\delta_2\}$ then
$$||(f+g)-(b+c)|| < \epsilon \text{ for all } x\in A \text{ with } ||x-a||<\delta$$
I have literally used a half day on understanding this. Please clarify this for me.
Note that $(f+g)-(b+c) = (f-b)+(g-c)$, so that's how the triangle inequality was applied.
The $\epsilon/2$ arrived so that you would have $$\|(f+g)-(b+c)\|\le \|f-b\| + \|g-c\|<\epsilon/2 + \epsilon/2 = \epsilon.$$ In order to guarantee this, we need to make $\|x-a\|<\delta_1$ for the first inequality and $\|x-a\|<\delta_2$ for the second; requiring that $\|x-a\|<\min(\delta_1,\delta_2)$ ensures that both conditions are met.
(P.S. You might find some of my YouTube lectures on multivariable calculus/analysis helpful. See the link in my profile.)