Well, what's the base case?
Proof by induction goes:
Write down the statement S you intend to prove, but think of it as a different statement for each different n. In that sense, think of your statement as a "function of n", S(n).
Here, S(n) = "If , then ."
1st, prove S(0) is true.
Here that means proving "If , then ".
So do that.
Next (and here's the sometimes confusing part) you need to prove a logical implication. You need to prove: "S(n) implies S(n+1) for integers n >= 0."
You do that this way: ASSUME S(n) is true for some n>=0. Using that assumption, work some magic (i.e. do some algebra) to derive that S(n+1) must be true.
(If you can do that, then you will have proven that S(n) is true for all non-negative integers n. You will have proven S by induction.)
That looks like:
If , then (this is our assumption S(n)).
... (work your algebraic magic here)...
Therefore, (this is our statement S(n+1)).
That's how you do it.
You choose your "algebraic magic" by looking at where you are and where you want to go. And then you try to algebraically get there on the "easy side", and then typically do some hideous calculations on the "complicated side" which, if it's true and you don't make a mistake, will ultimately simplfy into the desired outcome.
Here, that means since you have , and you want to get to , mutliply both sides of what you have by :
We have ,
On the LHS, you now have your desired , and on the RHS, you have a lot of algebra to do. But it does eventually work out to look like the desired final statement =S(n+1).
to give you an idea of "how you might proceed", let's look at the case n = 2 (from this, we might get an idea of how to go from S(n) to S(n+1)):
(using the rules of complex multiplication)
it appears the angle addition formulae for sine and cosine may be of use.