Euclid's lemma
ProvedFamousTheorems.euclid_lemmaEuclid's lemma. If is a prime number and are natural numbers, then if and only if or .
This is Proposition VII.30 of Euclid's Elements. It is the key step in the uniqueness of prime factorisation, and it characterises prime elements in general commutative rings.
Formalization note. Mathlib's Nat.Prime.dvd_mul.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem euclid_lemma {p m n : ℕ} (hp : p.Prime) : p ∣ m * n ↔ p ∣ m ∨ p ∣ n := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Nat.Prime.dvd_mul`. Proof here reduces to that Mathlib result.