Theorems · Theorem · logic and foundations
ZFSet.isOrdinal_iff_isWellOrder
∀ {x : ZFSet.{u}}, x.IsOrdinal ↔ x.IsTransitive ∧ IsWellOrder (↥x) (Subrel (fun x1 x2 => x1 ∈ x2) fun x_1 => x_1 ∈ x)An ordinal is a transitive set, well-ordered under membership.
- Defined in
- Mathlib.SetTheory.ZFC.Ordinal
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 38 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ZFSetstatement and proof · cited by 259
- IsWellOrderstatement and proof · cited by 171
- Subrelstatement and proof · cited by 53
- ZFSet.IsOrdinalstatement and proof · cited by 34
- ZFSet.IsTransitivestatement and proof · cited by 22
- ZFSet.IsOrdinal.isTransitiveproof · cited by 7
- ZFSet.isOrdinal_iff_isTransproof · cited by 3
- ZFSet.IsOrdinal.isWellOrderproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.