HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem resima 3397
Description: A restriction to an image.
Assertion
Ref Expression
resima |- ((A |` B)"B) = (A"B)

Proof of Theorem resima
StepHypRef Expression
1 residm 3396 . . 3 |- ((A |` B) |` B) = (A |` B)
21rneqi 3346 . 2 |- ran ((A |` B) |` B) = ran ( A |` B)
3 df-ima 3197 . 2 |- ((A |` B)"B) = ran ((A |` B) |` B)
4 df-ima 3197 . 2 |- (A"B) = ran ( A |` B)
52, 3, 43eqtr4 1508 1 |- ((A |` B)"B) = (A"B)
Colors of variables: wff set class
Syntax hints:   = wceq 958  ran crn 3177   |` cres 3178  "cima 3179
This theorem is referenced by:  isarep2 3584  f1imacnv 3711
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-br 2625  df-opab 2672  df-xp 3190  df-rel 3191  df-cnv 3192  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197
Copyright terms: Public domain