Theorems · Theorem · combinatorics
Hindman.exists_idempotent_ultrafilter_le_FP
∀ {M : Type u_1} [inst : Semigroup M] (a : Stream' M), ∃ U, U * U = U ∧ ∀ᶠ (m : M) in ↑U, m ∈ Hindman.FP a- Defined in
- Mathlib.Combinatorics.Hindman
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 92 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Semigroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites30
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.Eventuallystatement and proof · cited by 3,134
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- add_commproof · cited by 1,535
- Set.iInterproof · cited by 1,084
- Stream'statement and proof · cited by 205
- Semigroupstatement and proof · cited by 202
- Ultrafilterstatement and proof · cited by 193
- Ultrafilter.toFilterstatement and proof · cited by 172
- Set.mem_ofPred_eqproof · cited by 122
Cited by1
Results whose statement or proof uses this declaration.
- Hindman.FP_partition_regularproof · cited by 0