| 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 6390 | . 2 ⊢ Tr On | |
| 2 | epweon 7783 | . 2 ⊢ E We On | |
| 3 | df-ord 6370 | . 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 5223 E cep 5565 We wwe 5618 Ord word 6366 Oncon0 6367 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| 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 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-tr 5224 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-ord 6370 df-on 6371 |
| This theorem is used by: onprc 7786 ssorduni 7787 ordeleqon 7790 ordsson 7791 onint 7798 ordsuci 7816 limon 7841 tfi 7858 ordom 7881 ordtypelem2 9491 hartogs 9516 card2on 9526 tskwe 9955 alephsmo 10105 ondomon 10565 dford3lem2 43795 dford3 43796 tfsconcatlem 44104 iunord 50495 |
| Copyright terms: Public domain | W3C validator |