| 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 6348 | . 2 ⊢ Tr On | |
| 2 | epweon 7730 | . 2 ⊢ E We On | |
| 3 | df-ord 6328 | . 2 ⊢ (Ord On ↔ (Tr On ∧ E We On)) | |
| 4 | 1, 2, 3 | mpbir2an 712 | 1 ⊢ Ord On |
| Colors of variables: wff setvar class |
| Syntax hints: Tr wtr 5207 E cep 5531 We wwe 5584 Ord word 6324 Oncon0 6325 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-tr 5208 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-ord 6328 df-on 6329 |
| This theorem is referenced by: onprc 7733 ssorduni 7734 ordeleqon 7737 ordsson 7738 onint 7745 ordsuci 7763 limon 7788 tfi 7805 ordom 7828 ordtypelem2 9436 hartogs 9461 card2on 9471 tskwe 9874 alephsmo 10024 ondomon 10485 dford3lem2 43381 dford3 43382 tfsconcatlem 43690 iunord 50032 |
| Copyright terms: Public domain | W3C validator |