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

Theorem rexcom13 3101
Description: Swap first and third restricted existential quantifiers. (Contributed by NM, 8-Apr-2015.)
Assertion
Ref Expression
rexcom13  |-  ( E. x  e.  A  E. y  e.  B  E. z  e.  C  ph  <->  E. z  e.  C  E. y  e.  B  E. x  e.  A  ph )
Distinct variable groups:    y, z, A    x, z, B    x, y, C
Allowed substitution hints:    ph( x, y, z)    A( x)    B( y)    C( z)

Proof of Theorem rexcom13
StepHypRef Expression
1 rexcom 3099 . 2  |-  ( E. x  e.  A  E. y  e.  B  E. z  e.  C  ph  <->  E. y  e.  B  E. x  e.  A  E. z  e.  C  ph )
2 rexcom 3099 . . 3  |-  ( E. x  e.  A  E. z  e.  C  ph  <->  E. z  e.  C  E. x  e.  A  ph )
32rexbii 3041 . 2  |-  ( E. y  e.  B  E. x  e.  A  E. z  e.  C  ph  <->  E. y  e.  B  E. z  e.  C  E. x  e.  A  ph )
4 rexcom 3099 . 2  |-  ( E. y  e.  B  E. z  e.  C  E. x  e.  A  ph  <->  E. z  e.  C  E. y  e.  B  E. x  e.  A  ph )
51, 3, 43bitri 286 1  |-  ( E. x  e.  A  E. y  e.  B  E. z  e.  C  ph  <->  E. z  e.  C  E. y  e.  B  E. x  e.  A  ph )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196   E.wrex 2913
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918
This theorem is referenced by:  rexrot4  3103
  Copyright terms: Public domain W3C validator