Theorems · Theorem · order theory
Filter.limsInf_le_limsSup
∀ {α : Type u_1} [inst : ConditionallyCompleteLattice α] {f : Filter α} [f.NeBot],
autoParam (Filter.IsBounded (fun x1 x2 => x1 ≤ x2) f) Filter.limsInf_le_limsSup._auto_1 →
autoParam (Filter.IsBounded (fun x1 x2 => x1 ≥ x2) f) Filter.limsInf_le_limsSup._auto_3 → f.limsInf ≤ f.limsSup- Defined in
- Mathlib.Order.LiminfLimsup
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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.Eventuallyproof · cited by 3,134
- le_transproof · cited by 985
- Filter.NeBotstatement and proof · cited by 853
- ConditionallyCompleteLatticestatement and proof · cited by 364
- Filter.Eventually.existsproof · cited by 168
- Filter.Eventually.andproof · cited by 157
- Filter.IsBoundedstatement and proof · cited by 45
- Filter.limsInfstatement · cited by 31
- Filter.limsSupstatement · cited by 29
- Filter.liminf_le_of_leproof · cited by 7
- Filter.le_limsup_of_leproof · cited by 5
Cited by2
Results whose statement or proof uses this declaration.
- Filter.liminf_le_limsupproof · cited by 6
- limsInf_eq_of_le_nhdsproof · cited by 2