Hint $\ $ Note $\,a^n\,$ is a solution of the fibonacci recurrence since
$$\ a^{n+2}-a^{n+1}-a^n = a^n(a^2-a-1) = a^n(0) = 0$$
Similarly $\,b^n\,$ satisfies the recurrence since it too is a root of $\,x^2-x-1.$ Hence by linearity any linear combination $\,c a^n + d b^n\,$ also satisfies the recurrence for any $\,c,d\,$ that are constants (i.e. independent of $\,n).$ In particular $\,g_n = (a^n-b^n)/\sqrt{5}\,$ satisfies the recurrence. Thus $\,f_n,\,g_n\,$ are both solutions of the recurrence and, as easily checked, they have the same initial conditions $\,f_0=0,\,f_1 =1.\ $ Now a simple induction proves that any two such solutions are equal (the uniqueness theorem). Equivalently, considering $\,f_n-g_n,\,$ it suffices to show that $\,0\,$ is the only solution with initial conditions both $= 0,\,$ an obvious induction.