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

Theorem eeor 1896
Description: Rearrange existential quantifiers. (Contributed by NM, 8-Aug-1994.)
Hypotheses
Ref Expression
eeor.1  |-  F/ y
ph
eeor.2  |-  F/ x ps
Assertion
Ref Expression
eeor  |-  ( E. x E. y (
ph  \/  ps )  <->  ( E. x ph  \/  E. y ps ) )

Proof of Theorem eeor
StepHypRef Expression
1 eeor.1 . . . 4  |-  F/ y
ph
2119.45 1888 . . 3  |-  ( E. y ( ph  \/  ps )  <->  ( ph  \/  E. y ps ) )
32exbii 1589 . 2  |-  ( E. x E. y (
ph  \/  ps )  <->  E. x ( ph  \/  E. y ps ) )
4 eeor.2 . . . 4  |-  F/ x ps
54nfex 1855 . . 3  |-  F/ x E. y ps
6519.44 1887 . 2  |-  ( E. x ( ph  \/  E. y ps )  <->  ( E. x ph  \/  E. y ps ) )
73, 6bitri 241 1  |-  ( E. x E. y (
ph  \/  ps )  <->  ( E. x ph  \/  E. y ps ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 177    \/ wo 358   E.wex 1547   F/wnf 1550
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
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-ex 1548  df-nf 1551
  Copyright terms: Public domain W3C validator