Theorem ordon 4631

Description: The class of all ordinal numbers is ordinal. Proposition 7.12 of [TakeutiZaring] p. 38, but without using the Axiom of Regularity. (Contributed by NM, 17-May-1994.)

Assertion

Ref	Expression
ordon	⊢ Ord On

Proof of Theorem ordon

Step	Hyp	Ref	Expression
1		tron 4525	. 2 ⊢ Tr On
2		df-on 4511	. . . . 5 ⊢ On = {𝑥 ∣ Ord 𝑥}
3	2	abeq2i 2349	. . . 4 ⊢ (𝑥 ∈ On ↔ Ord 𝑥)
4		ordtr 4521	. . . 4 ⊢ (Ord 𝑥 → Tr 𝑥)
5	3, 4	sylbi 121	. . 3 ⊢ (𝑥 ∈ On → Tr 𝑥)
6	5	rgen 2603	. 2 ⊢ ∀𝑥 ∈ On Tr 𝑥
7		dford3 4510	. 2 ⊢ (Ord On ↔ (Tr On ∧ ∀𝑥 ∈ On Tr 𝑥))
8	1, 6, 7	mpbir2an 955	1 ⊢ Ord On

Syntax hints:   ∈ wcel 2209  ∀wral 2528  Tr wtr 4227  Ord word 4505  Oncon0 4506

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-in 3226  df-ss 3233  df-uni 3934  df-tr 4228  df-iord 4509  df-on 4511

This theorem is referenced by:  ssorduni  4632  limon  4658  onprc  4697  tfri1dALT  6616  rdgon  6651