Theorems · Theorem · general topology
Filter.eventually_forall_ge_atTop
∀ {α : Type u_3} [inst : Preorder α] {p : α → Prop},
(∀ᶠ (x : α) in Filter.atTop, ∀ (y : α), x ≤ y → p y) ↔ ∀ᶠ (x : α) in Filter.atTop, p x- Defined in
- Mathlib.Order.Filter.AtTopBot.Finite
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Preorderstatement and proof · cited by 7,952
- Set.Elemproof · cited by 7,166
- Filter.Eventuallystatement and proof · cited by 3,134
- Filter.atTopstatement and proof · cited by 2,405
- Set.Finiteproof · cited by 1,814
- le_rflproof · cited by 1,558
- Set.iInterproof · cited by 1,084
- Set.Iciproof · cited by 1,070
- le_transproof · cited by 985
- Filter.Eventually.monoproof · cited by 646
- Set.Subset.rflproof · cited by 255
Cited by5
Results whose statement or proof uses this declaration.
- Filter.Tendsto.eventually_forall_ge_atTopproof · cited by 7
- Asymptotics.isBigO_nat_atTop_induction_of_eventually_posproof · cited by 2
- Asymptotics.isBigO_nat_atTop_inductionproof · cited by 1
- AkraBazziRecurrence.GrowsPolynomially.eventually_zero_of_frequently_zeroproof · cited by 1
- Filter.eventually_forall_le_atBotproof · cited by 1