Theorems · Theorem · commutative algebra
UniqueFactorizationMonoid.induction_on_coprime
∀ {α : Type u_1} [inst : CommMonoidWithZero α] [UniqueFactorizationMonoid α] {P : α → Prop} (a : α),
P 0 →
(∀ {x : α}, IsUnit x → P x) →
(∀ {p : α} (i : ℕ), Prime p → P (p ^ i)) → (∀ {x y : α}, IsRelPrime x y → P x → P y → P (x * y)) → P aIf P holds for 0, units and powers of primes,
and P x ∧ P y for coprime x, y implies P (x * y),
then P holds on all a : α.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites25
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Unitsproof · cited by 2,804
- Multisetproof · cited by 2,627
- Nontrivialproof · cited by 2,416
- Units.valproof · cited by 1,966
- IsUnitstatement and proof · cited by 1,602
- CommMonoidWithZerostatement and proof · cited by 913
- Multiset.prodproof · cited by 528
- Multiset.countproof · cited by 302
- Associatedproof · cited by 296
- UniqueFactorizationMonoidstatement and proof · cited by 279
- Primestatement and proof · cited by 277
- Multiset.toFinsetproof · cited by 230
Cited by1
Results whose statement or proof uses this declaration.
- divRadical_dvd_derivativeproof · cited by 1