Theorem nfraldxy 2356

Description: Not-free for restricted universal quantification where x and y are distinct. See nfraldya 2358 for a version with y and A distinct instead. (Contributed by Jim Kingdon, 29-May-2018.)

Hypotheses

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

Assertion

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

Distinct variable group:   x, y

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

Proof of Theorem nfraldxy

Step	Hyp	Ref	Expression
1		df-ral 2311	. 2 |- ( A. y e. A ps <-> A. y ( y e. A -> ps ) )
2		nfraldxy.2	. . 3 |- F/ y ph
3		nfcv 2178	. . . . . 6 |- F/_ x y
4	3	a1i 9	. . . . 5 |- ( ph -> F/_ x y )
5		nfraldxy.3	. . . . 5 |- ( ph -> F/_ x A )
6	4, 5	nfeld 2193	. . . 4 |- ( ph -> F/ x y e. A )
7		nfraldxy.4	. . . 4 |- ( ph -> F/ x ps )
8	6, 7	nfimd 1477	. . 3 |- ( ph -> F/ x ( y e. A -> ps ) )
9	2, 8	nfald 1643	. 2 |- ( ph -> F/ x A. y ( y e. A -> ps ) )
10	1, 9	nfxfrd 1364	1 |- ( ph -> F/ x A. y e. A ps )

Syntax hints:   -> wi 4   A.wal 1241   F/wnf 1349   e. wcel 1393   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-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-17 1419  ax-ial 1427  ax-i5r 1428  ax-ext 2022

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

This theorem is referenced by:  nfraldya  2358  nfralxy  2360