| 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 6385 | . 2 ⊢ Tr On | |
| 2 | epweon 7775 | . 2 ⊢ E We On | |
| 3 | df-ord 6365 | . 2 ⊢ (Ord On ↔ (Tr On ∧ E We On)) | |
| 4 | 1, 2, 3 | mpbir2an 723 | 1 ⊢ Ord On |
| Colors of variables: wff setvar class |
| Syntax hints: Tr wtr 5219 E cep 5562 We wwe 5615 Ord word 6361 Oncon0 6362 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-tr 5220 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-ord 6365 df-on 6366 |
| This theorem is referenced by: onprc 7778 ssorduni 7779 ordeleqon 7782 ordsson 7783 onint 7790 ordsuci 7808 limon 7833 tfi 7850 ordom 7873 ordtypelem2 9482 hartogs 9507 card2on 9517 tskwe 9937 alephsmo 10087 ondomon 10548 dford3lem2 43737 dford3 43738 tfsconcatlem 44046 iunord 50437 |
| Copyright terms: Public domain | W3C validator |