Induction in two parts

To prove a statement $P(n)$ for every integer $n \ge 1$, prove two things.

Base case: $P(1)$ is true. Inductive step: if $P(k)$ is true, then $P(k + 1)$ is true.

Like dominoes, the first one falls, and each one knocks over the next, so all of them fall.