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

Theorem rexun 3625
Description: Restricted existential quantification over union. (Contributed by Jeff Madsen, 5-Jan-2011.)
Assertion
Ref Expression
rexun  |-  ( E. x  e.  ( A  u.  B ) ph  <->  ( E. x  e.  A  ph  \/  E. x  e.  B  ph ) )

Proof of Theorem rexun
StepHypRef Expression
1 df-rex 2754 . 2  |-  ( E. x  e.  ( A  u.  B ) ph  <->  E. x ( x  e.  ( A  u.  B
)  /\  ph ) )
2 19.43 1755 . . 3  |-  ( E. x ( ( x  e.  A  /\  ph )  \/  ( x  e.  B  /\  ph )
)  <->  ( E. x
( x  e.  A  /\  ph )  \/  E. x ( x  e.  B  /\  ph )
) )
3 elun 3585 . . . . . 6  |-  ( x  e.  ( A  u.  B )  <->  ( x  e.  A  \/  x  e.  B ) )
43anbi1i 706 . . . . 5  |-  ( ( x  e.  ( A  u.  B )  /\  ph )  <->  ( ( x  e.  A  \/  x  e.  B )  /\  ph ) )
5 andir 884 . . . . 5  |-  ( ( ( x  e.  A  \/  x  e.  B
)  /\  ph )  <->  ( (
x  e.  A  /\  ph )  \/  ( x  e.  B  /\  ph ) ) )
64, 5bitri 257 . . . 4  |-  ( ( x  e.  ( A  u.  B )  /\  ph )  <->  ( ( x  e.  A  /\  ph )  \/  ( x  e.  B  /\  ph )
) )
76exbii 1728 . . 3  |-  ( E. x ( x  e.  ( A  u.  B
)  /\  ph )  <->  E. x
( ( x  e.  A  /\  ph )  \/  ( x  e.  B  /\  ph ) ) )
8 df-rex 2754 . . . 4  |-  ( E. x  e.  A  ph  <->  E. x ( x  e.  A  /\  ph )
)
9 df-rex 2754 . . . 4  |-  ( E. x  e.  B  ph  <->  E. x ( x  e.  B  /\  ph )
)
108, 9orbi12i 528 . . 3  |-  ( ( E. x  e.  A  ph  \/  E. x  e.  B  ph )  <->  ( E. x ( x  e.  A  /\  ph )  \/  E. x ( x  e.  B  /\  ph ) ) )
112, 7, 103bitr4i 285 . 2  |-  ( E. x ( x  e.  ( A  u.  B
)  /\  ph )  <->  ( E. x  e.  A  ph  \/  E. x  e.  B  ph ) )
121, 11bitri 257 1  |-  ( E. x  e.  ( A  u.  B ) ph  <->  ( E. x  e.  A  ph  \/  E. x  e.  B  ph ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 189    \/ wo 374    /\ wa 375   E.wex 1673    e. wcel 1897   E.wrex 2749    u. cun 3413
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1679  ax-4 1692  ax-5 1768  ax-6 1815  ax-7 1861  ax-10 1925  ax-11 1930  ax-12 1943  ax-13 2101  ax-ext 2441
This theorem depends on definitions:  df-bi 190  df-or 376  df-an 377  df-tru 1457  df-ex 1674  df-nf 1678  df-sb 1808  df-clab 2448  df-cleq 2454  df-clel 2457  df-nfc 2591  df-rex 2754  df-v 3058  df-un 3420
This theorem is referenced by:  rexprg  4033  rextpg  4035  iunxun  4376  oarec  7288  zornn0g  8960  scshwfzeqfzo  12961  rpnnen2  14326  vdwlem6  14984  pmatcollpw3fi1  19860  cmpfi  20471  poimirlem25  32009  unima  37466
  Copyright terms: Public domain W3C validator