Theorem 2rexbii 2333

Description: Inference adding two restricted existential quantifiers to both sides of an equivalence. (Contributed by NM, 11-Nov-1995.)

Hypothesis

Ref	Expression
ralbii.1	|- ( ph <-> ps )

Assertion

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

Proof of Theorem 2rexbii

Step	Hyp	Ref	Expression
1		ralbii.1	. . 3 |- ( ph <-> ps )
2	1	rexbii 2331	. 2 |- ( E. y e. B ph <-> E. y e. B ps )
3	2	rexbii 2331	1 |- ( E. x e. A E. y e. B ph <-> E. x e. A E. y e. B ps )

Syntax hints:   <-> wb 98   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-tru 1246  df-nf 1350  df-rex 2312

This theorem is referenced by:  3reeanv  2480  4fvwrd4  8997