Theorems · Theorem · commutative algebra
Associates.eq_factors_of_eq_counts
∀ {α : Type u_1} [inst : CommMonoidWithZero α] [inst_1 : UniqueFactorizationMonoid α]
[inst_2 : DecidableEq (Associates α)] [inst_3 : (p : Associates α) → Decidable (Irreducible p)] {a b : Associates α},
a ≠ 0 → b ≠ 0 → (∀ (p : Associates α), Irreducible p → p.count a.factors = p.count b.factors) → a.factors = b.factors- Cited by
- 1 results in Mathlib
- Foundations
- Depth 52 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetproof · cited by 2,627
- WithTop.someproof · cited by 1,128
- CommMonoidWithZerostatement and proof · cited by 913
- Irreduciblestatement and proof · cited by 496
- 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
- Associates.FactorSetstatement · cited by 52
- Multiset.ext'proof · cited by 31
- Associates.count.congr_simpproof · cited by 10
- Associates.count_someproof · cited by 8
Cited by1
Results whose statement or proof uses this declaration.
- Associates.eq_of_eq_countsproof · cited by 2