Prove $\displaystyle \forall n\geq 0$

$\displaystyle \binom{n}{0}+\binom{n}{1}+\cdots +\binom{n}{n}=2^n$

$\displaystyle p(0): \ \binom{n}{0}=1=2^0=1$

Assume p(k) is true

$\displaystyle p(k): \ \binom{k}{0}+\binom{k}{1}+\cdots +\binom{k}{k}=2^k$

Prove

$\displaystyle p(k+1): \ \binom{k}{0}+\binom{k}{1}+\cdots +\binom{k+1}{k+1}=2^{k+1}$

Simply adding the next binomial term to both sides doesn't help. Any ideas?