Theorem cbvreucsf 3201

Description: A more general version of cbvreuv 2838 that has no distinct variable restrictions. 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
cbvreucsf	|- (E!x e. A ph <-> E!y e. B ps)

Proof of Theorem cbvreucsf

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		nfs1v 2106	. . . . 5 |- F/x[z / x]ph
5	3, 4	nfan 1824	. . . 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		sbequ12 1919	. . . . 5 |- (x = z -> (ph <-> [z / x]ph))
10	8, 9	anbi12d 691	. . . 4 |- (x = z -> ((x e. A /\ ph) <-> (z e. [_z / x]_A /\ [z / x]ph)))
11	1, 5, 10	cbveu 2224	. . 3 |- (E!x(x e. A /\ ph) <-> E!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	16	nfsb 2109	. . . . 5 |- F/y[z / x]ph
18	15, 17	nfan 1824	. . . 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		sbsbc 3051	. . . . . . . . 9 |- ([y / x]v e. A <-> [.y / x ].v e. A)
23	22	abbii 2466	. . . . . . . 8 |- {v | [y / x]v e. A} = {v | [.y / x ].v e. A}
24		cbvralcsf.2	. . . . . . . . . . . 12 |- F/_xB
25	24	nfcri 2484	. . . . . . . . . . 11 |- F/x v e. B
26		cbvralcsf.5	. . . . . . . . . . . 12 |- (x = y -> A = B)
27	26	eleq2d 2420	. . . . . . . . . . 11 |- (x = y -> (v e. A <-> v e. B))
28	25, 27	sbie 2038	. . . . . . . . . 10 |- ([y / x]v e. A <-> v e. B)
29	28	bicomi 193	. . . . . . . . 9 |- (v e. B <-> [y / x]v e. A)
30	29	abbi2i 2465	. . . . . . . 8 |- B = {v | [y / x]v e. A}
31		df-csb 3138	. . . . . . . 8 |- [_y / x]_A = {v | [.y / x ].v e. A}
32	23, 30, 31	3eqtr4ri 2384	. . . . . . 7 |- [_y / x]_A = B
33	21, 32	syl6eq 2401	. . . . . 6 |- (z = y -> [_z / x]_A = B)
34	20, 33	eleq12d 2421	. . . . 5 |- (z = y -> (z e. [_z / x]_A <-> y e. B))
35		sbequ 2060	. . . . . 6 |- (z = y -> ([z / x]ph <-> [y / x]ph))
36		cbvralcsf.4	. . . . . . 7 |- F/xps
37		cbvralcsf.6	. . . . . . 7 |- (x = y -> (ph <-> ps))
38	36, 37	sbie 2038	. . . . . 6 |- ([y / x]ph <-> ps)
39	35, 38	syl6bb 252	. . . . 5 |- (z = y -> ([z / x]ph <-> ps))
40	34, 39	anbi12d 691	. . . 4 |- (z = y -> ((z e. [_z / x]_A /\ [z / x]ph) <-> (y e. B /\ ps)))
41	18, 19, 40	cbveu 2224	. . 3 |- (E!z(z e. [_z / x]_A /\ [z / x]ph) <-> E!y(y e. B /\ ps))
42	11, 41	bitri 240	. 2 |- (E!x(x e. A /\ ph) <-> E!y(y e. B /\ ps))
43		df-reu 2622	. 2 |- (E!x e. A ph <-> E!x(x e. A /\ ph))
44		df-reu 2622	. 2 |- (E!y e. B ps <-> E!y(y e. B /\ ps))
45	42, 43, 44	3bitr4i 268	1 |- (E!x e. A ph <-> E!y e. B ps)

Syntax hints:   -> wi 4   <-> wb 176   /\ wa 358   F/wnf 1544   = wceq 1642  [wsb 1648   e. wcel 1710  E!weu 2204  {cab 2339   F/_wnfc 2477  E!wreu 2617   [.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-eu 2208  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-reu 2622  df-sbc 3048  df-csb 3138

This theorem is referenced by: (None)