Theorems · Theorem · order theory

IsCompl.map

∀ {F : Type u_1} {α : Type u_2} {β : Type u_3} [inst : Lattice α] [inst_1 : Lattice β] [inst_2 : FunLike F α β]
  [inst_3 : BoundedOrder α] [inst_4 : BoundedOrder β] [BoundedLatticeHomClass F α β] {a b : α} (f : F),
  IsCompl a b → IsCompl (f a) (f b)

Defined in

Mathlib.Order.Hom.BoundedLattice

Cited by

2 results in Mathlib

Foundations

Depth 11 from the axioms · uses propext

Assumes

LatticeLatticeFunLikeBoundedOrderBoundedOrderBoundedLatticeHomClass