Theorems · Definition · order theory
OrderIso.ofRelIsoLT
{α : Type u_6} →
{β : Type u_7} →
[inst : PartialOrder α] → [inst_1 : PartialOrder β] → ((fun x1 x2 => x1 < x2) ≃r fun x1 x2 => x1 < x2) → α ≃o βConverts a RelIso (<) (<) into an OrderIso.
- Defined in
- Mathlib.Order.Hom.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrderPartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderstatement and proof · cited by 6,410
- OrderIsostatement · cited by 874
- RelIsostatement and proof · cited by 456
- RelIso.toEquivproof · cited by 113
Cited by12
Results whose statement or proof uses this declaration.
- Order.enumproof · cited by 11
- OrderIso.sumLexIicIoiproof · cited by 6
- OrderIso.sumLexIioIciproof · cited by 6
- Ordinal.sSup_add_one_lt_of_lt_cofproof · cited by 2
- PrincipalSeg.orderIsoIioproof · cited by 2
- CategoryTheory.Limits.hasColimitsOfShape_of_initialSegproof · cited by 1
- Ordinal.exists_isFundamentalSeqproof · cited by 1
- OrderIso.ofRelIsoLT_applystatement · cited by 0
- OrderIso.ofRelIsoLT_symmstatement · cited by 0
- OrderIso.ofRelIsoLT_toRelIsoLTstatement · cited by 0
- OrderIso.toRelIsoLT_ofRelIsoLTstatement · cited by 0