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

Theorem xpundi 4743
Description: Distributive law for cross product over union. Theorem 103 of [Suppes] p. 52. (Contributed by NM, 12-Aug-2004.)
Assertion
Ref Expression
xpundi  |-  ( A  X.  ( B  u.  C ) )  =  ( ( A  X.  B )  u.  ( A  X.  C ) )

Proof of Theorem xpundi
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-xp 4697 . 2  |-  ( A  X.  ( B  u.  C ) )  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  e.  ( B  u.  C
) ) }
2 df-xp 4697 . . . 4  |-  ( A  X.  B )  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  e.  B ) }
3 df-xp 4697 . . . 4  |-  ( A  X.  C )  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  e.  C ) }
42, 3uneq12i 3329 . . 3  |-  ( ( A  X.  B )  u.  ( A  X.  C ) )  =  ( { <. x ,  y >.  |  ( x  e.  A  /\  y  e.  B ) }  u.  { <. x ,  y >.  |  ( x  e.  A  /\  y  e.  C ) } )
5 elun 3318 . . . . . . 7  |-  ( y  e.  ( B  u.  C )  <->  ( y  e.  B  \/  y  e.  C ) )
65anbi2i 675 . . . . . 6  |-  ( ( x  e.  A  /\  y  e.  ( B  u.  C ) )  <->  ( x  e.  A  /\  (
y  e.  B  \/  y  e.  C )
) )
7 andi 837 . . . . . 6  |-  ( ( x  e.  A  /\  ( y  e.  B  \/  y  e.  C
) )  <->  ( (
x  e.  A  /\  y  e.  B )  \/  ( x  e.  A  /\  y  e.  C
) ) )
86, 7bitri 240 . . . . 5  |-  ( ( x  e.  A  /\  y  e.  ( B  u.  C ) )  <->  ( (
x  e.  A  /\  y  e.  B )  \/  ( x  e.  A  /\  y  e.  C
) ) )
98opabbii 4085 . . . 4  |-  { <. x ,  y >.  |  ( x  e.  A  /\  y  e.  ( B  u.  C ) ) }  =  { <. x ,  y >.  |  ( ( x  e.  A  /\  y  e.  B
)  \/  ( x  e.  A  /\  y  e.  C ) ) }
10 unopab 4097 . . . 4  |-  ( {
<. x ,  y >.  |  ( x  e.  A  /\  y  e.  B ) }  u.  {
<. x ,  y >.  |  ( x  e.  A  /\  y  e.  C ) } )  =  { <. x ,  y >.  |  ( ( x  e.  A  /\  y  e.  B
)  \/  ( x  e.  A  /\  y  e.  C ) ) }
119, 10eqtr4i 2308 . . 3  |-  { <. x ,  y >.  |  ( x  e.  A  /\  y  e.  ( B  u.  C ) ) }  =  ( { <. x ,  y >.  |  ( x  e.  A  /\  y  e.  B ) }  u.  { <. x ,  y >.  |  ( x  e.  A  /\  y  e.  C ) } )
124, 11eqtr4i 2308 . 2  |-  ( ( A  X.  B )  u.  ( A  X.  C ) )  =  { <. x ,  y
>.  |  ( x  e.  A  /\  y  e.  ( B  u.  C
) ) }
131, 12eqtr4i 2308 1  |-  ( A  X.  ( B  u.  C ) )  =  ( ( A  X.  B )  u.  ( A  X.  C ) )
Colors of variables: wff set class
Syntax hints:    \/ wo 357    /\ wa 358    = wceq 1625    e. wcel 1686    u. cun 3152   {copab 4078    X. cxp 4689
This theorem is referenced by:  xpun  4749  xp2cda  7808  xpcdaen  7811  alephadd  8201
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1637  ax-8 1645  ax-6 1705  ax-7 1710  ax-11 1717  ax-12 1868  ax-ext 2266
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1531  df-nf 1534  df-sb 1632  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-v 2792  df-un 3159  df-opab 4080  df-xp 4697
  Copyright terms: Public domain W3C validator