| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: The empty set is an ordinal number. Corollary 7N(b) of [Enderton] p. 193. |
| Ref | Expression |
|---|---|
| 0elon |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ord0 3021 |
. 2
| |
| 2 | 0ex 2711 |
. . 3
| |
| 3 | 2 | elon 2957 |
. 2
|
| 4 | 1, 3 | mpbir 190 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: inton 3026 onne0 3033 orduninsuc 3114 on0eqelt 3124 tz7.44-1 3928 rdgsuct 3945 rdglimt 3948 1on 4138 ordgt0ge1 4144 oa0 4155 om0 4156 oe0m 4157 oe0m0 4159 oe0 4161 oa1suc 4164 oesuc 4166 omcl 4171 oecl 4172 oa0r 4173 om0r 4174 om1 4176 oe1 4178 oaord1 4185 oaword1 4186 oaword2 4187 oawordeu 4189 oa00 4193 odi 4210 rankon 4671 rankeq0 4696 numth2 4785 card0 4823 alephon 4865 alephgeom 4882 alephfplem1 4896 cdafi 4936 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-10 966 ax-11 967 ax-12 968 ax-14 970 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-10o 1140 ax-16 1210 ax-11o 1218 ax-ext 1459 ax-nul 2710 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3an 777 df-ex 981 df-sb 1172 df-eu 1382 df-mo 1383 df-clab 1464 df-cleq 1469 df-clel 1472 df-ne 1587 df-ral 1649 df-rex 1650 df-v 1812 df-dif 2049 df-un 2050 df-in 2051 df-ss 2053 df-nul 2281 df-pw 2402 df-sn 2412 df-pr 2413 df-op 2416 df-uni 2504 df-br 2620 df-tr 2681 df-po 2840 df-so 2850 df-fr 2917 df-we 2934 df-ord 2951 df-on 2952 |