As I pointed out in my comment, the answer depends on which definition you are using.
Solution 1. Here we define $e^x = \lim_{n\to\infty}\left(1 + \frac{x}{n}\right)^n$. (We assume the existence of this limit is already established.) Using the binomial theorem, for $n \geq 2$ and $|x| < 1$ we obtain the following simple estimate:
$$ \left| \left(1 + \frac{x}{n}\right)^n - 1 - x \right|
= \left| \sum_{k=2}^{n} \binom{n}{k} \frac{x^k}{n^k} \right|
\leq \sum_{k=2}^{n} |x|^k
\leq \frac{|x|^2}{1-|x|}. $$
This bound remains true as we let $n\to\infty$, so it follows that
$$ \left| \frac{e^x - 1}{x} - 1\right| = \frac{\left|e^x - 1 - x\right|}{|x|} \leq \frac{|x|}{1-|x|} $$
and by the squeezing lemma as $x\to0$ the desired conclusion follows.
Solution 2. In case $e^x$ is defined as $e^x = \sum_{n=0}^{\infty} \frac{x^n}{n!}$, the above argument carries over in almost identicaly way to yield a proof.
Solution 3. In case $e^x$ is defined as the inverse function of $x \mapsto \int_{1}^{x}\frac{dt}{t}$, it follows from the inverse function theorem.
Solution 4. Perhaps the most pesky case is where the exponentiation is defined by the process of extending rational exponents to reals and $e$ is simply defined as $e=\lim_{n\to\infty}\left(1+\frac{1}{n}\right)^n$. In this case, one can introduce two functions, $\log(x) := \int_{1}^{x}\frac{dt}{t}$ and its inverse, and observe that
$\log(xy) = \int_{1}^{x} \frac{dt}{t} + \int_{x}^{xy} \frac{dt}{t} = \log(x) + \log(y)$ and hence $\exp(x+y) = \exp(x)\exp(y)$.
$\log\left(\left(1+\frac{1}{n}\right)^n\right) = n\log\left(1+\frac{1}{n}\right) \to 1$ as $n\to\infty$ and $\log$ is continuous, so $\log(e) = 1$. In other words, $\exp(1) = e$.
Using this, it is routine to check that $\exp(k) = e^k$ for all integers $k$ and then $\exp(r) = e^r$ for all rationals $r$. Hence for any real $x$,
$$ e^x = \inf\{ e^r : r > x \text{ and } r \in \mathbb{Q} \} = \inf\{ \exp(r) : r > x \text{ and } r \in \mathbb{Q} \} = \exp(x) $$
by the continuity of $\exp$.
Now the conclusion follows by Solution 3.