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

Theorem indi 3417
Description: Distributive law for intersection over union. Exercise 10 of [TakeutiZaring] p. 17. (Contributed by NM, 30-Sep-2002.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
indi  |-  ( A  i^i  ( B  u.  C ) )  =  ( ( A  i^i  B )  u.  ( A  i^i  C ) )
Dummy variable  x is distinct from all other variables.

Proof of Theorem indi
StepHypRef Expression
1 andi 839 . . . 4  |-  ( ( x  e.  A  /\  ( x  e.  B  \/  x  e.  C
) )  <->  ( (
x  e.  A  /\  x  e.  B )  \/  ( x  e.  A  /\  x  e.  C
) ) )
2 elin 3360 . . . . 5  |-  ( x  e.  ( A  i^i  B )  <->  ( x  e.  A  /\  x  e.  B ) )
3 elin 3360 . . . . 5  |-  ( x  e.  ( A  i^i  C )  <->  ( x  e.  A  /\  x  e.  C ) )
42, 3orbi12i 509 . . . 4  |-  ( ( x  e.  ( A  i^i  B )  \/  x  e.  ( A  i^i  C ) )  <-> 
( ( x  e.  A  /\  x  e.  B )  \/  (
x  e.  A  /\  x  e.  C )
) )
51, 4bitr4i 245 . . 3  |-  ( ( x  e.  A  /\  ( x  e.  B  \/  x  e.  C
) )  <->  ( x  e.  ( A  i^i  B
)  \/  x  e.  ( A  i^i  C
) ) )
6 elun 3318 . . . 4  |-  ( x  e.  ( B  u.  C )  <->  ( x  e.  B  \/  x  e.  C ) )
76anbi2i 677 . . 3  |-  ( ( x  e.  A  /\  x  e.  ( B  u.  C ) )  <->  ( x  e.  A  /\  (
x  e.  B  \/  x  e.  C )
) )
8 elun 3318 . . 3  |-  ( x  e.  ( ( A  i^i  B )  u.  ( A  i^i  C
) )  <->  ( x  e.  ( A  i^i  B
)  \/  x  e.  ( A  i^i  C
) ) )
95, 7, 83bitr4i 270 . 2  |-  ( ( x  e.  A  /\  x  e.  ( B  u.  C ) )  <->  x  e.  ( ( A  i^i  B )  u.  ( A  i^i  C ) ) )
109ineqri 3364 1  |-  ( A  i^i  ( B  u.  C ) )  =  ( ( A  i^i  B )  u.  ( A  i^i  C ) )
Colors of variables: wff set class
Syntax hints:    \/ wo 359    /\ wa 360    = wceq 1624    e. wcel 1685    u. cun 3152    i^i cin 3153
This theorem is referenced by:  indir  3419  difindi  3425  undisj2  3509  disjssun  3514  difdifdir  3543  resundi  4969  fresaun  5378  elfiun  7179  unxpwdom  7299  kmlem2  7773  cdainf  7814  ackbij1lem1  7842  ackbij1lem2  7843  ssxr  8888  incexclem  12290  bitsinv1  12628  bitsinvp1  12635  bitsres  12659  paste  17017  unmbl  18890  ovolioo  18920  uniioombllem4  18936  volcn  18956  ellimc2  19222  lhop2  19357  ex-in  20788  hdrmp  25106
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1534  ax-5 1545  ax-17 1604  ax-9 1637  ax-8 1645  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2266
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1312  df-ex 1530  df-nf 1533  df-sb 1632  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-v 2792  df-un 3159  df-in 3161
  Copyright terms: Public domain W3C validator