Integer Combination of Coprime Integers/Sufficient Condition/Proof 2

Proof
Let $a \perp b$.

Thus they are not both $0$.

Let $S$ be defined as:
 * $S = \set {a m + b n: m, n \in \Z}$

$S$ contains at least one strictly positive integer, because for example $a^2 + b^2 \in S$.

By Set of Integers Bounded Below has Smallest Element, let $d$ be the smallest element of $S$ which is strictly positive.

Let $d = a x + b y$.

It remains to be shown that $d = 1$.

By the Division Theorem:
 * $a = d q + r$ where $0 \le r < d$

Then:

But we have that $0 \le r < d$.

We have defined $d$ as the smallest element of $S$ which is strictly positive

Hence it follows that $r$ cannot therefore be strictly positive itself.

Hence $r = 0$ and so $a = d q$.

That is:
 * $d \divides a$

By a similar argument:
 * $d \divides b$

and so $d$ is a common divisor of both $a$ and $b$.

But the GCD of $a$ and $b$ is $1$.

Thus it follows that, as $d \in S$:
 * $\exists m, n \in \Z: m a + n b = 1$