Theorem cbvreucsf 2904

Description: A more general version of cbvreuv 2529 that has no distinct variable rextrictions. 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 1418	. . . 4 |- F/z(x e. A /\ ph)
2		nfcsb1v 2876	. . . . . 6 |- F/_x [_z / x ]_A
3	2	nfcri 2169	. . . . 5 |- F/x z e. [_z / x ]_A
4		nfs1v 1812	. . . . 5 |- F/x[z / x]ph
5	3, 4	nfan 1454	. . . 4 |- F/x(z e. [_z / x ]_A /\ [z / x]ph)
6		id 19	. . . . . 6 |- (x = z -> x = z)
7		csbeq1a 2854	. . . . . 6 |- (x = z -> A = [_z / x ]_A)
8	6, 7	eleq12d 2105	. . . . 5 |- (x = z -> (x e. A <-> z e. [_z / x ]_A))
9		sbequ12 1651	. . . . 5 |- (x = z -> (ph <-> [z / x]ph))
10	8, 9	anbi12d 442	. . . 4 |- (x = z -> ((x e. A /\ ph) <-> (z e. [_z / x ]_A /\ [z / x]ph)))
11	1, 5, 10	cbveu 1921	. . 3 |- (E!x(x e. A /\ ph) <-> E!z(z e. [_z / x ]_A /\ [z / x]ph))
12		nfcv 2175	. . . . . . 7 |- F/_yz
13		cbvralcsf.1	. . . . . . 7 |- F/_yA
14	12, 13	nfcsb 2878	. . . . . 6 |- F/_y [_z / x ]_A
15	14	nfcri 2169	. . . . 5 |- F/y z e. [_z / x ]_A
16		cbvralcsf.3	. . . . . 6 |- F/yph
17	16	nfsb 1819	. . . . 5 |- F/y[z / x]ph
18	15, 17	nfan 1454	. . . 4 |- F/y(z e. [_z / x ]_A /\ [z / x]ph)
19		nfv 1418	. . . 4 |- F/z(y e. B /\ ps)
20		id 19	. . . . . 6 |- (z = y -> z = y)
21		csbeq1 2849	. . . . . . 7 |- (z = y -> [_z / x ]_A = [_y / x ]_A)
22		sbsbc 2762	. . . . . . . . 9 |- ([y / x]v e. A <-> [.y / x ].v e. A)
23	22	abbii 2150	. . . . . . . 8 |- {v | [y / x]v e. A } = {v | [.y / x ].v e. A }
24		cbvralcsf.2	. . . . . . . . . . . 12 |- F/_xB
25	24	nfcri 2169	. . . . . . . . . . 11 |- F/x v e. B
26		cbvralcsf.5	. . . . . . . . . . . 12 |- (x = y -> A = B)
27	26	eleq2d 2104	. . . . . . . . . . 11 |- (x = y -> (v e. A <-> v e. B))
28	25, 27	sbie 1671	. . . . . . . . . 10 |- ([y / x]v e. A <-> v e. B)
29	28	bicomi 123	. . . . . . . . 9 |- (v e. B <-> [y / x]v e. A)
30	29	abbi2i 2149	. . . . . . . 8 |- B = {v | [y / x]v e. A }
31		df-csb 2847	. . . . . . . 8 |- [_y / x ]_A = {v | [.y / x ].v e. A }
32	23, 30, 31	3eqtr4ri 2068	. . . . . . 7 |- [_y / x ]_A = B
33	21, 32	syl6eq 2085	. . . . . 6 |- (z = y -> [_z / x ]_A = B)
34	20, 33	eleq12d 2105	. . . . 5 |- (z = y -> (z e. [_z / x ]_A <-> y e. B))
35		sbequ 1718	. . . . . 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 1671	. . . . . 6 |- ([y / x]ph <-> ps)
39	35, 38	syl6bb 185	. . . . 5 |- (z = y -> ([z / x]ph <-> ps))
40	34, 39	anbi12d 442	. . . 4 |- (z = y -> ((z e. [_z / x ]_A /\ [z / x]ph) <-> (y e. B /\ ps)))
41	18, 19, 40	cbveu 1921	. . 3 |- (E!z(z e. [_z / x ]_A /\ [z / x]ph) <-> E!y(y e. B /\ ps))
42	11, 41	bitri 173	. 2 |- (E!x(x e. A /\ ph) <-> E!y(y e. B /\ ps))
43		df-reu 2307	. 2 |- (E!x e. A ph <-> E!x(x e. A /\ ph))
44		df-reu 2307	. 2 |- (E!y e. B ps <-> E!y(y e. B /\ ps))
45	42, 43, 44	3bitr4i 201	1 |- (E!x e. A ph <-> E!y e. B ps)

Syntax hints:   -> wi 4   /\ wa 97   <-> wb 98   = wceq 1242   F/wnf 1346   e. wcel 1390  [wsb 1642  E!weu 1897   {cab 2023   F/_wnfc 2162  E!wreu 2302   [.wsbc 2758   [_csb 2846

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-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019

This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-eu 1900  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-reu 2307  df-sbc 2759  df-csb 2847

This theorem is referenced by: (None)