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 6216 | . 2 ⊢ Tr On | |
2 | epweon 7499 | . 2 ⊢ E We On | |
3 | df-ord 6196 | . 2 ⊢ (Ord On ↔ (Tr On ∧ E We On)) | |
4 | 1, 2, 3 | mpbir2an 709 | 1 ⊢ Ord On |
Colors of variables: wff setvar class |
Syntax hints: Tr wtr 5174 E cep 5466 We wwe 5515 Ord word 6192 Oncon0 6193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-tr 5175 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-ord 6196 df-on 6197 |
This theorem is referenced by: onprc 7501 ssorduni 7502 ordeleqon 7505 ordsson 7506 onint 7512 suceloni 7530 limon 7553 tfi 7570 ordom 7591 ordtypelem2 8985 hartogs 9010 card2on 9020 tskwe 9381 alephsmo 9530 ondomon 9987 dford3lem2 39631 dford3 39632 iunord 44786 |
Copyright terms: Public domain | W3C validator |