RelHom.toOrderHom

{α : Type u_2} →
  {β : Type u_3} →
    [inst : PartialOrder α] → [inst_1 : Preorder β] → ((fun x1 x2 => x1 < x2) →r fun x1 x2 => x1 < x2) → α →o β

A bundled expression of the fact that a map between partial orders that is strictly monotone is weakly monotone.

Defined in: Mathlib.Order.Hom.Basic
Cited by: 3 results in Mathlib
Foundations: Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: PartialOrder Preorder

Around this declaration

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

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

Results whose statement or proof uses this declaration.