Theorems · Theorem · group theory
Finset.prod_biUnion_of_pairwise_eq_one
∀ {ι : Type u_1} {κ : Type u_2} {M : Type u_4} [inst : CommMonoid M] {f : ι → M} [inst_1 : DecidableEq ι] {s : Finset κ}
{t : κ → Finset ι},
((↑s).Pairwise fun i j => ∀ k ∈ t i ∩ t j, f k = 1) → ∏ x ∈ s.biUnion t, f x = ∏ x ∈ s, ∏ i ∈ t x, f i- Cited by
- 0 results in Mathlib
- Foundations
- Depth 76 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.
Cites11
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
- SetLike.coestatement and proof · cited by 8,199
- Finset.prodstatement and proof · cited by 2,356
- CommMonoidstatement and proof · cited by 2,264
- Finset.filterproof · cited by 949
- Finset.prod_congrproof · cited by 646
- Set.Pairwisestatement and proof · cited by 321
- Finset.biUnionstatement and proof · cited by 217
- Finset.filter_congrproof · cited by 167
- Finset.prod_biUnionproof · cited by 3
- Finset.prod_filter_ne_oneproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.