| 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 2392 |
. . 3
| |
| 2 | nfcv 2392 |
. . 3
| |
| 3 | 1, 2 | cleqf 2417 |
. 2
|
| 4 | noel 3525 |
. . . 4
| |
| 5 | 4 | nbn 711 |
. . 3
|
| 6 | 5 | albii 1523 |
. 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-dif 3222 df-nul 3521 |
| This theorem is referenced by: notm0 3542 nel0 3543 0el 3544 rabeq0 3552 abeq0 3553 ssdif0im 3588 inssdif0im 3591 ralf0 3627 snprc 3770 uni0b 3955 disjiun 4120 0ex 4255 dm0 4990 reldm0 4994 dmsn0 5250 dmsn0el 5252 fzo0 10555 fzouzdisj 10567 |
| Copyright terms: Public domain | W3C validator |