Theorem rabsnif 3736

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.)

Hypothesis

Ref	Expression
rabsnif.f	|- ( x = A -> ( ph <-> ps ) )

Assertion

Ref	Expression
rabsnif	|- { x e. { A } | ph } = if ( ps , { A } , (/) )

Distinct variable groups:   x, A   ps, x

Allowed substitution hint:   ph( x)

Proof of Theorem rabsnif

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elrabi 2957	. . . . . 6 |- ( y e. { x e. { A } | ph } -> y e. { A } )
2		elsni 3685	. . . . . 6 |- ( y e. { A } -> y = A )
3	1, 2	syl 14	. . . . 5 |- ( y e. { x e. { A } | ph } -> y = A )
4	3	19.8ad 1637	. . . 4 |- ( y e. { x e. { A } | ph } -> E. y y = A )
5		isset 2807	. . . 4 |- ( A e. _V <-> E. y y = A )
6	4, 5	sylibr 134	. . 3 |- ( y e. { x e. { A } | ph } -> A e. _V )
7		noel 3496	. . . . . . . . 9 |- -. y e. (/)
8	7	intnan 934	. . . . . . . 8 |- -. ( -. ps /\ y e. (/) )
9	8	a1i 9	. . . . . . 7 |- ( y e. if ( ps , { A } , (/) ) -> -. ( -. ps /\ y e. (/) ) )
10		elif 3615	. . . . . . . 8 |- ( y e. if ( ps , { A } , (/) ) <-> ( ( ps /\ y e. { A } ) \/ ( -. ps /\ y e. (/) ) ) )
11	10	biimpi 120	. . . . . . 7 |- ( y e. if ( ps , { A } , (/) ) -> ( ( ps /\ y e. { A } ) \/ ( -. ps /\ y e. (/) ) ) )
12	9, 11	ecased 1383	. . . . . 6 |- ( y e. if ( ps , { A } , (/) ) -> ( ps /\ y e. { A } ) )
13	12, 2	simpl2im 386	. . . . 5 |- ( y e. if ( ps , { A } , (/) ) -> y = A )
14	13	19.8ad 1637	. . . 4 |- ( y e. if ( ps , { A } , (/) ) -> E. y y = A )
15	14, 5	sylibr 134	. . 3 |- ( y e. if ( ps , { A } , (/) ) -> A e. _V )
16		rabsnifsb 3735	. . . . 5 |- { x e. { A } | ph } = if ( [. A / x ]. ph , { A } , (/) )
17		rabsnif.f	. . . . . . 7 |- ( x = A -> ( ph <-> ps ) )
18	17	sbcieg 3062	. . . . . 6 |- ( A e. _V -> ( [. A / x ]. ph <-> ps ) )
19	18	ifbid 3625	. . . . 5 |- ( A e. _V -> if ( [. A / x ]. ph , { A } , (/) ) = if ( ps , { A } , (/) ) )
20	16, 19	eqtrid 2274	. . . 4 |- ( A e. _V -> { x e. { A } | ph } = if ( ps , { A } , (/) ) )
21	20	eleq2d 2299	. . 3 |- ( A e. _V -> ( y e. { x e. { A } | ph } <-> y e. if ( ps , { A } , (/) ) ) )
22	6, 15, 21	pm5.21nii 709	. 2 |- ( y e. { x e. { A } | ph } <-> y e. if ( ps , { A } , (/) ) )
23	22	eqriv 2226	1 |- { x e. { A } | ph } = if ( ps , { A } , (/) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 713   = wceq 1395   E.wex 1538   e. wcel 2200   {crab 2512   _Vcvv 2800   [.wsbc 3029   (/)c0 3492   ifcif 3603   {csn 3667

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-nul 3493  df-if 3604  df-sn 3673

This theorem is referenced by:  1loopgrvd2fi  16111