Theorems · Theorem · order theory
RelEmbedding.isWellOrder
∀ {α : Type u_1} {β : Type u_2} {r : α → α → Prop} {s : β → β → Prop} (x : r ↪r s) [IsWellOrder β s], IsWellOrder α r- Defined in
- Mathlib.Order.RelIso.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsWellOrder
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.
- RelEmbeddingstatement and proof · cited by 281
- IsWellOrderstatement and proof · cited by 171
- IsStrictTotalOrderproof · cited by 10
- RelEmbedding.isStrictTotalOrderproof · cited by 1
Cited by5
Results whose statement or proof uses this declaration.
- Cardinal.mul_eq_selfproof · cited by 13
- Cardinal.gc_ord_cardproof · cited by 6
- RelEmbedding.collapseproof · cited by 2
- Ordinal.exists_fundamental_sequenceproof · cited by 0
- OrderEmbedding.isWellOrderproof · cited by 0