ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  resima2 Unicode version

Theorem resima2 5053
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 4744 . 2  |-  ( ( A  |`  C ) " B )  =  ran  ( ( A  |`  C )  |`  B )
2 resres 5031 . . . 4  |-  ( ( A  |`  C )  |`  B )  =  ( A  |`  ( C  i^i  B ) )
32rneqi 4966 . . 3  |-  ran  (
( A  |`  C )  |`  B )  =  ran  ( A  |`  ( C  i^i  B ) )
4 df-ss 3214 . . . 4  |-  ( B 
C_  C  <->  ( B  i^i  C )  =  B )
5 incom 3401 . . . . . . . 8  |-  ( C  i^i  B )  =  ( B  i^i  C
)
65a1i 9 . . . . . . 7  |-  ( ( B  i^i  C )  =  B  ->  ( C  i^i  B )  =  ( B  i^i  C
) )
76reseq2d 5019 . . . . . 6  |-  ( ( B  i^i  C )  =  B  ->  ( A  |`  ( C  i^i  B ) )  =  ( A  |`  ( B  i^i  C ) ) )
87rneqd 4967 . . . . 5  |-  ( ( B  i^i  C )  =  B  ->  ran  ( A  |`  ( C  i^i  B ) )  =  ran  ( A  |`  ( B  i^i  C
) ) )
9 reseq2 5014 . . . . . . 7  |-  ( ( B  i^i  C )  =  B  ->  ( A  |`  ( B  i^i  C ) )  =  ( A  |`  B )
)
109rneqd 4967 . . . . . 6  |-  ( ( B  i^i  C )  =  B  ->  ran  ( A  |`  ( B  i^i  C ) )  =  ran  ( A  |`  B ) )
11 df-ima 4744 . . . . . 6  |-  ( A
" B )  =  ran  ( A  |`  B )
1210, 11eqtr4di 2282 . . . . 5  |-  ( ( B  i^i  C )  =  B  ->  ran  ( A  |`  ( B  i^i  C ) )  =  ( A " B ) )
138, 12eqtrd 2264 . . . 4  |-  ( ( B  i^i  C )  =  B  ->  ran  ( A  |`  ( C  i^i  B ) )  =  ( A " B ) )
144, 13sylbi 121 . . 3  |-  ( B 
C_  C  ->  ran  ( A  |`  ( C  i^i  B ) )  =  ( A " B ) )
153, 14eqtrid 2276 . 2  |-  ( B 
C_  C  ->  ran  ( ( A  |`  C )  |`  B )  =  ( A " B ) )
161, 15eqtrid 2276 1  |-  ( B 
C_  C  ->  (
( A  |`  C )
" B )  =  ( A " B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    i^i cin 3200    C_ wss 3201   ran crn 4732    |` cres 4733   "cima 4734
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-xp 4737  df-rel 4738  df-cnv 4739  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744
This theorem is referenced by:  ressuppss  6432  cnptopresti  15049  cnptoprest  15050
  Copyright terms: Public domain W3C validator