Theorems · Theorem · order theory

OrderIso.map_csInf_of_directedOn

∀ {α : Type u_1} {β : Type u_2} [inst : ConditionallyCompletePartialOrderInf α]
  [inst_1 : ConditionallyCompletePartialOrderInf β] (e : α ≃o β) {s : Set α},
  DirectedOn (fun x1 x2 => x2 ≤ x1) s → s.Nonempty → BddBelow s → e (sInf s) = ⨅ x, e ↑x

Defined in

Mathlib.Order.ConditionallyCompletePartialOrder.Indexed

Cited by

0 results in Mathlib

Foundations

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

Assumes

ConditionallyCompletePartialOrderInfConditionallyCompletePartialOrderInf