Theorem cbvexvw 1703

Description: Change bound variable. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 19-Apr-2017.)

Hypothesis

Ref	Expression
cbvalvw.1	|- (x = y -> (ph <-> ps))

Assertion

Ref	Expression
cbvexvw	|- (E.xph <-> E.yps)

Distinct variable groups:   x,y   ps,x   ph,y

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

Proof of Theorem cbvexvw

Step	Hyp	Ref	Expression
1		cbvalvw.1	. . . . 5 |- (x = y -> (ph <-> ps))
2	1	notbid 285	. . . 4 |- (x = y -> (-. ph <-> -. ps))
3	2	cbvalvw 1702	. . 3 |- (A.x -. ph <-> A.y -. ps)
4	3	notbii 287	. 2 |- (-. A.x -. ph <-> -. A.y -. ps)
5		df-ex 1542	. 2 |- (E.xph <-> -. A.x -. ph)
6		df-ex 1542	. 2 |- (E.yps <-> -. A.y -. ps)
7	4, 5, 6	3bitr4i 268	1 |- (E.xph <-> E.yps)

Syntax hints:  -. wn 3   -> wi 4   <-> wb 176  A.wal 1540  E.wex 1541

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

This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1542

This theorem is referenced by: (None)