Theorems · Theorem · combinatorics
Hindman.exists_FS_of_large
∀ {M : Type u_1} [inst : AddSemigroup M] (U : Ultrafilter M), U + U = U → ∀ s₀ ∈ U, ∃ a, Hindman.FS a ⊆ s₀- Defined in
- Mathlib.Combinatorics.Hindman
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddSemigroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
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
- Set.ofPredproof · cited by 6,101
- Filter.Eventuallyproof · cited by 3,134
- Set.Nonemptyproof · cited by 2,627
- Set.inter_subset_leftproof · cited by 360
- Set.inter_subset_rightproof · cited by 329
- Stream'statement and proof · cited by 205
- Ultrafilterstatement and proof · cited by 193
- Ultrafilter.toFilterproof · cited by 172
- Filter.inter_memproof · cited by 153
- AddSemigroupstatement and proof · cited by 136
- Stream'.tailproof · cited by 68
Cited by2
Results whose statement or proof uses this declaration.
- Hindman.FS_partition_regularproof · cited by 0
- Hindman.exists_FS_of_finite_coverproof · cited by 0