Proving Lucas Numbers and Fibonacci Numbers

The *Lucas numbers $\displaystyle l_{0}, l_{1}, l_{2},...,l_{n}...$ * are defined on the same recurrence relation defining the Fibonacci numbers, but the Lucas numbers posses different initial conditions.

$\displaystyle l_{n}=l_{n-1} + l_{n-2},$ (n≥2),$\displaystyle l_{0}=2, l_{1} = 1$

(a)$\displaystyle l_{n} = f_{n-1} + f_{n+1}$ for n≥1.

My hardest part is getting started. I don't really know how I can start off relating these two functions.

EDIT:

I don't know why I didn't think of this (mind isn't all there today), but I can use induction, correct?