Theorems · Theorem · order theory

Filter.blimsup_or_eq_sup

∀ {α : Type u_1} {β : Type u_2} [inst : CompleteDistribLattice α] {f : Filter β} {p q : β → Prop} {u : β → α},
  (Filter.blimsup u f fun x => p x ∨ q x) = Filter.blimsup u f p ⊔ Filter.blimsup u f q

Defined in

Mathlib.Order.LiminfLimsup

Cited by

2 results in Mathlib

Foundations

Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CompleteDistribLattice