| 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 6340 | . 2 ⊢ Tr On | |
| 2 | epweon 7722 | . 2 ⊢ E We On | |
| 3 | df-ord 6320 | . 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 5193 E cep 5523 We wwe 5576 Ord word 6316 Oncon0 6317 |
| 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 5231 ax-pr 5370 |
| 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 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-tr 5194 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-ord 6320 df-on 6321 |
| This theorem is referenced by: onprc 7725 ssorduni 7726 ordeleqon 7729 ordsson 7730 onint 7737 ordsuci 7755 limon 7780 tfi 7797 ordom 7820 ordtypelem2 9427 hartogs 9452 card2on 9462 tskwe 9865 alephsmo 10015 ondomon 10476 dford3lem2 43473 dford3 43474 tfsconcatlem 43782 iunord 50163 |
| Copyright terms: Public domain | W3C validator |