Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rabsnif | Structured version Visualization version Unicode version |
Description: A restricted class abstraction restricted to a singleton is either the empty set or the singleton itself. (Contributed by AV, 12-Apr-2019.) (Proof shortened by AV, 21-Jul-2019.) |
Ref | Expression |
---|---|
rabsnif.f |
Ref | Expression |
---|---|
rabsnif |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabsnifsb 4257 | . . 3 | |
2 | rabsnif.f | . . . . 5 | |
3 | 2 | sbcieg 3468 | . . . 4 |
4 | 3 | ifbid 4108 | . . 3 |
5 | 1, 4 | syl5eq 2668 | . 2 |
6 | rab0 3955 | . . . 4 | |
7 | ifid 4125 | . . . 4 | |
8 | 6, 7 | eqtr4i 2647 | . . 3 |
9 | snprc 4253 | . . . . 5 | |
10 | 9 | biimpi 206 | . . . 4 |
11 | 10 | rabeqdv 3194 | . . 3 |
12 | 10 | ifeq1d 4104 | . . 3 |
13 | 8, 11, 12 | 3eqtr4a 2682 | . 2 |
14 | 5, 13 | pm2.61i 176 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wb 196 wceq 1483 wcel 1990 crab 2916 cvv 3200 wsbc 3435 c0 3915 cif 4086 csn 4177 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-nul 3916 df-if 4087 df-sn 4178 |
This theorem is referenced by: suppsnop 7309 m1detdiag 20403 1loopgrvd2 26399 1hevtxdg1 26402 1egrvtxdg1 26405 |
Copyright terms: Public domain | W3C validator |