Theorem cbvrald 14510

Description: Rule used to change bound variables, using implicit substitution. (Contributed by BJ, 22-Nov-2019.)

Hypotheses

Ref	Expression
cbvrald.nf0	|- F/ x ph
cbvrald.nf1	|- F/ y ph
cbvrald.nf2	|- ( ph -> F/ y ps )
cbvrald.nf3	|- ( ph -> F/ x ch )
cbvrald.is	|- ( ph -> ( x = y -> ( ps <-> ch ) ) )

Assertion

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

Distinct variable groups:   x, A   y, A

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

Proof of Theorem cbvrald

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbvrald.nf0	. . . 4 |- F/ x ph
2		nfv 1528	. . . 4 |- F/ z ph
3		nfv 1528	. . . . . 6 |- F/ z x e. A
4	3	a1i 9	. . . . 5 |- ( ph -> F/ z x e. A )
5		nfv 1528	. . . . . 6 |- F/ z ps
6	5	a1i 9	. . . . 5 |- ( ph -> F/ z ps )
7	4, 6	nfimd 1585	. . . 4 |- ( ph -> F/ z ( x e. A -> ps ) )
8		nfv 1528	. . . . . 6 |- F/ x z e. A
9	8	a1i 9	. . . . 5 |- ( ph -> F/ x z e. A )
10		nfs1v 1939	. . . . . 6 |- F/ x [ z / x ] ps
11	10	a1i 9	. . . . 5 |- ( ph -> F/ x [ z / x ] ps )
12	9, 11	nfimd 1585	. . . 4 |- ( ph -> F/ x ( z e. A -> [ z / x ] ps ) )
13		eleq1 2240	. . . . . . 7 |- ( x = z -> ( x e. A <-> z e. A ) )
14	13	adantl 277	. . . . . 6 |- ( ( ph /\ x = z ) -> ( x e. A <-> z e. A ) )
15		sbequ12 1771	. . . . . . 7 |- ( x = z -> ( ps <-> [ z / x ] ps ) )
16	15	adantl 277	. . . . . 6 |- ( ( ph /\ x = z ) -> ( ps <-> [ z / x ] ps ) )
17	14, 16	imbi12d 234	. . . . 5 |- ( ( ph /\ x = z ) -> ( ( x e. A -> ps ) <-> ( z e. A -> [ z / x ] ps ) ) )
18	17	ex 115	. . . 4 |- ( ph -> ( x = z -> ( ( x e. A -> ps ) <-> ( z e. A -> [ z / x ] ps ) ) ) )
19	1, 2, 7, 12, 18	cbv2 1749	. . 3 |- ( ph -> ( A. x ( x e. A -> ps ) <-> A. z ( z e. A -> [ z / x ] ps ) ) )
20		cbvrald.nf1	. . . 4 |- F/ y ph
21		nfv 1528	. . . . . 6 |- F/ y z e. A
22	21	a1i 9	. . . . 5 |- ( ph -> F/ y z e. A )
23		cbvrald.nf2	. . . . . 6 |- ( ph -> F/ y ps )
24	1, 23	nfsbd 1977	. . . . 5 |- ( ph -> F/ y [ z / x ] ps )
25	22, 24	nfimd 1585	. . . 4 |- ( ph -> F/ y ( z e. A -> [ z / x ] ps ) )
26		nfv 1528	. . . . . 6 |- F/ z y e. A
27	26	a1i 9	. . . . 5 |- ( ph -> F/ z y e. A )
28		nfv 1528	. . . . . 6 |- F/ z ch
29	28	a1i 9	. . . . 5 |- ( ph -> F/ z ch )
30	27, 29	nfimd 1585	. . . 4 |- ( ph -> F/ z ( y e. A -> ch ) )
31		eleq1 2240	. . . . . . 7 |- ( z = y -> ( z e. A <-> y e. A ) )
32	31	adantl 277	. . . . . 6 |- ( ( ph /\ z = y ) -> ( z e. A <-> y e. A ) )
33		sbequ 1840	. . . . . . 7 |- ( z = y -> ( [ z / x ] ps <-> [ y / x ] ps ) )
34		cbvrald.nf3	. . . . . . . 8 |- ( ph -> F/ x ch )
35		cbvrald.is	. . . . . . . 8 |- ( ph -> ( x = y -> ( ps <-> ch ) ) )
36	1, 34, 35	sbied 1788	. . . . . . 7 |- ( ph -> ( [ y / x ] ps <-> ch ) )
37	33, 36	sylan9bbr 463	. . . . . 6 |- ( ( ph /\ z = y ) -> ( [ z / x ] ps <-> ch ) )
38	32, 37	imbi12d 234	. . . . 5 |- ( ( ph /\ z = y ) -> ( ( z e. A -> [ z / x ] ps ) <-> ( y e. A -> ch ) ) )
39	38	ex 115	. . . 4 |- ( ph -> ( z = y -> ( ( z e. A -> [ z / x ] ps ) <-> ( y e. A -> ch ) ) ) )
40	2, 20, 25, 30, 39	cbv2 1749	. . 3 |- ( ph -> ( A. z ( z e. A -> [ z / x ] ps ) <-> A. y ( y e. A -> ch ) ) )
41	19, 40	bitrd 188	. 2 |- ( ph -> ( A. x ( x e. A -> ps ) <-> A. y ( y e. A -> ch ) ) )
42		df-ral 2460	. 2 |- ( A. x e. A ps <-> A. x ( x e. A -> ps ) )
43		df-ral 2460	. 2 |- ( A. y e. A ch <-> A. y ( y e. A -> ch ) )
44	41, 42, 43	3bitr4g 223	1 |- ( ph -> ( A. x e. A ps <-> A. y e. A ch ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   A.wal 1351   F/wnf 1460   [wsb 1762   e. wcel 2148   A.wral 2455

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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-cleq 2170  df-clel 2173  df-ral 2460

This theorem is referenced by:  setindft  14687