Theorem nfraldya 2358

Description: Not-free for restricted universal quantification where y and A are distinct. See nfraldxy 2356 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
nfraldya	|- ( ph -> F/ x A. y e. A ps )

Distinct variable group:   y, A

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

Proof of Theorem nfraldya

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ral 2311	. 2 |- ( A. y e. A ps <-> A. y ( y e. A -> ps ) )
2		sbim 1827	. . . . . 6 |- ( [ z / y ] ( y e. A -> ps ) <-> ( [ z / y ] y e. A -> [ z / y ] ps ) )
3		clelsb3 2142	. . . . . . 7 |- ( [ z / y ] y e. A <-> z e. A )
4	3	imbi1i 227	. . . . . 6 |- ( ( [ z / y ] y e. A -> [ z / y ] ps ) <-> ( z e. A -> [ z / y ] ps ) )
5	2, 4	bitri 173	. . . . 5 |- ( [ z / y ] ( y e. A -> ps ) <-> ( z e. A -> [ z / y ] ps ) )
6	5	albii 1359	. . . 4 |- ( A. z [ z / y ] ( y e. A -> ps ) <-> A. z ( z e. A -> [ z / y ] ps ) )
7		nfv 1421	. . . . 5 |- F/ z ( y e. A -> ps )
8	7	sb8 1736	. . . 4 |- ( A. y ( y e. A -> ps ) <-> A. z [ z / y ] ( y e. A -> ps ) )
9		df-ral 2311	. . . 4 |- ( A. z e. A [ z / y ] ps <-> A. z ( z e. A -> [ z / y ] ps ) )
10	6, 8, 9	3bitr4i 201	. . 3 |- ( A. y ( y e. A -> ps ) <-> A. z e. A [ z / y ] ps )
11		nfv 1421	. . . 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 1851	. . . 4 |- ( ph -> F/ x [ z / y ] ps )
16	11, 12, 15	nfraldxy 2356	. . 3 |- ( ph -> F/ x A. z e. A [ z / y ] ps )
17	10, 16	nfxfrd 1364	. 2 |- ( ph -> F/ x A. y ( y e. A -> ps ) )
18	1, 17	nfxfrd 1364	1 |- ( ph -> F/ x A. y e. A ps )

Syntax hints:   -> wi 4   A.wal 1241   F/wnf 1349   e. wcel 1393   [wsb 1645   F/_wnfc 2165   A.wral 2306

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-nf 1350  df-sb 1646  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311

This theorem is referenced by:  nfralya  2362