Integers Divided by GCD are Coprime/Proof 1

Proof
Let $d = \gcd \set {a, b}$.

By definition of divisor:
 * $d \divides a \iff \exists s \in \Z: a = d s$
 * $d \divides b \iff \exists t \in \Z: b = d t$

So: