Theorems · Theorem · group theory
Set.mem_finsetSum
∀ {ι : Type u_1} {α : Type u_2} [inst : AddCommMonoid α] (t : Finset ι) (f : ι → Set α) (a : α),
a ∈ ∑ i ∈ t, f i ↔ ∃ g, ∃ (_ : ∀ {i : ι}, i ∈ t → g i ∈ f i), ∑ i ∈ t, g i = aThe n-ary version of Set.mem_add.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites17
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- Finset.sumstatement and proof · cited by 5,195
- Function.updateproof · cited by 502
- Function.update_selfproof · cited by 201
- Function.update_of_neproof · cited by 198
- Finset.sum_insertproof · cited by 196
- Finset.induction_onproof · cited by 167
- Finset.mem_insert_selfproof · cited by 128
- Finset.mem_insert_of_memproof · cited by 109
- Finset.mem_insertproof · cited by 44
Cited by4
Results whose statement or proof uses this declaration.
- Set.image_finsetSum_piproof · cited by 2
- Set.mem_nsmul_iff_sumproof · cited by 0
- Set.mem_finset_sumproof · cited by 0
- Set.mem_fintype_sumproof · cited by 0