A prime divisor of a squarefree product sits in exactly one coordinate
Provedgpy_exists_unique_coord_of_squarefree_prodnumber-theory
On a tuple of positive integers with squarefree product, a prime dividing the product divides exactly one coordinate. Formalization Note: the statement uses only Mathlib terms.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_exists_unique_coord_of_squarefree_prod {k : ℕ} {d : Fin k → ℕ}
{p : ℕ} (hd1 : ∀ j, 1 ≤ d j) (hsq : Squarefree (∏ j, d j)) (hp : Nat.Prime p)
(hpd : p ∣ ∏ j, d j) : ∃! j, p ∣ d j := by sorrySource
GPY good-count product formula via the fiber bijection, formalized from Mathlib (no local definitions in statements)