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

Theorem unipr 3842
Description: The union of a pair is the union of its members. Proposition 5.7 of [TakeutiZaring] p. 16. (Contributed by NM, 23-Aug-1993.)
Hypotheses
Ref Expression
unipr.1  |-  A  e. 
_V
unipr.2  |-  B  e. 
_V
Assertion
Ref Expression
unipr  |-  U. { A ,  B }  =  ( A  u.  B )

Proof of Theorem unipr
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.43 1592 . . . 4  |-  ( E. y ( ( x  e.  y  /\  y  =  A )  \/  (
x  e.  y  /\  y  =  B )
)  <->  ( E. y
( x  e.  y  /\  y  =  A )  \/  E. y
( x  e.  y  /\  y  =  B ) ) )
2 vex 2792 . . . . . . . 8  |-  y  e. 
_V
32elpr 3659 . . . . . . 7  |-  ( y  e.  { A ,  B }  <->  ( y  =  A  \/  y  =  B ) )
43anbi2i 675 . . . . . 6  |-  ( ( x  e.  y  /\  y  e.  { A ,  B } )  <->  ( x  e.  y  /\  (
y  =  A  \/  y  =  B )
) )
5 andi 837 . . . . . 6  |-  ( ( x  e.  y  /\  ( y  =  A  \/  y  =  B ) )  <->  ( (
x  e.  y  /\  y  =  A )  \/  ( x  e.  y  /\  y  =  B ) ) )
64, 5bitri 240 . . . . 5  |-  ( ( x  e.  y  /\  y  e.  { A ,  B } )  <->  ( (
x  e.  y  /\  y  =  A )  \/  ( x  e.  y  /\  y  =  B ) ) )
76exbii 1569 . . . 4  |-  ( E. y ( x  e.  y  /\  y  e. 
{ A ,  B } )  <->  E. y
( ( x  e.  y  /\  y  =  A )  \/  (
x  e.  y  /\  y  =  B )
) )
8 unipr.1 . . . . . . 7  |-  A  e. 
_V
98clel3 2907 . . . . . 6  |-  ( x  e.  A  <->  E. y
( y  =  A  /\  x  e.  y ) )
10 exancom 1573 . . . . . 6  |-  ( E. y ( y  =  A  /\  x  e.  y )  <->  E. y
( x  e.  y  /\  y  =  A ) )
119, 10bitri 240 . . . . 5  |-  ( x  e.  A  <->  E. y
( x  e.  y  /\  y  =  A ) )
12 unipr.2 . . . . . . 7  |-  B  e. 
_V
1312clel3 2907 . . . . . 6  |-  ( x  e.  B  <->  E. y
( y  =  B  /\  x  e.  y ) )
14 exancom 1573 . . . . . 6  |-  ( E. y ( y  =  B  /\  x  e.  y )  <->  E. y
( x  e.  y  /\  y  =  B ) )
1513, 14bitri 240 . . . . 5  |-  ( x  e.  B  <->  E. y
( x  e.  y  /\  y  =  B ) )
1611, 15orbi12i 507 . . . 4  |-  ( ( x  e.  A  \/  x  e.  B )  <->  ( E. y ( x  e.  y  /\  y  =  A )  \/  E. y ( x  e.  y  /\  y  =  B ) ) )
171, 7, 163bitr4ri 269 . . 3  |-  ( ( x  e.  A  \/  x  e.  B )  <->  E. y ( x  e.  y  /\  y  e. 
{ A ,  B } ) )
1817abbii 2396 . 2  |-  { x  |  ( x  e.  A  \/  x  e.  B ) }  =  { x  |  E. y ( x  e.  y  /\  y  e. 
{ A ,  B } ) }
19 df-un 3158 . 2  |-  ( A  u.  B )  =  { x  |  ( x  e.  A  \/  x  e.  B ) }
20 df-uni 3829 . 2  |-  U. { A ,  B }  =  { x  |  E. y ( x  e.  y  /\  y  e. 
{ A ,  B } ) }
2118, 19, 203eqtr4ri 2315 1  |-  U. { A ,  B }  =  ( A  u.  B )
Colors of variables: wff set class
Syntax hints:    \/ wo 357    /\ wa 358   E.wex 1528    = wceq 1623    e. wcel 1685   {cab 2270   _Vcvv 2789    u. cun 3151   {cpr 3642   U.cuni 3828
This theorem is referenced by:  uniprg  3843  unisn  3844  uniintsn  3900  uniop  4268  unex  4517  rankxplim  7545  mrcun  13520  indistps  16744  indistps2  16745  leordtval2  16938  ex-uni  20790  toplat  24701
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1636  ax-8 1644  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2265
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1631  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-v 2791  df-un 3158  df-sn 3647  df-pr 3648  df-uni 3829
  Copyright terms: Public domain W3C validator