| 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 6386 | . 2 ⊢ Tr On | |
| 2 | epweon 7790 | . 2 ⊢ E We On | |
| 3 | df-ord 6366 | . 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 5212 E cep 5550 We wwe 5603 Ord word 6362 Oncon0 6363 |
| 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 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-pr 5391 |
| 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 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3900 df-un 3902 df-in 3904 df-ss 3915 df-pss 4035 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-ord 6366 df-on 6367 |
| This theorem is used by: onprc 7793 ssorduni 7794 ordeleqon 7797 ordsson 7798 onint 7805 ordsuci 7823 limon 7848 tfi 7865 ordom 7888 ordtypelem2 9514 hartogs 9539 card2on 9549 tskwe 10032 alephsmo 10182 ondomon 10648 dford3lem2 44035 dford3 44036 tfsconcatlem 44339 iunord 50785 |
| Copyright terms: Public domain | W3C validator |