Theorem nfrexdya 2502

Description: Not-free for restricted existential quantification where y and A are distinct. See nfrexdxy 2500 for a version with x and y distinct instead. (Contributed by Jim Kingdon, 30-May-2018.)

Hypotheses

Ref	Expression
nfraldya.2	|- F/ y ph
nfraldya.3	|- ( ph -> F/_ x A )
nfraldya.4	|- ( ph -> F/ x ps )

Assertion

Ref	Expression
nfrexdya	|- ( ph -> F/ x E. y e. A ps )

Distinct variable group:   y, A

Allowed substitution hints:   ph( x, y)   ps( x, y)   A( x)

Proof of Theorem nfrexdya

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rex 2450	. 2 |- ( E. y e. A ps <-> E. y ( y e. A /\ ps ) )
2		sban 1943	. . . . . 6 |- ( [ z / y ] ( y e. A /\ ps ) <-> ( [ z / y ] y e. A /\ [ z / y ] ps ) )
3		clelsb1 2271	. . . . . . 7 |- ( [ z / y ] y e. A <-> z e. A )
4	3	anbi1i 454	. . . . . 6 |- ( ( [ z / y ] y e. A /\ [ z / y ] ps ) <-> ( z e. A /\ [ z / y ] ps ) )
5	2, 4	bitri 183	. . . . 5 |- ( [ z / y ] ( y e. A /\ ps ) <-> ( z e. A /\ [ z / y ] ps ) )
6	5	exbii 1593	. . . 4 |- ( E. z [ z / y ] ( y e. A /\ ps ) <-> E. z ( z e. A /\ [ z / y ] ps ) )
7		nfv 1516	. . . . 5 |- F/ z ( y e. A /\ ps )
8	7	sb8e 1845	. . . 4 |- ( E. y ( y e. A /\ ps ) <-> E. z [ z / y ] ( y e. A /\ ps ) )
9		df-rex 2450	. . . 4 |- ( E. z e. A [ z / y ] ps <-> E. z ( z e. A /\ [ z / y ] ps ) )
10	6, 8, 9	3bitr4i 211	. . 3 |- ( E. y ( y e. A /\ ps ) <-> E. z e. A [ z / y ] ps )
11		nfv 1516	. . . 4 |- F/ z ph
12		nfraldya.3	. . . 4 |- ( ph -> F/_ x A )
13		nfraldya.2	. . . . 5 |- F/ y ph
14		nfraldya.4	. . . . 5 |- ( ph -> F/ x ps )
15	13, 14	nfsbd 1965	. . . 4 |- ( ph -> F/ x [ z / y ] ps )
16	11, 12, 15	nfrexdxy 2500	. . 3 |- ( ph -> F/ x E. z e. A [ z / y ] ps )
17	10, 16	nfxfrd 1463	. 2 |- ( ph -> F/ x E. y ( y e. A /\ ps ) )
18	1, 17	nfxfrd 1463	1 |- ( ph -> F/ x E. y e. A ps )

Syntax hints:   -> wi 4   /\ wa 103   F/wnf 1448   E.wex 1480   [wsb 1750   e. wcel 2136   F/_wnfc 2295   E.wrex 2445

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-nf 1449  df-sb 1751  df-cleq 2158  df-clel 2161  df-nfc 2297  df-rex 2450

This theorem is referenced by:  nfrexya  2507