NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  undi Unicode version

Theorem undi 3503
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

Proof of Theorem undi
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 elin 3220 . . . 4
21orbi2i 505 . . 3
3 ordi 834 . . 3
4 elin 3220 . . . 4
5 elun 3221 . . . . 5
6 elun 3221 . . . . 5
75, 6anbi12i 678 . . . 4
84, 7bitr2i 241 . . 3
92, 3, 83bitri 262 . 2
109uneqri 3407 1
Colors of variables: wff setvar class
Syntax hints:   wo 357   wa 358   wceq 1642   wcel 1710   cun 3208   cin 3209
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215
This theorem is referenced by:  undir  3505  dfif4  3674  dfif5  3675
  Copyright terms: Public domain W3C validator