If a set has n elements then show that it has 2^n subsets.
If you do a "google search" of your exact phrase... the first hit is a "Proof by Induction" for your exact question.
Remember that a proof by Induction has two steps.
1) show true for n=1
2) The induction step... assume true for n=k, show true for n=k+1