Theorem reubidva 2611

Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 13-Nov-2004.)

Hypothesis

Ref	Expression
reubidva.1	|- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )

Assertion

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

Distinct variable group:   ph, x

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

Proof of Theorem reubidva

Step	Hyp	Ref	Expression
1		nfv 1508	. 2 |- F/ x ph
2		reubidva.1	. 2 |- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )
3	1, 2	reubida 2610	1 |- ( ph -> ( E! x e. A ps <-> E! x e. A ch ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   e. wcel 1480   E!wreu 2416

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-4 1487  ax-17 1506  ax-ial 1514

This theorem depends on definitions:  df-bi 116  df-nf 1437  df-eu 2000  df-reu 2421

This theorem is referenced by:  reubidv  2612  f1ofveu  5755  srpospr  7584  icoshftf1o  9767  divalgb  11611