Theorems · Theorem · order theory

Filter.blimsup_congr

∀ {α : Type u_1} {β : Type u_2} [inst : ConditionallyCompleteLattice α] {f : Filter β} {u v : β → α} {p : β → Prop},
  (∀ᶠ (a : β) in f, p a → u a = v a) → Filter.blimsup u f p = Filter.blimsup v f p

Defined in

Mathlib.Order.LiminfLimsup

Cited by

4 results in Mathlib

Foundations

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

Assumes

ConditionallyCompleteLattice