Theorems · Theorem · combinatorics
Hindman.FS.finsetSum
∀ {M : Type u_1} [inst : AddCommMonoid M] (a : Stream' M) (s : Finset ℕ), s.Nonempty → ∑ i ∈ s, a.get i ∈ Hindman.FS a- Defined in
- Mathlib.Combinatorics.Hindman
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 68 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.
Cites27
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · 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
- add_zeroproof · cited by 2,707
- add_commproof · cited by 1,535
- Finset.Nonemptystatement and proof · cited by 1,001
- Finset.eraseproof · cited by 455
- Stream'statement and proof · cited by 205
- Finset.eq_empty_or_nonemptyproof · cited by 104
- Stream'.getstatement and proof · cited by 86
- Finset.min'proof · cited by 58
Cited by1
Results whose statement or proof uses this declaration.
- Hindman.FS.finset_sumproof · cited by 0