Theorem cbvreu 2713

Description: Change the bound variable of a restricted unique existential quantifier using implicit substitution. (Contributed by Mario Carneiro, 15-Oct-2016.)

Hypotheses

Ref	Expression
cbvral.1	|- F/ y ph
cbvral.2	|- F/ x ps
cbvral.3	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
cbvreu	|- ( E! x e. A ph <-> E! y e. A ps )

Distinct variable groups:   x, A   y, A

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

Proof of Theorem cbvreu

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1538	. . . 4 |- F/ z ( x e. A /\ ph )
2	1	sb8eu 2049	. . 3 |- ( E! x ( x e. A /\ ph ) <-> E! z [ z / x ] ( x e. A /\ ph ) )
3		sban 1965	. . . 4 |- ( [ z / x ] ( x e. A /\ ph ) <-> ( [ z / x ] x e. A /\ [ z / x ] ph ) )
4	3	eubii 2045	. . 3 |- ( E! z [ z / x ] ( x e. A /\ ph ) <-> E! z ( [ z / x ] x e. A /\ [ z / x ] ph ) )
5		clelsb1 2292	. . . . . 6 |- ( [ z / x ] x e. A <-> z e. A )
6	5	anbi1i 458	. . . . 5 |- ( ( [ z / x ] x e. A /\ [ z / x ] ph ) <-> ( z e. A /\ [ z / x ] ph ) )
7	6	eubii 2045	. . . 4 |- ( E! z ( [ z / x ] x e. A /\ [ z / x ] ph ) <-> E! z ( z e. A /\ [ z / x ] ph ) )
8		nfv 1538	. . . . . 6 |- F/ y z e. A
9		cbvral.1	. . . . . . 7 |- F/ y ph
10	9	nfsb 1956	. . . . . 6 |- F/ y [ z / x ] ph
11	8, 10	nfan 1575	. . . . 5 |- F/ y ( z e. A /\ [ z / x ] ph )
12		nfv 1538	. . . . 5 |- F/ z ( y e. A /\ ps )
13		eleq1 2250	. . . . . 6 |- ( z = y -> ( z e. A <-> y e. A ) )
14		sbequ 1850	. . . . . . 7 |- ( z = y -> ( [ z / x ] ph <-> [ y / x ] ph ) )
15		cbvral.2	. . . . . . . 8 |- F/ x ps
16		cbvral.3	. . . . . . . 8 |- ( x = y -> ( ph <-> ps ) )
17	15, 16	sbie 1801	. . . . . . 7 |- ( [ y / x ] ph <-> ps )
18	14, 17	bitrdi 196	. . . . . 6 |- ( z = y -> ( [ z / x ] ph <-> ps ) )
19	13, 18	anbi12d 473	. . . . 5 |- ( z = y -> ( ( z e. A /\ [ z / x ] ph ) <-> ( y e. A /\ ps ) ) )
20	11, 12, 19	cbveu 2060	. . . 4 |- ( E! z ( z e. A /\ [ z / x ] ph ) <-> E! y ( y e. A /\ ps ) )
21	7, 20	bitri 184	. . 3 |- ( E! z ( [ z / x ] x e. A /\ [ z / x ] ph ) <-> E! y ( y e. A /\ ps ) )
22	2, 4, 21	3bitri 206	. 2 |- ( E! x ( x e. A /\ ph ) <-> E! y ( y e. A /\ ps ) )
23		df-reu 2472	. 2 |- ( E! x e. A ph <-> E! x ( x e. A /\ ph ) )
24		df-reu 2472	. 2 |- ( E! y e. A ps <-> E! y ( y e. A /\ ps ) )
25	22, 23, 24	3bitr4i 212	1 |- ( E! x e. A ph <-> E! y e. A ps )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   F/wnf 1470   [wsb 1772   E!weu 2036   e. wcel 2158   E!wreu 2467

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 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-ext 2169

This theorem depends on definitions:  df-bi 117  df-tru 1366  df-nf 1471  df-sb 1773  df-eu 2039  df-cleq 2180  df-clel 2183  df-reu 2472

This theorem is referenced by:  cbvrmo  2714  cbvreuv  2717