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 6214 | . 2 ⊢ Tr On | |
2 | epweon 7497 | . 2 ⊢ E We On | |
3 | df-ord 6194 | . 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 5172 E cep 5464 We wwe 5513 Ord word 6190 Oncon0 6191 |
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 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 ax-un 7461 |
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 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-tr 5173 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-ord 6194 df-on 6195 |
This theorem is referenced by: onprc 7499 ssorduni 7500 ordeleqon 7503 ordsson 7504 onint 7510 suceloni 7528 limon 7551 tfi 7568 ordom 7589 ordtypelem2 8983 hartogs 9008 card2on 9018 tskwe 9379 alephsmo 9528 ondomon 9985 dford3lem2 39644 dford3 39645 iunord 44799 |
Copyright terms: Public domain | W3C validator |