| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rabeq0 | Unicode version | ||
| Description: Condition for a restricted class abstraction to be empty. (Contributed by Jeff Madsen, 7-Jun-2010.) |
| Ref | Expression |
|---|---|
| rabeq0 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imnan 697 |
. . 3
| |
| 2 | 1 | albii 1519 |
. 2
|
| 3 | df-ral 2516 |
. 2
| |
| 4 | sbn 2005 |
. . . 4
| |
| 5 | 4 | albii 1519 |
. . 3
|
| 6 | nfv 1577 |
. . . 4
| |
| 7 | 6 | sb8 1904 |
. . 3
|
| 8 | eq0 3515 |
. . . 4
| |
| 9 | df-rab 2520 |
. . . . . . . 8
| |
| 10 | 9 | eleq2i 2298 |
. . . . . . 7
|
| 11 | df-clab 2218 |
. . . . . . 7
| |
| 12 | 10, 11 | bitri 184 |
. . . . . 6
|
| 13 | 12 | notbii 674 |
. . . . 5
|
| 14 | 13 | albii 1519 |
. . . 4
|
| 15 | 8, 14 | bitri 184 |
. . 3
|
| 16 | 5, 7, 15 | 3bitr4ri 213 |
. 2
|
| 17 | 2, 3, 16 | 3bitr4ri 213 |
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 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rab 2520 df-v 2805 df-dif 3203 df-nul 3497 |
| This theorem is referenced by: rabnc 3529 rabrsndc 3743 exmidsssnc 4299 ssfilem 7105 ssfilemd 7107 diffitest 7119 ssfirab 7172 ctssexmid 7409 exmidonfinlem 7464 iooidg 10205 icc0r 10222 fznlem 10338 ioo0 10582 ico0 10584 ioc0 10585 phiprmpw 12874 hashgcdeq 12892 unennn 13098 znnen 13099 fczpsrbag 14767 lgsquadlem2 15897 pw0ss 16024 umgrnloop0 16058 lfgrnloopen 16074 vtxd0nedgbfi 16240 clwwlkn0 16349 eupth2lembfi 16418 |
| Copyright terms: Public domain | W3C validator |