Theorems · Theorem · order theory

Filter.liminf_le_liminf_of_le

∀ {α : Type u_6} {β : Type u_7} [inst : ConditionallyCompleteLattice β] {f g : Filter α},
  g ≤ f →
    ∀ {u : α → β},
      autoParam (Filter.IsBoundedUnder (fun x1 x2 => x1 ≥ x2) f u) Filter.liminf_le_liminf_of_le._auto_1 →
        autoParam (Filter.IsCoboundedUnder (fun x1 x2 => x1 ≥ x2) g u) Filter.liminf_le_liminf_of_le._auto_3 →
          Filter.liminf u f ≤ Filter.liminf u g

Defined in

Mathlib.Order.LiminfLimsup

Cited by

3 results in Mathlib

Foundations

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

Assumes

ConditionallyCompleteLattice