Theorems · Theorem · order theory
Filter.limsup_sup_filter
∀ {α : Type u_1} {β : Type u_2} [inst : CompleteDistribLattice α] {f : Filter β} {u : β → α} {g : Filter β},
Filter.limsup u (f ⊔ g) = Filter.limsup u f ⊔ Filter.limsup u g- Defined in
- Mathlib.Order.LiminfLimsup
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteDistribLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
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.ofPredproof · cited by 6,101
- LE.le.transproof · cited by 3,151
- Filter.Eventuallyproof · cited by 3,134
- le_antisymmproof · cited by 2,068
- iInfproof · cited by 1,690
- InfSet.sInfproof · cited by 935
- Filter.Eventually.monoproof · cited by 646
- le_sup_leftproof · cited by 265
- le_sup_rightproof · cited by 242
- Filter.limsupstatement · cited by 226
- iInf_congr_Propproof · cited by 218
Cited by1
Results whose statement or proof uses this declaration.
- Filter.liminf_sup_filterproof · cited by 0