Theorems · Theorem · order theory

GaloisInsertion.l_sup_u

∀ {α : Type u} {β : Type v} {l : α → β} {u : β → α} [inst : SemilatticeSup α] [inst_1 : SemilatticeSup β]
  (gi : GaloisInsertion l u) (a b : β), l (u a ⊔ u b) = a ⊔ b

Defined in

Mathlib.Order.GaloisConnection.Basic

Cited by

11 results in Mathlib

Foundations

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

Assumes

SemilatticeSupSemilatticeSup