Prime not Divisor implies Coprime/Proof 1

Proof
Let $p \in \Bbb P, p \nmid a$.

We need to show that $\gcd \left\{{a, p}\right\} = 1$.

Let $\gcd \left\{{a, p}\right\} = d$.

As $d \mathrel \backslash p$, we must have $d = 1$ or $d = p$ by GCD with Prime.

But if $d = p$, then $p \mathrel \backslash a$ by definition of greatest common divisor.

So $d \ne p$ and therefore $d = 1$.