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

Theorem resiundiOLD 4761
 Description: Obsolete proof of resiun2 4991 as of 5-Apr-2016. Distributive law for cross product over restriction. (Contributed by Mario Carneiro, 11-Nov-2014.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
resiundiOLD
Distinct variable group:   ,
Allowed substitution hints:   ()   ()

Proof of Theorem resiundiOLD
StepHypRef Expression
1 xpiundir 4760 . . . 4
21ineq2i 3380 . . 3
3 iunin2 3982 . . 3
42, 3eqtr4i 2319 . 2
5 df-res 4717 . 2
6 df-res 4717 . . . 4
76a1i 10 . . 3
87iuneq2i 3939 . 2
94, 5, 83eqtr4i 2326 1
 Colors of variables: wff set class Syntax hints:   wceq 1632   wcel 1696  cvv 2801   cin 3164  ciun 3921   cxp 4703   cres 4707 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pr 4230 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-v 2803  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-iun 3923  df-opab 4094  df-xp 4711  df-res 4717
 Copyright terms: Public domain W3C validator