| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Any restricted class abstraction restricted to the empty set is empty. |
| Ref | Expression |
|---|---|
| rab0 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | noel 1711 |
. . . 4
| |
| 2 | 1 | intnanr 517 |
. . 3
|
| 3 | 2 | nex 779 |
. 2
|
| 4 | rabn0 1716 |
. . . 4
| |
| 5 | df-rex 1206 |
. . . 4
| |
| 6 | 4, 5 | bitr 151 |
. . 3
|
| 7 | 6 | bicon1i 193 |
. 2
|
| 8 | 3, 7 | mpbi 164 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: scott0 3542 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-rex 1206 df-rab 1208 df-v 1349 df-dif 1489 df-nul 1708 |