| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordon | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| ordon | ⊢ Ord On |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tron 6385 | . 2 ⊢ Tr On | |
| 2 | epweon 7789 | . 2 ⊢ E We On | |
| 3 | df-ord 6365 | . 2 ⊢ (Ord On ↔ (Tr On ∧ E We On)) | |
| 4 | 1, 2, 3 | mpbir2an 724 | 1 ⊢ Ord On |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: Tr wtr 5211 E cep 5549 We wwe 5602 Ord word 6361 Oncon0 6362 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-tr 5212 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-ord 6365 df-on 6366 |
| This theorem is used by: onprc 7792 ssorduni 7793 ordeleqon 7796 ordsson 7797 onint 7804 ordsuci 7822 limon 7847 tfi 7864 ordom 7887 ordtypelem2 9516 hartogs 9541 card2on 9551 tskwe 10034 alephsmo 10184 ondomon 10650 j00smo 35944 dford3lem2 44127 dford3 44128 tfsconcatlem 44431 iunord 50952 |
| Copyright terms: Public domain | W3C validator |