Theorem 2rexbidva 2401

Description: Formula-building rule for restricted existential quantifiers (deduction form). (Contributed by NM, 15-Dec-2004.)

Hypothesis

Ref	Expression
2ralbidva.1	|- ( ( ph /\ ( x e. A /\ y e. B ) ) -> ( ps <-> ch ) )

Assertion

Ref	Expression
2rexbidva	|- ( ph -> ( E. x e. A E. y e. B ps <-> E. x e. A E. y e. B ch ) )

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

Allowed substitution hints:   ps( x, y)   ch( x, y)   A( x)   B( x, y)

Proof of Theorem 2rexbidva

Step	Hyp	Ref	Expression
1		2ralbidva.1	. . . 4 |- ( ( ph /\ ( x e. A /\ y e. B ) ) -> ( ps <-> ch ) )
2	1	anassrs 392	. . 3 |- ( ( ( ph /\ x e. A ) /\ y e. B ) -> ( ps <-> ch ) )
3	2	rexbidva 2377	. 2 |- ( ( ph /\ x e. A ) -> ( E. y e. B ps <-> E. y e. B ch ) )
4	3	rexbidva 2377	1 |- ( ph -> ( E. x e. A E. y e. B ps <-> E. x e. A E. y e. B ch ) )

Syntax hints:   -> wi 4   /\ wa 102   <-> wb 103   e. wcel 1438   E.wrex 2360

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 1381  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-4 1445  ax-17 1464  ax-ial 1472

This theorem depends on definitions:  df-bi 115  df-nf 1395  df-rex 2365

This theorem is referenced by: (None)