Proof by strong induction example: Fibonacci numbers

A proof that the nth Fibonacci number is at most 2^(n-1), using a proof by strong induction.