Theorems · Definition · order theory
InitialSeg.total
{α : Type u_1} →
{β : Type u_2} →
(r : α → α → Prop) → (s : β → β → Prop) → [IsWellOrder α r] → [IsWellOrder β s] → InitialSeg r s ⊕ InitialSeg s rFor any two well orders, one is an initial segment of the other.
- Defined in
- Mathlib.Order.InitialSeg
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 29 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsWellOrderIsWellOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- RelIsoproof · cited by 456
- RelIso.symmproof · cited by 193
- IsWellOrderstatement and proof · cited by 171
- PrincipalSeg.toRelEmbeddingproof · cited by 129
- PrincipalSegproof · cited by 73
- InitialSegstatement and proof · cited by 70
- RelIso.transproof · cited by 18
- RelIso.toInitialSegproof · cited by 4
- PrincipalSeg.transRelIsoproof · cited by 3
- InitialSeg.principalSumRelIsoproof · cited by 2
- RelEmbedding.collapseproof · cited by 2
- InitialSeg.leAddproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.