Theorems · Theorem · group theory
Finset.prod_list_count_of_subset
∀ {M : Type u_4} [inst : CommMonoid M] [inst_1 : DecidableEq M] (m : List M) (s : Finset M),
m.toFinset ⊆ s → m.prod = ∏ i ∈ s, i ^ List.count i m- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 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.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.prodstatement and proof · cited by 2,356
- CommMonoidstatement and proof · cited by 2,264
- pow_zeroproof · cited by 1,094
- List.toFinsetstatement and proof · cited by 108
- Finset.prod_subsetproof · cited by 31
- List.mem_toFinsetproof · cited by 20
- Finset.prod_list_countproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Finset.prod_multiset_count_of_subsetproof · cited by 1