| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eq0 | Unicode version | ||
| Description: The empty set has no elements. Theorem 2 of [Suppes] p. 22. (Contributed by NM, 29-Aug-1993.) |
| Ref | Expression |
|---|---|
| eq0 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2339 |
. . 3
| |
| 2 | nfcv 2339 |
. . 3
| |
| 3 | 1, 2 | cleqf 2364 |
. 2
|
| 4 | noel 3455 |
. . . 4
| |
| 5 | 4 | nbn 700 |
. . 3
|
| 6 | 5 | albii 1484 |
. 2
|
| 7 | 3, 6 | bitr4i 187 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-v 2765 df-dif 3159 df-nul 3452 |
| This theorem is referenced by: notm0 3472 nel0 3473 0el 3474 rabeq0 3481 abeq0 3482 ssdif0im 3516 inssdif0im 3519 ralf0 3554 snprc 3688 uni0b 3865 disjiun 4029 0ex 4161 dm0 4881 reldm0 4885 dmsn0 5138 dmsn0el 5140 fzo0 10261 fzouzdisj 10273 |
| Copyright terms: Public domain | W3C validator |