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

Theorem undi 3416
Description: Distributive law for union over intersection. Exercise 11 of [TakeutiZaring] p. 17. (Contributed by NM, 30-Sep-2002.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
undi  |-  ( A  u.  ( B  i^i  C ) )  =  ( ( A  u.  B
)  i^i  ( A  u.  C ) )

Proof of Theorem undi
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elin 3358 . . . 4  |-  ( x  e.  ( B  i^i  C )  <->  ( x  e.  B  /\  x  e.  C ) )
21orbi2i 505 . . 3  |-  ( ( x  e.  A  \/  x  e.  ( B  i^i  C ) )  <->  ( x  e.  A  \/  (
x  e.  B  /\  x  e.  C )
) )
3 ordi 834 . . 3  |-  ( ( x  e.  A  \/  ( x  e.  B  /\  x  e.  C
) )  <->  ( (
x  e.  A  \/  x  e.  B )  /\  ( x  e.  A  \/  x  e.  C
) ) )
4 elin 3358 . . . 4  |-  ( x  e.  ( ( A  u.  B )  i^i  ( A  u.  C
) )  <->  ( x  e.  ( A  u.  B
)  /\  x  e.  ( A  u.  C
) ) )
5 elun 3316 . . . . 5  |-  ( x  e.  ( A  u.  B )  <->  ( x  e.  A  \/  x  e.  B ) )
6 elun 3316 . . . . 5  |-  ( x  e.  ( A  u.  C )  <->  ( x  e.  A  \/  x  e.  C ) )
75, 6anbi12i 678 . . . 4  |-  ( ( x  e.  ( A  u.  B )  /\  x  e.  ( A  u.  C ) )  <->  ( (
x  e.  A  \/  x  e.  B )  /\  ( x  e.  A  \/  x  e.  C
) ) )
84, 7bitr2i 241 . . 3  |-  ( ( ( x  e.  A  \/  x  e.  B
)  /\  ( x  e.  A  \/  x  e.  C ) )  <->  x  e.  ( ( A  u.  B )  i^i  ( A  u.  C )
) )
92, 3, 83bitri 262 . 2  |-  ( ( x  e.  A  \/  x  e.  ( B  i^i  C ) )  <->  x  e.  ( ( A  u.  B )  i^i  ( A  u.  C )
) )
109uneqri 3317 1  |-  ( A  u.  ( B  i^i  C ) )  =  ( ( A  u.  B
)  i^i  ( A  u.  C ) )
Colors of variables: wff set class
Syntax hints:    \/ wo 357    /\ wa 358    = wceq 1623    e. wcel 1684    u. cun 3150    i^i cin 3151
This theorem is referenced by:  undir  3418  dfif4  3576  dfif5  3577
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 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
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 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-v 2790  df-un 3157  df-in 3159
  Copyright terms: Public domain W3C validator