Prime factors of a lcm are the primes dividing a factor
Provedgpy_mem_primeFactors_lcmnumber-theory
For nonzero D and E, p is a prime factor of lcm D E exactly when p is prime and p divides D or p divides E. Formalization Note: the statement uses only Mathlib terms.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_mem_primeFactors_lcm {D E p : ℕ} (hD : D ≠ 0) (hE : E ≠ 0) :
p ∈ (Nat.lcm D E).primeFactors ↔ Nat.Prime p ∧ (p ∣ D ∨ p ∣ E) := by sorrySource
GPY good-count product formula via the fiber bijection, formalized from Mathlib (no local definitions in statements)