Theorem cbvralcsf 3199

Description: A more general version of cbvralf 2830 that doesn't require A and B to be distinct from x or y. Changes bound variables using implicit substitution. (Contributed by Andrew Salmon, 13-Jul-2011.)

Hypotheses

Ref	Expression
cbvralcsf.1	|- F/_yA
cbvralcsf.2	|- F/_xB
cbvralcsf.3	|- F/yph
cbvralcsf.4	|- F/xps
cbvralcsf.5	|- (x = y -> A = B)
cbvralcsf.6	|- (x = y -> (ph <-> ps))

Assertion

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

Proof of Theorem cbvralcsf

Dummy variables v z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1619	. . . 4 |- F/z(x e. A -> ph)
2		nfcsb1v 3169	. . . . . 6 |- F/_x[_z / x]_A
3	2	nfcri 2484	. . . . 5 |- F/x z e. [_z / x]_A
4		nfsbc1v 3066	. . . . 5 |- F/x [.z / x ].ph
5	3, 4	nfim 1813	. . . 4 |- F/x(z e. [_z / x]_A -> [.z / x ].ph)
6		id 19	. . . . . 6 |- (x = z -> x = z)
7		csbeq1a 3145	. . . . . 6 |- (x = z -> A = [_z / x]_A)
8	6, 7	eleq12d 2421	. . . . 5 |- (x = z -> (x e. A <-> z e. [_z / x]_A))
9		sbceq1a 3057	. . . . 5 |- (x = z -> (ph <-> [.z / x ].ph))
10	8, 9	imbi12d 311	. . . 4 |- (x = z -> ((x e. A -> ph) <-> (z e. [_z / x]_A -> [.z / x ].ph)))
11	1, 5, 10	cbval 1984	. . 3 |- (A.x(x e. A -> ph) <-> A.z(z e. [_z / x]_A -> [.z / x ].ph))
12		nfcv 2490	. . . . . . 7 |- F/_yz
13		cbvralcsf.1	. . . . . . 7 |- F/_yA
14	12, 13	nfcsb 3171	. . . . . 6 |- F/_y[_z / x]_A
15	14	nfcri 2484	. . . . 5 |- F/y z e. [_z / x]_A
16		cbvralcsf.3	. . . . . 6 |- F/yph
17	12, 16	nfsbc 3068	. . . . 5 |- F/y [.z / x ].ph
18	15, 17	nfim 1813	. . . 4 |- F/y(z e. [_z / x]_A -> [.z / x ].ph)
19		nfv 1619	. . . 4 |- F/z(y e. B -> ps)
20		id 19	. . . . . 6 |- (z = y -> z = y)
21		csbeq1 3140	. . . . . . 7 |- (z = y -> [_z / x]_A = [_y / x]_A)
22		df-csb 3138	. . . . . . . 8 |- [_y / x]_A = {v | [.y / x ].v e. A}
23		cbvralcsf.2	. . . . . . . . . . . 12 |- F/_xB
24	23	nfcri 2484	. . . . . . . . . . 11 |- F/x v e. B
25		cbvralcsf.5	. . . . . . . . . . . 12 |- (x = y -> A = B)
26	25	eleq2d 2420	. . . . . . . . . . 11 |- (x = y -> (v e. A <-> v e. B))
27	24, 26	sbie 2038	. . . . . . . . . 10 |- ([y / x]v e. A <-> v e. B)
28		sbsbc 3051	. . . . . . . . . 10 |- ([y / x]v e. A <-> [.y / x ].v e. A)
29	27, 28	bitr3i 242	. . . . . . . . 9 |- (v e. B <-> [.y / x ].v e. A)
30	29	abbi2i 2465	. . . . . . . 8 |- B = {v | [.y / x ].v e. A}
31	22, 30	eqtr4i 2376	. . . . . . 7 |- [_y / x]_A = B
32	21, 31	syl6eq 2401	. . . . . 6 |- (z = y -> [_z / x]_A = B)
33	20, 32	eleq12d 2421	. . . . 5 |- (z = y -> (z e. [_z / x]_A <-> y e. B))
34		dfsbcq 3049	. . . . . 6 |- (z = y -> ( [.z / x ].ph <-> [.y / x ].ph))
35		sbsbc 3051	. . . . . . 7 |- ([y / x]ph <-> [.y / x ].ph)
36		cbvralcsf.4	. . . . . . . 8 |- F/xps
37		cbvralcsf.6	. . . . . . . 8 |- (x = y -> (ph <-> ps))
38	36, 37	sbie 2038	. . . . . . 7 |- ([y / x]ph <-> ps)
39	35, 38	bitr3i 242	. . . . . 6 |- ( [.y / x ].ph <-> ps)
40	34, 39	syl6bb 252	. . . . 5 |- (z = y -> ( [.z / x ].ph <-> ps))
41	33, 40	imbi12d 311	. . . 4 |- (z = y -> ((z e. [_z / x]_A -> [.z / x ].ph) <-> (y e. B -> ps)))
42	18, 19, 41	cbval 1984	. . 3 |- (A.z(z e. [_z / x]_A -> [.z / x ].ph) <-> A.y(y e. B -> ps))
43	11, 42	bitri 240	. 2 |- (A.x(x e. A -> ph) <-> A.y(y e. B -> ps))
44		df-ral 2620	. 2 |- (A.x e. A ph <-> A.x(x e. A -> ph))
45		df-ral 2620	. 2 |- (A.y e. B ps <-> A.y(y e. B -> ps))
46	43, 44, 45	3bitr4i 268	1 |- (A.x e. A ph <-> A.y e. B ps)

Syntax hints:   -> wi 4   <-> wb 176  A.wal 1540   F/wnf 1544   = wceq 1642  [wsb 1648   e. wcel 1710  {cab 2339   F/_wnfc 2477  A.wral 2615   [.wsbc 3047  [_csb 3137

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ral 2620  df-sbc 3048  df-csb 3138

This theorem is referenced by:  cbvrexcsf  3200  cbvralv2  3203