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

Theorem rabun2 3588
Description: Abstraction restricted to a union. (Contributed by Stefan O'Rear, 5-Feb-2015.)
Assertion
Ref Expression
rabun2  |-  { x  e.  ( A  u.  B
)  |  ph }  =  ( { x  e.  A  |  ph }  u.  { x  e.  B  |  ph } )

Proof of Theorem rabun2
StepHypRef Expression
1 df-rab 2683 . 2  |-  { x  e.  ( A  u.  B
)  |  ph }  =  { x  |  ( x  e.  ( A  u.  B )  /\  ph ) }
2 df-rab 2683 . . . 4  |-  { x  e.  A  |  ph }  =  { x  |  ( x  e.  A  /\  ph ) }
3 df-rab 2683 . . . 4  |-  { x  e.  B  |  ph }  =  { x  |  ( x  e.  B  /\  ph ) }
42, 3uneq12i 3467 . . 3  |-  ( { x  e.  A  |  ph }  u.  { x  e.  B  |  ph }
)  =  ( { x  |  ( x  e.  A  /\  ph ) }  u.  { x  |  ( x  e.  B  /\  ph ) } )
5 elun 3456 . . . . . . 7  |-  ( x  e.  ( A  u.  B )  <->  ( x  e.  A  \/  x  e.  B ) )
65anbi1i 677 . . . . . 6  |-  ( ( x  e.  ( A  u.  B )  /\  ph )  <->  ( ( x  e.  A  \/  x  e.  B )  /\  ph ) )
7 andir 839 . . . . . 6  |-  ( ( ( x  e.  A  \/  x  e.  B
)  /\  ph )  <->  ( (
x  e.  A  /\  ph )  \/  ( x  e.  B  /\  ph ) ) )
86, 7bitri 241 . . . . 5  |-  ( ( x  e.  ( A  u.  B )  /\  ph )  <->  ( ( x  e.  A  /\  ph )  \/  ( x  e.  B  /\  ph )
) )
98abbii 2524 . . . 4  |-  { x  |  ( x  e.  ( A  u.  B
)  /\  ph ) }  =  { x  |  ( ( x  e.  A  /\  ph )  \/  ( x  e.  B  /\  ph ) ) }
10 unab 3576 . . . 4  |-  ( { x  |  ( x  e.  A  /\  ph ) }  u.  { x  |  ( x  e.  B  /\  ph ) } )  =  {
x  |  ( ( x  e.  A  /\  ph )  \/  ( x  e.  B  /\  ph ) ) }
119, 10eqtr4i 2435 . . 3  |-  { x  |  ( x  e.  ( A  u.  B
)  /\  ph ) }  =  ( { x  |  ( x  e.  A  /\  ph ) }  u.  { x  |  ( x  e.  B  /\  ph ) } )
124, 11eqtr4i 2435 . 2  |-  ( { x  e.  A  |  ph }  u.  { x  e.  B  |  ph }
)  =  { x  |  ( x  e.  ( A  u.  B
)  /\  ph ) }
131, 12eqtr4i 2435 1  |-  { x  e.  ( A  u.  B
)  |  ph }  =  ( { x  e.  A  |  ph }  u.  { x  e.  B  |  ph } )
Colors of variables: wff set class
Syntax hints:    \/ wo 358    /\ wa 359    = wceq 1649    e. wcel 1721   {cab 2398   {crab 2678    u. cun 3286
This theorem is referenced by:  fnsuppres  5919
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 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2393
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 2399  df-cleq 2405  df-clel 2408  df-nfc 2537  df-rab 2683  df-v 2926  df-un 3293
  Copyright terms: Public domain W3C validator