Euclid's Lemma for Prime Divisors/Proof 1

Proof
We have that the integers form a Euclidean domain.

Then from Irreducible Elements of Ring of Integers we have that the irreducible elements of $\Z$ are the primes and their negatives.

The result then follows directly from Euclid's Lemma for Irreducible Elements.