Theorems · Theorem · group theory
Finset.prod_list_count
∀ {M : Type u_4} [inst : CommMonoid M] [inst_1 : DecidableEq M] (s : List M),
s.prod = ∏ m ∈ s.toFinset, m ^ List.count m s- Cited by
- 1 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommMonoidDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finset.prodstatement · cited by 2,356
- CommMonoidstatement and proof · cited by 2,264
- Finset.prod_congrproof · cited by 646
- List.toFinsetstatement and proof · cited by 108
- Finset.prod_list_map_countproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Finset.prod_list_count_of_subsetproof · cited by 1