ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  2rexbiia Unicode version

Theorem 2rexbiia 2449
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
StepHypRef Expression
1 2rexbiia.1 . . 3  |-  ( ( x  e.  A  /\  y  e.  B )  ->  ( ph  <->  ps )
)
21rexbidva 2432 . 2  |-  ( x  e.  A  ->  ( E. y  e.  B  ph  <->  E. y  e.  B  ps ) )
32rexbiia 2448 1  |-  ( E. x  e.  A  E. y  e.  B  ph  <->  E. x  e.  A  E. y  e.  B  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    e. wcel 1480   E.wrex 2415
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-4 1487  ax-17 1506  ax-ial 1514
This theorem depends on definitions:  df-bi 116  df-nf 1437  df-rex 2420
This theorem is referenced by:  elq  9407  cnref1o  9433
  Copyright terms: Public domain W3C validator