| 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 2374 |
. . 3
| |
| 2 | nfcv 2374 |
. . 3
| |
| 3 | 1, 2 | cleqf 2399 |
. 2
|
| 4 | noel 3498 |
. . . 4
| |
| 5 | 4 | nbn 706 |
. . 3
|
| 6 | 5 | albii 1518 |
. 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-dif 3202 df-nul 3495 |
| This theorem is referenced by: notm0 3515 nel0 3516 0el 3517 rabeq0 3524 abeq0 3525 ssdif0im 3559 inssdif0im 3562 ralf0 3597 snprc 3734 uni0b 3918 disjiun 4083 0ex 4216 dm0 4945 reldm0 4949 dmsn0 5204 dmsn0el 5206 fzo0 10404 fzouzdisj 10416 |
| Copyright terms: Public domain | W3C validator |