Theorems · Theorem · logic and foundations
WellOrder.mk.injEq
∀ (α : Type u) (r : α → α → Prop) (wo : IsWellOrder α r) (α_1 : Type u) (r_1 : α_1 → α_1 → Prop)
(wo_1 : IsWellOrder α_1 r_1),
({ α := α, r := r, wo := wo } = { α := α_1, r := r_1, wo := wo_1 }) = (α = α_1 ∧ r ≍ r_1)- Defined in
- Mathlib.SetTheory.Ordinal.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses propext
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.
- IsWellOrderstatement and proof · cited by 171
- WellOrderstatement · cited by 12
- WellOrder.mk.injproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.