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

Theorem funfvima 5940
Description: A function's value in a preimage belongs to the image. (Contributed by NM, 23-Sep-2003.)
Assertion
Ref Expression
funfvima  |-  ( ( Fun  F  /\  B  e.  dom  F )  -> 
( B  e.  A  ->  ( F `  B
)  e.  ( F
" A ) ) )

Proof of Theorem funfvima
StepHypRef Expression
1 dmres 5079 . . . . . . 7  |-  dom  ( F  |`  A )  =  ( A  i^i  dom  F )
21elin2 3417 . . . . . 6  |-  ( B  e.  dom  ( F  |`  A )  <->  ( B  e.  A  /\  B  e. 
dom  F ) )
3 funres 5413 . . . . . . . . 9  |-  ( Fun 
F  ->  Fun  ( F  |`  A ) )
4 fvelrn 5830 . . . . . . . . 9  |-  ( ( Fun  ( F  |`  A )  /\  B  e.  dom  ( F  |`  A ) )  -> 
( ( F  |`  A ) `  B
)  e.  ran  ( F  |`  A ) )
53, 4sylan 283 . . . . . . . 8  |-  ( ( Fun  F  /\  B  e.  dom  ( F  |`  A ) )  -> 
( ( F  |`  A ) `  B
)  e.  ran  ( F  |`  A ) )
6 df-ima 4782 . . . . . . . . . 10  |-  ( F
" A )  =  ran  ( F  |`  A )
76eleq2i 2305 . . . . . . . . 9  |-  ( ( F `  B )  e.  ( F " A )  <->  ( F `  B )  e.  ran  ( F  |`  A ) )
8 fvres 5714 . . . . . . . . . 10  |-  ( B  e.  A  ->  (
( F  |`  A ) `
 B )  =  ( F `  B
) )
98eleq1d 2307 . . . . . . . . 9  |-  ( B  e.  A  ->  (
( ( F  |`  A ) `  B
)  e.  ran  ( F  |`  A )  <->  ( F `  B )  e.  ran  ( F  |`  A ) ) )
107, 9bitr4id 199 . . . . . . . 8  |-  ( B  e.  A  ->  (
( F `  B
)  e.  ( F
" A )  <->  ( ( F  |`  A ) `  B )  e.  ran  ( F  |`  A ) ) )
115, 10syl5ibrcom 157 . . . . . . 7  |-  ( ( Fun  F  /\  B  e.  dom  ( F  |`  A ) )  -> 
( B  e.  A  ->  ( F `  B
)  e.  ( F
" A ) ) )
1211ex 115 . . . . . 6  |-  ( Fun 
F  ->  ( B  e.  dom  ( F  |`  A )  ->  ( B  e.  A  ->  ( F `  B )  e.  ( F " A ) ) ) )
132, 12biimtrrid 153 . . . . 5  |-  ( Fun 
F  ->  ( ( B  e.  A  /\  B  e.  dom  F )  ->  ( B  e.  A  ->  ( F `  B )  e.  ( F " A ) ) ) )
1413expd 258 . . . 4  |-  ( Fun 
F  ->  ( B  e.  A  ->  ( B  e.  dom  F  -> 
( B  e.  A  ->  ( F `  B
)  e.  ( F
" A ) ) ) ) )
1514com12 30 . . 3  |-  ( B  e.  A  ->  ( Fun  F  ->  ( B  e.  dom  F  ->  ( B  e.  A  ->  ( F `  B )  e.  ( F " A ) ) ) ) )
1615impd 254 . 2  |-  ( B  e.  A  ->  (
( Fun  F  /\  B  e.  dom  F )  ->  ( B  e.  A  ->  ( F `  B )  e.  ( F " A ) ) ) )
1716pm2.43b 52 1  |-  ( ( Fun  F  /\  B  e.  dom  F )  -> 
( B  e.  A  ->  ( F `  B
)  e.  ( F
" A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2209   dom cdm 4769   ran crn 4770    |` cres 4771   "cima 4772   Fun wfun 5366   ` cfv 5372
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 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 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380
This theorem is referenced by:  funfvima2  5941  elovimad  6119  fiintim  7228  caseinl  7421  caseinr  7422  ctssdccl  7441  suplocexprlemdisj  8077  suplocexprlemub  8080  swrdwrdsymbg  11414  ennnfonelemex  13283  ctinfomlemom  13296  txcnp  15295
  Copyright terms: Public domain W3C validator