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

Theorem resabs2 5110
Description: Absorption law for restriction. (Contributed by NM, 27-Mar-1998.)
Assertion
Ref Expression
resabs2  |-  ( B 
C_  C  ->  (
( A  |`  B )  |`  C )  =  ( A  |`  B )
)

Proof of Theorem resabs2
StepHypRef Expression
1 rescom 5105 . 2  |-  ( ( A  |`  B )  |`  C )  =  ( ( A  |`  C )  |`  B )
2 resabs1 5109 . 2  |-  ( B 
C_  C  ->  (
( A  |`  C )  |`  B )  =  ( A  |`  B )
)
31, 2syl5eq 2425 1  |-  ( B 
C_  C  ->  (
( A  |`  B )  |`  C )  =  ( A  |`  B )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1649    C_ wss 3257    |` cres 4814
This theorem is referenced by:  residm  5111  fresaunres2  5549
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2362  ax-sep 4265  ax-nul 4273  ax-pr 4338
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2368  df-cleq 2374  df-clel 2377  df-nfc 2506  df-ne 2546  df-ral 2648  df-rex 2649  df-rab 2652  df-v 2895  df-dif 3260  df-un 3262  df-in 3264  df-ss 3271  df-nul 3566  df-if 3677  df-sn 3757  df-pr 3758  df-op 3760  df-opab 4202  df-xp 4818  df-rel 4819  df-res 4824
  Copyright terms: Public domain W3C validator