Integers Divided by GCD are Coprime/Proof 3

Proof
Because $d$ is a common divisor of $a$ and $b$, we may form the expressions:
 * $a = d r$
 * $b = d s$

where $r, s \in \Z$.

Then: