MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  residm Structured version   Visualization version   GIF version

Theorem residm 6010
Description: Idempotent law for restriction. (Contributed by NM, 27-Mar-1998.)
Assertion
Ref Expression
residm ((𝐴𝐵) ↾ 𝐵) = (𝐴𝐵)

Proof of Theorem residm
StepHypRef Expression
1 ssid 3967 . 2 𝐵𝐵
2 resabs2 6009 . 2 (𝐵𝐵 → ((𝐴𝐵) ↾ 𝐵) = (𝐴𝐵))
31, 2ax-mp 5 1 ((𝐴𝐵) ↾ 𝐵) = (𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1567  wss 3913  cres 5664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-opab 5178  df-xp 5668  df-rel 5669  df-res 5674
This theorem is referenced by:  resima  6015  dffv2  6977  fvsnun2  7182  qtopres  23824  bnj1253  35350  eldioph2lem1  43383  eldioph2lem2  43384  relexpiidm  44322
  Copyright terms: Public domain W3C validator