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

Theorem resundi 5133
 Description: Distributive law for restriction over union. Theorem 31 of [Suppes] p. 65. (Contributed by NM, 30-Sep-2002.)
Assertion
Ref Expression
resundi

Proof of Theorem resundi
StepHypRef Expression
1 xpundir 4903 . . . 4
21ineq2i 3661 . . 3
3 indi 3719 . . 3
42, 3eqtri 2451 . 2
5 df-res 4861 . 2
6 df-res 4861 . . 3
7 df-res 4861 . . 3
86, 7uneq12i 3618 . 2
94, 5, 83eqtr4i 2461 1
 Colors of variables: wff setvar class Syntax hints:   wceq 1437  cvv 3081   cun 3434   cin 3435   cxp 4847   cres 4851 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  df-opab 4480  df-xp 4855  df-res 4861 This theorem is referenced by:  imaundi  5263  relresfld  5377  relcoi1OLD  5380  resasplit  5766  fresaunres2  5768  residpr  6079  fnsnsplit  6112  tfrlem16  7115  mapunen  7743  fnfi  7851  fseq1p1m1  11868  gsum2dlem2  17590  dprd2da  17662  evlseu  18726  ptuncnv  20808  mbfres2  22587  eupath2lem3  25692  ffsrn  28307  resf1o  28308  cvmliftlem10  30012  poimirlem9  31862  eldioph4b  35572  pwssplit4  35866  relexp0a  36167  rnresun  37297
 Copyright terms: Public domain W3C validator