Theorems · Definition · order theory
OrderIso.sumLexCongr
{α₁ : Type u_4} →
{α₂ : Type u_5} →
{β₁ : Type u_6} →
{β₂ : Type u_7} →
[inst : LE α₁] →
[inst_1 : LE α₂] → [inst_2 : LE β₁] → [inst_3 : LE β₂] → α₁ ≃o α₂ → β₁ ≃o β₂ → α₁ ⊕ₗ β₁ ≃o α₂ ⊕ₗ β₂Equiv.sumCongr promoted to an order isomorphism between lexicographic sums.
- Defined in
- Mathlib.Data.Sum.Order
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Equivproof · cited by 8,337
- OrderIsostatement and proof · cited by 874
- Lexstatement and proof · cited by 370
- Equiv.transproof · cited by 337
- toLexproof · cited by 195
- ofLexproof · cited by 127
- EquivLike.toEquivproof · cited by 125
- Equiv.sumCongrproof · cited by 25
Cited by6
Results whose statement or proof uses this declaration.
- OrderIso.sumLexIicIoiproof · cited by 6
- OrderIso.sumLexIioIciproof · cited by 6
- OrderIso.sumLexCongr_applystatement and proof · cited by 2
- OrderIso.sumLexCongr_reflstatement · cited by 0
- OrderIso.sumLexCongr_symmstatement · cited by 0
- OrderIso.sumLexCongr_transstatement and proof · cited by 0