Theorems · Theorem · order theory

GaloisConnection.l_csSup_of_directedOn

∀ {α : Type u_1} {β : Type u_2} [inst : ConditionallyCompletePartialOrderSup α]
  [inst_1 : ConditionallyCompletePartialOrderSup β] {l : α → β} {u : β → α},
  GaloisConnection l u →
    ∀ {s : Set α}, DirectedOn (fun x1 x2 => x1 ≤ x2) s → s.Nonempty → BddAbove s → l (sSup s) = ⨆ x, l ↑x

Defined in

Mathlib.Order.ConditionallyCompletePartialOrder.Indexed

Cited by

2 results in Mathlib

Foundations

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

Assumes

ConditionallyCompletePartialOrderSupConditionallyCompletePartialOrderSup