Theorem cbvralf 2571

Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 7-Mar-2004.) (Revised by Mario Carneiro, 9-Oct-2016.)

Hypotheses

Ref	Expression
cbvralf.1	|- F/_ x A
cbvralf.2	|- F/_ y A
cbvralf.3	|- F/ y ph
cbvralf.4	|- F/ x ps
cbvralf.5	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
cbvralf	|- ( A. x e. A ph <-> A. y e. A ps )

Proof of Theorem cbvralf

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1461	. . . 4 |- F/ z ( x e. A -> ph )
2		cbvralf.1	. . . . . 6 |- F/_ x A
3	2	nfcri 2213	. . . . 5 |- F/ x z e. A
4		nfs1v 1856	. . . . 5 |- F/ x [ z / x ] ph
5	3, 4	nfim 1504	. . . 4 |- F/ x ( z e. A -> [ z / x ] ph )
6		eleq1 2141	. . . . 5 |- ( x = z -> ( x e. A <-> z e. A ) )
7		sbequ12 1694	. . . . 5 |- ( x = z -> ( ph <-> [ z / x ] ph ) )
8	6, 7	imbi12d 232	. . . 4 |- ( x = z -> ( ( x e. A -> ph ) <-> ( z e. A -> [ z / x ] ph ) ) )
9	1, 5, 8	cbval 1677	. . 3 |- ( A. x ( x e. A -> ph ) <-> A. z ( z e. A -> [ z / x ] ph ) )
10		cbvralf.2	. . . . . 6 |- F/_ y A
11	10	nfcri 2213	. . . . 5 |- F/ y z e. A
12		cbvralf.3	. . . . . 6 |- F/ y ph
13	12	nfsb 1863	. . . . 5 |- F/ y [ z / x ] ph
14	11, 13	nfim 1504	. . . 4 |- F/ y ( z e. A -> [ z / x ] ph )
15		nfv 1461	. . . 4 |- F/ z ( y e. A -> ps )
16		eleq1 2141	. . . . 5 |- ( z = y -> ( z e. A <-> y e. A ) )
17		sbequ 1761	. . . . . 6 |- ( z = y -> ( [ z / x ] ph <-> [ y / x ] ph ) )
18		cbvralf.4	. . . . . . 7 |- F/ x ps
19		cbvralf.5	. . . . . . 7 |- ( x = y -> ( ph <-> ps ) )
20	18, 19	sbie 1714	. . . . . 6 |- ( [ y / x ] ph <-> ps )
21	17, 20	syl6bb 194	. . . . 5 |- ( z = y -> ( [ z / x ] ph <-> ps ) )
22	16, 21	imbi12d 232	. . . 4 |- ( z = y -> ( ( z e. A -> [ z / x ] ph ) <-> ( y e. A -> ps ) ) )
23	14, 15, 22	cbval 1677	. . 3 |- ( A. z ( z e. A -> [ z / x ] ph ) <-> A. y ( y e. A -> ps ) )
24	9, 23	bitri 182	. 2 |- ( A. x ( x e. A -> ph ) <-> A. y ( y e. A -> ps ) )
25		df-ral 2353	. 2 |- ( A. x e. A ph <-> A. x ( x e. A -> ph ) )
26		df-ral 2353	. 2 |- ( A. y e. A ps <-> A. y ( y e. A -> ps ) )
27	24, 25, 26	3bitr4i 210	1 |- ( A. x e. A ph <-> A. y e. A ps )

Syntax hints:   -> wi 4   <-> wb 103   A.wal 1282   F/wnf 1389   e. wcel 1433   [wsb 1685   F/_wnfc 2206   A.wral 2348

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-nf 1390  df-sb 1686  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353

This theorem is referenced by:  cbvral  2573  ffnfvf  5345