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

Theorem fores 5569
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 5367 . . 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 5329 . . 3  |-  ( ( F  |`  A )  Fn  A  <->  ( Fun  ( F  |`  A )  /\  dom  ( F  |`  A )  =  A ) )
4 df-ima 4738 . . . . 5  |-  ( F
" A )  =  ran  ( F  |`  A )
54eqcomi 2235 . . . 4  |-  ran  ( F  |`  A )  =  ( F " A
)
6 df-fo 5332 . . . 4  |-  ( ( F  |`  A ) : A -onto-> ( F " A )  <->  ( ( F  |`  A )  Fn  A  /\  ran  ( F  |`  A )  =  ( F " A
) ) )
75, 6mpbiran2 949 . . 3  |-  ( ( F  |`  A ) : A -onto-> ( F " A )  <->  ( F  |`  A )  Fn  A
)
8 ssdmres 5035 . . . 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 1397    C_ wss 3200   dom cdm 4725   ran crn 4726    |` cres 4727   "cima 4728   Fun wfun 5320    Fn wfn 5321   -onto->wfo 5324
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-res 4737  df-ima 4738  df-fun 5328  df-fn 5329  df-fo 5332
This theorem is referenced by:  resdif  5605  ctinf  13052  qnnen  13053
  Copyright terms: Public domain W3C validator