Sum of Geometric Sequence/Proof 1

Proof
For all $n \in \N_{> 0}$, let $P \left({n}\right)$ be the proposition:
 * $\displaystyle \sum_{j \mathop = 0}^{n - 1} x^j = \frac {x^n - 1} {x - 1}$

Basis for the Induction
$P \left({1}\right)$ is the case:
 * $x^0 = \dfrac {x^1 - 1} {x - 1} = 1$

so $P \left({1}\right)$ holds.

This is our basis for the induction.

Induction Hypothesis
Now we need to show that, if $P \left({k}\right)$ is true, where $k \ge 2$, then it logically follows that $P \left({k + 1}\right)$ is true.

So this is our induction hypothesis:
 * $\displaystyle \sum_{j \mathop = 0}^{k - 1} x^j = \frac {x^k - 1} {x - 1}$

Then we need to show:
 * $\displaystyle \sum_{j \mathop = 0}^k x^j = \frac {x^{k + 1} - 1} {x - 1}$

Induction Step
This is our induction step:

So $P \left({k}\right) \implies P \left({k + 1}\right)$ and the result follows by the Principle of Mathematical Induction.

Therefore:
 * $\displaystyle \forall n \in \N_{>1}: \sum_{j \mathop = 0}^{n - 1} x^j = \frac {x^n - 1} {x - 1}$