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

Theorem fores 5486
Description: Restriction of a function. (Contributed by NM, 4-Mar-1997.)
Assertion
Ref Expression
fores  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( F  |`  A ) : A -onto-> ( F
" A ) )

Proof of Theorem fores
StepHypRef Expression
1 funres 5295 . . 3  |-  ( Fun 
F  ->  Fun  ( F  |`  A ) )
21anim1i 340 . 2  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( Fun  ( F  |`  A )  /\  A  C_ 
dom  F ) )
3 df-fn 5257 . . 3  |-  ( ( F  |`  A )  Fn  A  <->  ( Fun  ( F  |`  A )  /\  dom  ( F  |`  A )  =  A ) )
4 df-ima 4672 . . . . 5  |-  ( F
" A )  =  ran  ( F  |`  A )
54eqcomi 2197 . . . 4  |-  ran  ( F  |`  A )  =  ( F " A
)
6 df-fo 5260 . . . 4  |-  ( ( F  |`  A ) : A -onto-> ( F " A )  <->  ( ( F  |`  A )  Fn  A  /\  ran  ( F  |`  A )  =  ( F " A
) ) )
75, 6mpbiran2 943 . . 3  |-  ( ( F  |`  A ) : A -onto-> ( F " A )  <->  ( F  |`  A )  Fn  A
)
8 ssdmres 4964 . . . 4  |-  ( A 
C_  dom  F  <->  dom  ( F  |`  A )  =  A )
98anbi2i 457 . . 3  |-  ( ( Fun  ( F  |`  A )  /\  A  C_ 
dom  F )  <->  ( Fun  ( F  |`  A )  /\  dom  ( F  |`  A )  =  A ) )
103, 7, 93bitr4i 212 . 2  |-  ( ( F  |`  A ) : A -onto-> ( F " A )  <->  ( Fun  ( F  |`  A )  /\  A  C_  dom  F ) )
112, 10sylibr 134 1  |-  ( ( Fun  F  /\  A  C_ 
dom  F )  -> 
( F  |`  A ) : A -onto-> ( F
" A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    C_ wss 3153   dom cdm 4659   ran crn 4660    |` cres 4661   "cima 4662   Fun wfun 5248    Fn wfn 5249   -onto->wfo 5252
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-br 4030  df-opab 4091  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-res 4671  df-ima 4672  df-fun 5256  df-fn 5257  df-fo 5260
This theorem is referenced by:  resdif  5522  ctinf  12587  qnnen  12588
  Copyright terms: Public domain W3C validator