Theorems · Theorem · general topology
Filter.subseq_forall_of_frequently
∀ {ι : Type u_6} {x : ℕ → ι} {p : ι → Prop} {l : Filter ι},
Filter.Tendsto x Filter.atTop l →
(∃ᶠ (n : ℕ) in Filter.atTop, p (x n)) →
∃ ns, Filter.Tendsto (fun n => x (ns n)) Filter.atTop l ∧ ∀ (n : ℕ), p (x (ns n))- Defined in
- Mathlib.Order.Filter.AtTopBot.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Filterstatement and proof · cited by 8,121
- Filter.Tendstostatement and proof · cited by 3,814
- Filter.atTopstatement and proof · cited by 2,405
- Filter.Tendsto.compproof · cited by 560
- Filter.Frequentlystatement and proof · cited by 414
- Filter.tendsto_idproof · cited by 180
- Filter.tendsto_atTop_monoproof · cited by 22
- Filter.frequently_atTopproof · cited by 14
Cited by1
Results whose statement or proof uses this declaration.
- Filter.exists_seq_forall_of_frequentlyproof · cited by 7