Theorems · Theorem · order theory

Codisjoint.map_orderIso

∀ {α : Type u_2} {β : Type u_3} [inst : SemilatticeSup α] [inst_1 : OrderTop α] [inst_2 : SemilatticeSup β]
  [inst_3 : OrderTop β] {a b : α} (f : α ≃o β), Codisjoint a b → Codisjoint (f a) (f b)

Note that this goal could also be stated (Codisjoint on f) a b

Defined in

Mathlib.Order.Hom.Basic

Cited by

2 results in Mathlib

Foundations

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

Assumes

SemilatticeSupOrderTopSemilatticeSupOrderTop