Theorems · Definition · order theory

OrderRingHomClass.toOrderRingHom

{F : Type u_1} →
  {α : Type u_2} →
    {β : Type u_3} →
      [inst : FunLike F α β] →
        [inst_1 : NonAssocSemiring α] →
          [inst_2 : Preorder α] →
            [inst_3 : NonAssocSemiring β] →
              [inst_4 : Preorder β] → [OrderHomClass F α β] → [RingHomClass F α β] → F → α →+*o β

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

Defined in

Mathlib.Algebra.Order.Hom.Ring

Cited by

3 results in Mathlib

Foundations

Depth 15 from the axioms · uses no axioms

Assumes

FunLikeNonAssocSemiringPreorderNonAssocSemiringPreorderOrderHomClassRingHomClass