Theorems · Definition · order theory

OrderHomClass.toOrderHom

{F : Type u_1} →
  {α : Type u_2} →
    {β : Type u_3} →
      [inst : Preorder α] → [inst_1 : Preorder β] → [inst_2 : FunLike F α β] → [OrderHomClass F α β] → F → α →o β

Turn an element of a type F satisfying OrderHomClass F α β into an actual OrderHom. This is declared as the default coercion from F to α →o β.

Defined in

Mathlib.Order.Hom.Basic

Cited by

44 results in Mathlib

Foundations

Depth 6 from the axioms · uses no axioms

Assumes

PreorderPreorderFunLikeOrderHomClass