Sum of Entries in Row of Pascal's Triangle/Proof 2

Proof
The proof proceeds by induction.

For all $n \in \Z_{\ge 0}$, let $P \left({n}\right)$ be the proposition:
 * The sum of all the entries in the $n$th row of Pascal's triangle is equal to $2^n$.

Basis for the Induction
$P \left({0}\right)$ is the case:
 * The sum of all the entries in the row $0$ of Pascal's triangle is equal to $2^0 = 1$.

This is true, as the only non-zero entry in row $0$ is $\dbinom 0 0$ which equals $1$.

Thus $P \left({0}\right)$ is seen to hold.

This is the basis for the induction.

Induction Hypothesis
Now it needs to be shown that, if $P \left({k}\right)$ is true, where $k \ge 0$, then it logically follows that $P \left({k + 1}\right)$ is true.

So this is the induction hypothesis:
 * The sum of all the entries in the row $k$ of Pascal's triangle is equal to $2^k$.

from which it is to be shown that:
 * The sum of all the entries in the row $k + 1$ of Pascal's triangle is equal to $2^{k + 1}$.

Induction Step
This is the induction step:

In row $k + 1$ there are $k + 2$ entries:
 * $\dbinom {k + 1} 0, \dbinom {k + 1} 1, \dbinom {k + 1} 2, \ldots, \dbinom {k + 1} k, \dbinom {k + 1} {k + 1}$

From Pascal's Rule:
 * $\dbinom {k + 1} j = \dbinom k {j - 1} + \dbinom k j$

Thus for each of the $k + 1$ entries in row $k$:
 * $\dbinom k 0, \dbinom k 1, \ldots, \dbinom k k$

Element $\dbinom k j$ contributes to exactly $2$ elements of row $k + 1$
 * $\dbinom {k + 1} j$ and $\dbinom {k + 1} {j + 1}$

So the sum of all the elements of row $k + 1$ is equal to $2$ times the sum of all the elements of row $k$.

By the induction hypothesis, that means the sum of all the elements of row $k + 1$ is equal to $2 \times 2^k$.

That is, the sum of all the entries in the row $k + 1$ of Pascal's triangle is equal to $2^{k + 1}$.

So $P \left({k}\right) \implies P \left({k + 1}\right)$ and the result follows by the Principle of Mathematical Induction.

Therefore:
 * For all $n \in \Z_{\ge 0}$, the sum of all the entries in the $n$th row of Pascal's triangle is equal to $2^n$.