This theorem proves that the divisor definition of a [prime number](/page/Prime%20Number) is equivalent to the product-divisibility property usually called Euclid's lemma. It explains why a prime factor of a product must divide one of the factors, and why this property rules out nontrivial divisors.