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

Theorem fssres 5565
Description: Restriction of a function with a subclass of its domain. (Contributed by NM, 23-Sep-2004.)
Assertion
Ref Expression
fssres  |-  ( ( F : A --> B  /\  C  C_  A )  -> 
( F  |`  C ) : C --> B )

Proof of Theorem fssres
StepHypRef Expression
1 df-f 5381 . . 3  |-  ( F : A --> B  <->  ( F  Fn  A  /\  ran  F  C_  B ) )
2 fnssres 5496 . . . . 5  |-  ( ( F  Fn  A  /\  C  C_  A )  -> 
( F  |`  C )  Fn  C )
3 resss 5087 . . . . . . 7  |-  ( F  |`  C )  C_  F
4 rnss 5012 . . . . . . 7  |-  ( ( F  |`  C )  C_  F  ->  ran  ( F  |`  C )  C_  ran  F )
53, 4ax-mp 5 . . . . . 6  |-  ran  ( F  |`  C )  C_  ran  F
6 sstr 3256 . . . . . 6  |-  ( ( ran  ( F  |`  C )  C_  ran  F  /\  ran  F  C_  B )  ->  ran  ( F  |`  C ) 
C_  B )
75, 6mpan 428 . . . . 5  |-  ( ran 
F  C_  B  ->  ran  ( F  |`  C ) 
C_  B )
82, 7anim12i 338 . . . 4  |-  ( ( ( F  Fn  A  /\  C  C_  A )  /\  ran  F  C_  B )  ->  (
( F  |`  C )  Fn  C  /\  ran  ( F  |`  C ) 
C_  B ) )
98an32s 574 . . 3  |-  ( ( ( F  Fn  A  /\  ran  F  C_  B
)  /\  C  C_  A
)  ->  ( ( F  |`  C )  Fn  C  /\  ran  ( F  |`  C )  C_  B ) )
101, 9sylanb 284 . 2  |-  ( ( F : A --> B  /\  C  C_  A )  -> 
( ( F  |`  C )  Fn  C  /\  ran  ( F  |`  C )  C_  B
) )
11 df-f 5381 . 2  |-  ( ( F  |`  C ) : C --> B  <->  ( ( F  |`  C )  Fn  C  /\  ran  ( F  |`  C )  C_  B ) )
1210, 11sylibr 134 1  |-  ( ( F : A --> B  /\  C  C_  A )  -> 
( F  |`  C ) : C --> B )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    C_ wss 3220   ran crn 4775    |` cres 4776    Fn wfn 5372   -->wf 5373
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-fun 5379  df-fn 5380  df-f 5381
This theorem is used by:  fssresd  5566  fssres2  5567  fresin  5568  f1ssres  5607  feqresmpt  5757  f2ndf  6462  elmapssres  6954  pmresg  6957  mapunen  7151  finomni  7480  fseq1p1m1  10501  seqf1oglem2  10957  wrdred1  11347  resmhm  13794  resghm  14063  hmeores  15416  limcdifap  15763  012of  17023  2o01f  17024
  Copyright terms: Public domain W3C validator