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

Theorem rescom 4996
Description: Commutative law for restriction. (Contributed by NM, 27-Mar-1998.)
Assertion
Ref Expression
rescom  |-  ( ( A  |`  B )  |`  C )  =  ( ( A  |`  C )  |`  B )

Proof of Theorem rescom
StepHypRef Expression
1 incom 3374 . . 3  |-  ( B  i^i  C )  =  ( C  i^i  B
)
21reseq2i 4968 . 2  |-  ( A  |`  ( B  i^i  C
) )  =  ( A  |`  ( C  i^i  B ) )
3 resres 4984 . 2  |-  ( ( A  |`  B )  |`  C )  =  ( A  |`  ( B  i^i  C ) )
4 resres 4984 . 2  |-  ( ( A  |`  C )  |`  B )  =  ( A  |`  ( C  i^i  B ) )
52, 3, 43eqtr4i 2326 1  |-  ( ( A  |`  B )  |`  C )  =  ( ( A  |`  C )  |`  B )
Colors of variables: wff set class
Syntax hints:    = wceq 1632    i^i cin 3164    |` cres 4707
This theorem is referenced by:  resabs2  5001  setscom  13192  dvres3a  19280  cpnres  19302  dvmptres3  19321
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-rab 2565  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-opab 4094  df-xp 4711  df-rel 4712  df-res 4717
  Copyright terms: Public domain W3C validator