Theorem cbvexdva 1941

Description: Rule used to change the bound variable in an existential quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)

Hypothesis

Ref	Expression
cbvaldva.1	|- ( ( ph /\ x = y ) -> ( ps <-> ch ) )

Assertion

Ref	Expression
cbvexdva	|- ( ph -> ( E. x ps <-> E. y ch ) )

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

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

Proof of Theorem cbvexdva

Step	Hyp	Ref	Expression
1		nfv 1539	. 2 |- F/ y ph
2		nfvd 1540	. 2 |- ( ph -> F/ y ps )
3		cbvaldva.1	. . 3 |- ( ( ph /\ x = y ) -> ( ps <-> ch ) )
4	3	ex 115	. 2 |- ( ph -> ( x = y -> ( ps <-> ch ) ) )
5	1, 2, 4	cbvexd 1939	1 |- ( ph -> ( E. x ps <-> E. y ch ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   E.wex 1503

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-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545

This theorem depends on definitions:  df-bi 117  df-nf 1472

This theorem is referenced by:  cbvexdvaw  1943  cbvrexdva2  2734  acexmid  5917  tfrlemi1  6385  ltexpri  7673  recexpr  7698