| 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 6406 | . 2 ⊢ Tr On | |
| 2 | epweon 7816 | . 2 ⊢ E We On | |
| 3 | df-ord 6386 | . 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 5216 E cep 5555 We wwe 5608 Ord word 6382 Oncon0 6383 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5253 ax-pr 5396 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-tr 5217 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-ord 6386 df-on 6387 |
| This theorem is used by: onprc 7819 ssorduni 7820 ordeleqon 7823 ordsson 7824 onint 7831 ordsuci 7849 limon 7874 tfi 7891 ordom 7914 ordtypelem2 9543 hartogs 9568 card2on 9578 tskwe 10061 alephsmo 10211 ondomon 10677 j00smo 36018 dford3lem2 44238 dford3 44239 tfsconcatlem 44541 iunord 51074 |
| Copyright terms: Public domain | W3C validator |