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

Theorem indi 3596
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 862 . . . 4  |-  ( ( x  e.  A  /\  ( x  e.  B  \/  x  e.  C
) )  <->  ( (
x  e.  A  /\  x  e.  B )  \/  ( x  e.  A  /\  x  e.  C
) ) )
2 elin 3539 . . . . 5  |-  ( x  e.  ( A  i^i  B )  <->  ( x  e.  A  /\  x  e.  B ) )
3 elin 3539 . . . . 5  |-  ( x  e.  ( A  i^i  C )  <->  ( x  e.  A  /\  x  e.  C ) )
42, 3orbi12i 521 . . . 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 252 . . 3  |-  ( ( x  e.  A  /\  ( x  e.  B  \/  x  e.  C
) )  <->  ( x  e.  ( A  i^i  B
)  \/  x  e.  ( A  i^i  C
) ) )
6 elun 3497 . . . 4  |-  ( x  e.  ( B  u.  C )  <->  ( x  e.  B  \/  x  e.  C ) )
76anbi2i 694 . . 3  |-  ( ( x  e.  A  /\  x  e.  ( B  u.  C ) )  <->  ( x  e.  A  /\  (
x  e.  B  \/  x  e.  C )
) )
8 elun 3497 . . 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 277 . 2  |-  ( ( x  e.  A  /\  x  e.  ( B  u.  C ) )  <->  x  e.  ( ( A  i^i  B )  u.  ( A  i^i  C ) ) )
109ineqri 3544 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 368    /\ wa 369    = wceq 1369    e. wcel 1756    u. cun 3326    i^i cin 3327
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2568  df-v 2974  df-un 3333  df-in 3335
This theorem is referenced by:  indir  3598  difindi  3604  undisj2  3731  disjssun  3736  difdifdir  3766  disjpr2  3938  diftpsn3  4012  resundi  5124  fresaun  5582  elfiun  7680  unxpwdom  7804  kmlem2  8320  cdainf  8361  ackbij1lem1  8389  ackbij1lem2  8390  ssxr  9444  incexclem  13299  bitsinv1  13638  bitsinvp1  13645  bitsres  13669  paste  18898  unmbl  21019  ovolioo  21049  uniioombllem4  21066  volcn  21086  ellimc2  21352  lhop2  21487  ex-in  23632  eulerpartgbij  26755  asindmre  28479
  Copyright terms: Public domain W3C validator