Theorems · Inductive type · combinatorics
Hindman.FS
{M : Type u_1} → [AddSemigroup M] → Stream' M → Set MFS a is the set of finite sums in a, i.e. m ∈ FS a if m is the sum of a nonempty
subsequence of a. We give a direct inductive definition instead of talking about subsequences.
- Defined in
- Mathlib.Combinatorics.Hindman
- Cited by
- 11 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
- Assumes
- AddSemigroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Stream'statement · cited by 205
- AddSemigroupstatement · cited by 136
Cited by18
Results whose statement or proof uses this declaration.
- Hindman.FS.tailstatement and proof · cited by 4
- Hindman.FS.consstatement and proof · cited by 3
- Hindman.FS.headstatement · cited by 3
- Hindman.FS_iter_tail_sub_FSstatement and proof · cited by 2
- Hindman.exists_FS_of_largestatement and proof · cited by 2
- Hindman.FS.finsetSumstatement and proof · cited by 1
- Hindman.FS.singletonstatement and proof · cited by 1
- Hindman.exists_idempotent_ultrafilter_le_FSstatement and proof · cited by 1
- Hindman.FS.addstatement and proof · cited by 1
- Hindman.FS.belowstatement · cited by 1
- Hindman.FS.casesOnstatement and proof · cited by 0
- Hindman.FS.finset_sumstatement · cited by 0