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

Theorem indi 3719
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 ) )

Proof of Theorem indi
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 andi 875 . . . 4  |-  ( ( x  e.  A  /\  ( x  e.  B  \/  x  e.  C
) )  <->  ( (
x  e.  A  /\  x  e.  B )  \/  ( x  e.  A  /\  x  e.  C
) ) )
2 elin 3649 . . . . 5  |-  ( x  e.  ( A  i^i  B )  <->  ( x  e.  A  /\  x  e.  B ) )
3 elin 3649 . . . . 5  |-  ( x  e.  ( A  i^i  C )  <->  ( x  e.  A  /\  x  e.  C ) )
42, 3orbi12i 523 . . . 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 255 . . 3  |-  ( ( x  e.  A  /\  ( x  e.  B  \/  x  e.  C
) )  <->  ( x  e.  ( A  i^i  B
)  \/  x  e.  ( A  i^i  C
) ) )
6 elun 3606 . . . 4  |-  ( x  e.  ( B  u.  C )  <->  ( x  e.  B  \/  x  e.  C ) )
76anbi2i 698 . . 3  |-  ( ( x  e.  A  /\  x  e.  ( B  u.  C ) )  <->  ( x  e.  A  /\  (
x  e.  B  \/  x  e.  C )
) )
8 elun 3606 . . 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 280 . 2  |-  ( ( x  e.  A  /\  x  e.  ( B  u.  C ) )  <->  x  e.  ( ( A  i^i  B )  u.  ( A  i^i  C ) ) )
109ineqri 3656 1  |-  ( A  i^i  ( B  u.  C ) )  =  ( ( A  i^i  B )  u.  ( A  i^i  C ) )
Colors of variables: wff setvar class
Syntax hints:    \/ wo 369    /\ wa 370    = wceq 1437    e. wcel 1868    u. cun 3434    i^i cin 3435
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1748  ax-6 1794  ax-7 1839  ax-10 1887  ax-11 1892  ax-12 1905  ax-13 2053  ax-ext 2400
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1787  df-clab 2408  df-cleq 2414  df-clel 2417  df-nfc 2572  df-v 3083  df-un 3441  df-in 3443
This theorem is referenced by:  indir  3721  difindi  3727  undisj2  3845  disjssun  3850  difdifdir  3883  disjpr2  4059  diftpsn3  4135  resundi  5133  fresaun  5767  elfiun  7946  unxpwdom  8106  kmlem2  8581  cdainf  8622  ackbij1lem1  8650  ackbij1lem2  8651  ssxr  9703  incexclem  13881  bitsinv1  14403  bitsinvp1  14410  bitsres  14434  paste  20296  unmbl  22477  ovolioo  22507  uniioombllem4  22530  volcn  22550  ellimc2  22818  lhop2  22953  ex-in  25860  eulerpartgbij  29200  poimirlem3  31856  poimirlem15  31868  asindmre  31940  iunrelexp0  36153  sge0resplit  38035  sge0split  38038
  Copyright terms: Public domain W3C validator