Theorem 2rexbiia 1969

Description: Inference adding 2 restricted existential quantifiers to both sides of an equivalence.

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

Proof of Theorem 2rexbiia

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

Syntax hints:   -> wi 3   <-> wb 162   /\ wa 239   e. wcel 1138  E.wrex 1940

This theorem is referenced by:  sqr2irr 7774  mdsymlem8 11774  pi1f 15775  pi1val 15776

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 1143  ax-17 1155  ax-4 1157  ax-5o 1159

This theorem depends on definitions:  df-bi 163  df-an 241  df-ex 1165  df-rex 1944

Copyright terms: Public domain