Theorem rexbid 2367

Description: Formula-building rule for restricted existential quantifier (deduction rule). (Contributed by NM, 27-Jun-1998.)

Hypotheses

Ref	Expression
ralbid.1	|- F/ x ph
ralbid.2	|- ( ph -> ( ps <-> ch ) )

Assertion

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

Proof of Theorem rexbid

Step	Hyp	Ref	Expression
1		ralbid.1	. 2 |- F/ x ph
2		ralbid.2	. . 3 |- ( ph -> ( ps <-> ch ) )
3	2	adantr 270	. 2 |- ( ( ph /\ x e. A ) -> ( ps <-> ch ) )
4	1, 3	rexbida 2363	1 |- ( ph -> ( E. x e. A ps <-> E. x e. A ch ) )

Syntax hints:   -> wi 4   <-> wb 103   F/wnf 1389   e. wcel 1433   E.wrex 2349

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-4 1440  ax-ial 1467

This theorem depends on definitions:  df-bi 115  df-nf 1390  df-rex 2354

This theorem is referenced by:  rexbidv  2369  sbcrext  2891  caucvgsrlemgt1  6971  bezout  10400  sscoll2  10783