Theorems · Theorem · commutative algebra
Associates.count_le_count_of_factors_le
∀ {α : Type u_1} [inst : CommMonoidWithZero α] [inst_1 : UniqueFactorizationMonoid α]
[inst_2 : DecidableEq (Associates α)] [inst_3 : (p : Associates α) → Decidable (Irreducible p)]
{a b p : Associates α}, b ≠ 0 → Irreducible p → a.factors ≤ b.factors → p.count a.factors ≤ p.count b.factors- Cited by
- 1 results in Mathlib
- Foundations
- Depth 35 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topproof · cited by 9,680
- Multisetstatement and proof · cited by 2,627
- WithTop.someproof · cited by 1,128
- CommMonoidWithZerostatement and proof · cited by 913
- Irreduciblestatement and proof · cited by 496
- Multiset.countproof · cited by 302
- UniqueFactorizationMonoidstatement and proof · cited by 279
- Associatesstatement and proof · cited by 210
- Associates.factorsstatement and proof · cited by 97
- Associates.countstatement and proof · cited by 79
- WithTop.coe_le_coeproof · cited by 65
- Associates.FactorSetstatement and proof · cited by 52
Cited by1
Results whose statement or proof uses this declaration.
- Associates.count_le_count_of_leproof · cited by 2