Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > onn0 | Unicode version |
Description: The class of all ordinal numbers is not empty. (Contributed by NM, 17-Sep-1995.) |
Ref | Expression |
---|---|
onn0 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0elon 4375 | . 2 | |
2 | ne0i 3420 | . 2 | |
3 | 1, 2 | ax-mp 5 | 1 |
Colors of variables: wff set class |
Syntax hints: wcel 2141 wne 2340 c0 3414 con0 4346 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 ax-nul 4113 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-ral 2453 df-rex 2454 df-v 2732 df-dif 3123 df-in 3127 df-ss 3134 df-nul 3415 df-pw 3566 df-uni 3795 df-tr 4086 df-iord 4349 df-on 4351 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |