Theorems · Definition · order theory
RelIso.prodLexCongr
{α₁ : Type u_5} →
{α₂ : Type u_6} →
{β₁ : Type u_7} →
{β₂ : Type u_8} →
{r₁ : α₁ → α₁ → Prop} →
{r₂ : α₂ → α₂ → Prop} →
{s₁ : β₁ → β₁ → Prop} → {s₂ : β₂ → β₂ → Prop} → r₁ ≃r s₁ → r₂ ≃r s₂ → Prod.Lex r₁ r₂ ≃r Prod.Lex s₁ s₂Given relation isomorphisms r₁ ≃r s₁ and r₂ ≃r s₂, construct a relation isomorphism for the
lexicographic orders on the product.
- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 1 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.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- RelIsostatement and proof · cited by 456
- RelIso.toEquivproof · cited by 113
- Equiv.prodCongrproof · cited by 24
Cited by1
Results whose statement or proof uses this declaration.
- Ordinal.lift_mulproof · cited by 0