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

Theorem funfvima 5710
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 4899 . . . . . . 7  |-  dom  ( F  |`  A )  =  ( A  i^i  dom  F )
21elin2 3305 . . . . . 6  |-  ( B  e.  dom  ( F  |`  A )  <->  ( B  e.  A  /\  B  e. 
dom  F ) )
3 funres 5223 . . . . . . . . 9  |-  ( Fun 
F  ->  Fun  ( F  |`  A ) )
4 fvelrn 5610 . . . . . . . . 9  |-  ( ( Fun  ( F  |`  A )  /\  B  e.  dom  ( F  |`  A ) )  -> 
( ( F  |`  A ) `  B
)  e.  ran  ( F  |`  A ) )
53, 4sylan 281 . . . . . . . 8  |-  ( ( Fun  F  /\  B  e.  dom  ( F  |`  A ) )  -> 
( ( F  |`  A ) `  B
)  e.  ran  ( F  |`  A ) )
6 df-ima 4611 . . . . . . . . . 10  |-  ( F
" A )  =  ran  ( F  |`  A )
76eleq2i 2231 . . . . . . . . 9  |-  ( ( F `  B )  e.  ( F " A )  <->  ( F `  B )  e.  ran  ( F  |`  A ) )
8 fvres 5504 . . . . . . . . . 10  |-  ( B  e.  A  ->  (
( F  |`  A ) `
 B )  =  ( F `  B
) )
98eleq1d 2233 . . . . . . . . 9  |-  ( B  e.  A  ->  (
( ( F  |`  A ) `  B
)  e.  ran  ( F  |`  A )  <->  ( F `  B )  e.  ran  ( F  |`  A ) ) )
107, 9bitr4id 198 . . . . . . . 8  |-  ( B  e.  A  ->  (
( F `  B
)  e.  ( F
" A )  <->  ( ( F  |`  A ) `  B )  e.  ran  ( F  |`  A ) ) )
115, 10syl5ibrcom 156 . . . . . . 7  |-  ( ( Fun  F  /\  B  e.  dom  ( F  |`  A ) )  -> 
( B  e.  A  ->  ( F `  B
)  e.  ( F
" A ) ) )
1211ex 114 . . . . . 6  |-  ( Fun 
F  ->  ( B  e.  dom  ( F  |`  A )  ->  ( B  e.  A  ->  ( F `  B )  e.  ( F " A ) ) ) )
132, 12syl5bir 152 . . . . 5  |-  ( Fun 
F  ->  ( ( B  e.  A  /\  B  e.  dom  F )  ->  ( B  e.  A  ->  ( F `  B )  e.  ( F " A ) ) ) )
1413expd 256 . . . 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 252 . 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 103    e. wcel 2135   dom cdm 4598   ran crn 4599    |` cres 4600   "cima 4601   Fun wfun 5176   ` cfv 5182
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-v 2723  df-sbc 2947  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-opab 4038  df-id 4265  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-rn 4609  df-res 4610  df-ima 4611  df-iota 5147  df-fun 5184  df-fn 5185  df-fv 5190
This theorem is referenced by:  funfvima2  5711  fiintim  6885  caseinl  7047  caseinr  7048  ctssdccl  7067  suplocexprlemdisj  7652  suplocexprlemub  7655  ennnfonelemex  12284  ctinfomlemom  12297  txcnp  12812
  Copyright terms: Public domain W3C validator