Mathlib Map

Theorems · Theorem · order theory

OrderIso.isCompl

∀ {α : Type u_2} {β : Type u_3} [inst : Lattice α] [inst_1 : Lattice β] [inst_2 : BoundedOrder α]
  [inst_3 : BoundedOrder β] (f : α ≃o β) {x y : α}, IsCompl x y → IsCompl (f x) (f y)
Defined in
Mathlib.Order.Hom.Basic
Cited by
1 results in Mathlib
Foundations
Depth 29 from the axioms · uses propext, Quot.sound
Assumes
LatticeLatticeBoundedOrderBoundedOrder
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

OrderIso.isCompl_iff · cited by 3OrderIso.isCompl_iffDFunLike.coe · cited by 62936DFunLike.coeLattice · cited by 916LatticeOrderIso · cited by 874OrderIsoIsCompl · cited by 351IsComplBoundedOrder · cited by 270BoundedOrderIsCompl.disjoint · cited by 42IsCompl.disjointIsCompl.codisjoint · cited by 32IsCompl.codisjointDisjoint.map_orderIso · cited by 3Disjoint.map_orderIsoCodisjoint.map_orderIso · cited by 2Codisjoint.map_orderIsoOrderIso.isComplCITED BYCITES

Cites9

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

Cited by1

Results whose statement or proof uses this declaration.