Theorems · Definition · order theory
RelIso.sumLexComplLeft
{α : Type u_1} →
(r : α → α → Prop) →
(x : α) →
[IsTrans α r] →
[Std.Trichotomous r] →
[DecidableRel r] → Sum.Lex (Subrel r fun x_1 => r x_1 x) (Subrel r fun x_1 => ¬r x_1 x) ≃r rA relation is isomorphic to the lexicographic sum of elements less than x and elements not
less than x.
- Defined in
- Mathlib.Order.Hom.Lex
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Classical.choice, 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.
- Equivproof · cited by 8,337
- RelIsostatement · cited by 456
- IsTransstatement and proof · cited by 157
- Subrelstatement · cited by 53
- Equiv.sumComplproof · cited by 23
Cited by4
Results whose statement or proof uses this declaration.
- OrderIso.sumLexIioIciproof · cited by 6
- RelIso.sumLexComplLeft_symm_applystatement · cited by 0
- InitialSeg.exists_sum_relIsoproof · cited by 0
- RelIso.sumLexComplLeft_applystatement · cited by 0