| 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 2384 |
. . 3
| |
| 2 | nfcv 2384 |
. . 3
| |
| 3 | 1, 2 | cleqf 2409 |
. 2
|
| 4 | noel 3512 |
. . . 4
| |
| 5 | 4 | nbn 707 |
. . 3
|
| 6 | 5 | albii 1519 |
. 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-v 2815 df-dif 3213 df-nul 3509 |
| This theorem is referenced by: notm0 3529 nel0 3530 0el 3531 rabeq0 3538 abeq0 3539 ssdif0im 3573 inssdif0im 3576 ralf0 3612 snprc 3754 uni0b 3939 disjiun 4104 0ex 4237 dm0 4970 reldm0 4974 dmsn0 5230 dmsn0el 5232 fzo0 10504 fzouzdisj 10516 |
| Copyright terms: Public domain | W3C validator |