Mathlib Map

Theorems · Theorem · order theory

ciSup_mono

∀ {α : Type u_1} {ι : Sort u_4} [inst : ConditionallyCompleteLattice α] {f g : ι → α},
  BddAbove (Set.range g) → (∀ (x : ι), f x ≤ g x) → iSup f ≤ iSup g

The indexed suprema of two functions are comparable if the functions are pointwise comparable

Defined in
Mathlib.Order.ConditionallyCompleteLattice.Indexed
Cited by
9 results in Mathlib
Foundations
Depth 29 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.

Cites11

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by9

Results whose statement or proof uses this declaration.