Theorems · Definition · order theory
OrderIso.toRelIsoLT
{α : Type u_2} →
{β : Type u_3} → [inst : Preorder α] → [inst_1 : Preorder β] → α ≃o β → (fun x1 x2 => x1 < x2) ≃r fun x1 x2 => x1 < x2Converts an OrderIso into a RelIso (<) (<).
- Defined in
- Mathlib.Order.Hom.Basic
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- OrderIsostatement and proof · cited by 874
- RelIsostatement · cited by 456
- RelIso.toEquivproof · cited by 113
- OrderIso.lt_iff_ltproof · cited by 16
Cited by10
Results whose statement or proof uses this declaration.
- OrderIso.toInitialSegproof · cited by 3
- Ordinal.typein_ordinalproof · cited by 3
- OrderIso.ordinalType_congrproof · cited by 2
- equivShrink_lt_equivShrinkproof · cited by 0
- OrderIso.coe_symm_toRelIsoLTstatement · cited by 0
- OrderIso.coe_toRelIsoLTstatement · cited by 0
- OrderIso.toRelIsoLT_applystatement · cited by 0
- OrderIso.ofRelIsoLT_toRelIsoLTstatement · cited by 0
- OrderIso.toRelIsoLT_ofRelIsoLTstatement · cited by 0
- OrderIso.toRelIsoLT_symmstatement · cited by 0