| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A limit ordinal contains the empty set. |
| Ref | Expression |
|---|---|
| 0ellim |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nlim0 3721 |
. . . 4
| |
| 2 | limeq 3669 |
. . . 4
| |
| 3 | 1, 2 | mtbiri 785 |
. . 3
|
| 4 | 3 | necon2ai 2051 |
. 2
|
| 5 | limord 3723 |
. . 3
| |
| 6 | ord0eln0 3717 |
. . 3
| |
| 7 | 5, 6 | syl 12 |
. 2
|
| 8 | 4, 7 | mpbird 213 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: limuni3 3936 peano1 3971 oe1m 5226 oalimcl 5242 oaass 5243 oarec 5244 omlimcl 5257 odi 5258 oen0 5261 oewordri 5267 oelim2 5270 oeoalem 5271 oeoelem 5273 limensuci 5600 rankxplim2 5824 rankxplim3 5825 omsublim 5887 omsublimOLD 15396 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-9 1307 ax-10 1308 ax-11 1309 ax-12 1310 ax-14 1312 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-16 1580 ax-11o 1588 ax-ext 1865 ax-sep 3438 ax-nul 3445 ax-pow 3481 ax-pr 3524 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-3or 859 df-3an 860 df-ex 1327 df-sb 1536 df-eu 1775 df-mo 1776 df-clab 1872 df-cleq 1877 df-clel 1880 df-ne 2019 df-ral 2109 df-rex 2110 df-v 2294 df-dif 2597 df-un 2600 df-in 2603 df-ss 2605 df-pss 2607 df-nul 2876 df-pw 3035 df-sn 3049 df-pr 3050 df-op 3053 df-uni 3178 df-br 3339 df-opab 3396 df-tr 3412 df-eprel 3583 df-po 3591 df-so 3604 df-fr 3625 df-we 3644 df-ord 3660 df-lim 3662 |