Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rexcom4aOLD Unicode version

Theorem rexcom4aOLD 26447
Description: Specialized existential commutation lemma. (Moved to rexcom4a 2821 in main set.mm and may be deleted by mathbox owner, JM. --NM 16-Apr-2012.) (Contributed by Jeff Madsen, 1-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
rexcom4aOLD  |-  ( 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 rexcom4aOLD
StepHypRef Expression
1 rexcom4a 2821 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 176    /\ wa 358   E.wex 1531   E.wrex 2557
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-rex 2562  df-v 2803
  Copyright terms: Public domain W3C validator