Geometric Sequence with Coprime Extremes is in Lowest Terms/Proof 2

Theorem
Let $G_n = \left\langle{a_1, a_2, \ldots, a_n}\right\rangle$ be a geometric progression of integers.

Let:
 * $a_1 \perp a_n$

where $\perp$ denotes coprimality.

Then $G_n$ is in its lowest terms.

Proof
Let $G_n = \left\langle{a_1, a_2, \ldots, a_n}\right\rangle$ be natural numbers in geometric progression such that $a_1 \perp a_n$.

Suppose $G\,'_n = \left\langle{b_1, b_2, \cdots, b_n }\right\rangle$ be another set of natural numbers in geometric progression with the same common ratio where:


 * $\forall k \in \N_{\le n}: a_k > b_k$

By definition of geometric progression:
 * $a_1 = r^{n - 1} a_n$
 * $b_1 = r^{n - 1} b_n$

Hence:
 * $\dfrac {a_1} {a_n} = \dfrac {b_1} {b_n}$

By hypothesis:
 * $a_1 \perp a_n$

Thus $\dfrac {a_1} {a_n}$ is in canonical form.

From Canonical Form of Rational Number is Unique it follows that $a_1$ and $a_n$ are the only two integers fulfilling these conditions.

Thus:
 * $\forall p, q: \dfrac p q = \dfrac {a_1} {a_n}: a_1 \le p, a_n \le q$

But it was supposed that:
 * $b_1 < a_1$
 * $b_n < a_n$

From this contradiction it follows that there can be no such $b_1, \ldots, b_n$.

Hence the result.