Theorems · Theorem · order theory

OrderIso.map_csInf

∀ {α : Type u_1} {β : Type u_2} [inst : ConditionallyCompleteLattice α] [inst_1 : ConditionallyCompleteLattice β]
  (e : α ≃o β) {s : Set α}, s.Nonempty → BddBelow s → e (sInf s) = ⨅ x, e ↑x

Defined in

Mathlib.Order.ConditionallyCompleteLattice.Indexed

Cited by

0 results in Mathlib

Foundations

Depth 29 from the axioms · uses propext, Quot.sound

Assumes

ConditionallyCompleteLatticeConditionallyCompleteLattice