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

Theorem resima2 5179
Description: Image under a restricted class. (Contributed by FL, 31-Aug-2009.)
Assertion
Ref Expression
resima2  |-  ( B 
C_  C  ->  (
( A  |`  C )
" B )  =  ( A " B
) )

Proof of Theorem resima2
StepHypRef Expression
1 df-ima 4891 . 2  |-  ( ( A  |`  C ) " B )  =  ran  ( ( A  |`  C )  |`  B )
2 resres 5159 . . . 4  |-  ( ( A  |`  C )  |`  B )  =  ( A  |`  ( C  i^i  B ) )
32rneqi 5096 . . 3  |-  ran  (
( A  |`  C )  |`  B )  =  ran  ( A  |`  ( C  i^i  B ) )
4 df-ss 3334 . . . 4  |-  ( B 
C_  C  <->  ( B  i^i  C )  =  B )
5 incom 3533 . . . . . . . 8  |-  ( C  i^i  B )  =  ( B  i^i  C
)
65a1i 11 . . . . . . 7  |-  ( ( B  i^i  C )  =  B  ->  ( C  i^i  B )  =  ( B  i^i  C
) )
76reseq2d 5146 . . . . . 6  |-  ( ( B  i^i  C )  =  B  ->  ( A  |`  ( C  i^i  B ) )  =  ( A  |`  ( B  i^i  C ) ) )
87rneqd 5097 . . . . 5  |-  ( ( B  i^i  C )  =  B  ->  ran  ( A  |`  ( C  i^i  B ) )  =  ran  ( A  |`  ( B  i^i  C
) ) )
9 reseq2 5141 . . . . . . 7  |-  ( ( B  i^i  C )  =  B  ->  ( A  |`  ( B  i^i  C ) )  =  ( A  |`  B )
)
109rneqd 5097 . . . . . 6  |-  ( ( B  i^i  C )  =  B  ->  ran  ( A  |`  ( B  i^i  C ) )  =  ran  ( A  |`  B ) )
11 df-ima 4891 . . . . . 6  |-  ( A
" B )  =  ran  ( A  |`  B )
1210, 11syl6eqr 2486 . . . . 5  |-  ( ( B  i^i  C )  =  B  ->  ran  ( A  |`  ( B  i^i  C ) )  =  ( A " B ) )
138, 12eqtrd 2468 . . . 4  |-  ( ( B  i^i  C )  =  B  ->  ran  ( A  |`  ( C  i^i  B ) )  =  ( A " B ) )
144, 13sylbi 188 . . 3  |-  ( B 
C_  C  ->  ran  ( A  |`  ( C  i^i  B ) )  =  ( A " B ) )
153, 14syl5eq 2480 . 2  |-  ( B 
C_  C  ->  ran  ( ( A  |`  C )  |`  B )  =  ( A " B ) )
161, 15syl5eq 2480 1  |-  ( B 
C_  C  ->  (
( A  |`  C )
" B )  =  ( A " B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1652    i^i cin 3319    C_ wss 3320   ran crn 4879    |` cres 4880   "cima 4881
This theorem is referenced by:  marypha1lem  7438  ackbij2lem3  8121  dmdprdsplit2lem  15603  cnpresti  17352  cnprest  17353  limcflf  19768  limcresi  19772  limciun  19781  efopnlem2  20548  cvmopnlem  24965  cvmlift2lem9a  24990
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417  ax-sep 4330  ax-nul 4338  ax-pr 4403
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-ral 2710  df-rex 2711  df-rab 2714  df-v 2958  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-sn 3820  df-pr 3821  df-op 3823  df-br 4213  df-opab 4267  df-xp 4884  df-rel 4885  df-cnv 4886  df-dm 4888  df-rn 4889  df-res 4890  df-ima 4891
  Copyright terms: Public domain W3C validator