Theorem 2rexbiia 2340

Description: Inference adding two restricted existential quantifiers to both sides of an equivalence. (Contributed by NM, 1-Aug-2004.)

Hypothesis

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

Assertion

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

Distinct variable groups:   x, y   y, A

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

Proof of Theorem 2rexbiia

Step	Hyp	Ref	Expression
1		2rexbiia.1	. . 3 |- ( ( x e. A /\ y e. B ) -> ( ph <-> ps ) )
2	1	rexbidva 2323	. 2 |- ( x e. A -> ( E. y e. B ph <-> E. y e. B ps ) )
3	2	rexbiia 2339	1 |- ( E. x e. A E. y e. B ph <-> E. x e. A E. y e. B ps )

Syntax hints:   -> wi 4   /\ wa 97   <-> wb 98   e. wcel 1393   E.wrex 2307

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-17 1419  ax-ial 1427

This theorem depends on definitions:  df-bi 110  df-nf 1350  df-rex 2312

This theorem is referenced by:  elq  8557  cnref1o  8582