isCoprime_div_gcd_div_gcd_of_gcd_ne_zero

∀ {R : Type u_1} [inst : EuclideanDomain R] [inst_1 : GCDMonoid R] {p q : R},
  gcd p q ≠ 0 → IsCoprime (p / gcd p q) (q / gcd p q)

This is a version of isCoprime_div_gcd_div_gcd which replaces the q ≠ 0 assumption with gcd p q ≠ 0.

Defined in: Mathlib.RingTheory.EuclideanDomain
Cited by: 1 results in Mathlib
Foundations: Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: EuclideanDomain GCDMonoid

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.