MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rexcom4a Unicode version

Theorem rexcom4a 2919
Description: Specialized existential commutation lemma. (Contributed by Jeff Madsen, 1-Jun-2011.)
Assertion
Ref Expression
rexcom4a  |-  ( E. x E. y  e.  A  ( ph  /\  ps )  <->  E. y  e.  A  ( ph  /\  E. x ps ) )
Distinct variable groups:    x, A    x, y    ph, x
Allowed substitution hints:    ph( y)    ps( x, y)    A( y)

Proof of Theorem rexcom4a
StepHypRef Expression
1 rexcom4 2918 . 2  |-  ( E. y  e.  A  E. x ( ph  /\  ps )  <->  E. x E. y  e.  A  ( ph  /\ 
ps ) )
2 19.42v 1917 . . 3  |-  ( E. x ( ph  /\  ps )  <->  ( ph  /\  E. x ps ) )
32rexbii 2674 . 2  |-  ( E. y  e.  A  E. x ( ph  /\  ps )  <->  E. y  e.  A  ( ph  /\  E. x ps ) )
41, 3bitr3i 243 1  |-  ( E. x E. y  e.  A  ( ph  /\  ps )  <->  E. y  e.  A  ( ph  /\  E. x ps ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 177    /\ wa 359   E.wex 1547   E.wrex 2650
This theorem is referenced by:  rexcom4b  2920
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-rex 2655  df-v 2901
  Copyright terms: Public domain W3C validator