Theorems · Theorem · order theory
Filter.bliminf_eq_liminf
∀ {α : Type u_1} {β : Type u_2} [inst : ConditionallyCompleteLattice α] {f : Filter β} {u : β → α} {p : β → Prop},
Filter.bliminf u f p = Filter.liminf u (f ⊓ Filter.principal {x | p x})- Defined in
- Mathlib.Order.LiminfLimsup
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- ConditionallyCompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- Set.ofPredstatement · cited by 6,101
- Filter.principalstatement · cited by 740
- ConditionallyCompleteLatticestatement and proof · cited by 364
- Filter.liminfstatement · cited by 198
- Filter.bliminfstatement · cited by 27
- Filter.blimsup_eq_limsupproof · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.