A prime cannot divide both parts of a squarefree number
Provedgpy_sq_not_dvd_bothnumber-theory
For a squarefree natural number n and a divisor d of n, no prime p divides both d and the complementary quotient n / d: that would give p * p dividing n. This is an unconditional elementary lemma.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_sq_not_dvd_both {n d : ℕ} (hsq : Squarefree n) (hd : d ∣ n)
{p : ℕ} (hp : p.Prime) : ¬ (p ∣ d ∧ p ∣ n / d) := by sorrySource
GPY monomial joint (GPYMonomialJoint.lean), restated into Mathlib-only terms