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

Theorem fvelrn 5813
Description: A function's value belongs to its range. (Contributed by NM, 14-Oct-1996.)
Assertion
Ref Expression
fvelrn  |-  ( ( Fun  F  /\  A  e.  dom  F )  -> 
( F `  A
)  e.  ran  F
)

Proof of Theorem fvelrn
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2297 . . . . 5  |-  ( x  =  A  ->  (
x  e.  dom  F  <->  A  e.  dom  F ) )
21anbi2d 464 . . . 4  |-  ( x  =  A  ->  (
( Fun  F  /\  x  e.  dom  F )  <-> 
( Fun  F  /\  A  e.  dom  F ) ) )
3 fveq2 5675 . . . . 5  |-  ( x  =  A  ->  ( F `  x )  =  ( F `  A ) )
43eleq1d 2303 . . . 4  |-  ( x  =  A  ->  (
( F `  x
)  e.  ran  F  <->  ( F `  A )  e.  ran  F ) )
52, 4imbi12d 234 . . 3  |-  ( x  =  A  ->  (
( ( Fun  F  /\  x  e.  dom  F )  ->  ( F `  x )  e.  ran  F )  <->  ( ( Fun 
F  /\  A  e.  dom  F )  ->  ( F `  A )  e.  ran  F ) ) )
6 funfvop 5795 . . . . 5  |-  ( ( Fun  F  /\  x  e.  dom  F )  ->  <. x ,  ( F `
 x ) >.  e.  F )
7 vex 2818 . . . . . 6  |-  x  e. 
_V
8 opeq1 3888 . . . . . . 7  |-  ( y  =  x  ->  <. y ,  ( F `  x ) >.  =  <. x ,  ( F `  x ) >. )
98eleq1d 2303 . . . . . 6  |-  ( y  =  x  ->  ( <. y ,  ( F `
 x ) >.  e.  F  <->  <. x ,  ( F `  x )
>.  e.  F ) )
107, 9spcev 2914 . . . . 5  |-  ( <.
x ,  ( F `
 x ) >.  e.  F  ->  E. y <. y ,  ( F `
 x ) >.  e.  F )
116, 10syl 14 . . . 4  |-  ( ( Fun  F  /\  x  e.  dom  F )  ->  E. y <. y ,  ( F `  x )
>.  e.  F )
12 funfvex 5692 . . . . 5  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( F `  x
)  e.  _V )
13 elrn2g 4950 . . . . 5  |-  ( ( F `  x )  e.  _V  ->  (
( F `  x
)  e.  ran  F  <->  E. y <. y ,  ( F `  x )
>.  e.  F ) )
1412, 13syl 14 . . . 4  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( ( F `  x )  e.  ran  F  <->  E. y <. y ,  ( F `  x )
>.  e.  F ) )
1511, 14mpbird 167 . . 3  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( F `  x
)  e.  ran  F
)
165, 15vtoclg 2877 . 2  |-  ( A  e.  dom  F  -> 
( ( Fun  F  /\  A  e.  dom  F )  ->  ( F `  A )  e.  ran  F ) )
1716anabsi7 583 1  |-  ( ( Fun  F  /\  A  e.  dom  F )  -> 
( F `  A
)  e.  ran  F
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398   E.wex 1541    e. wcel 2205   _Vcvv 2815   <.cop 3697   dom cdm 4754   ran crn 4755   Fun wfun 5351   ` cfv 5357
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365
This theorem is referenced by:  fnfvelrn  5814  eldmrexrn  5823  funfvima  5923  elunirn  5945  frecuzrdgdomlem  10803  frecuzrdgsuctlem  10809  gsumpropd2  13656  iedgedgg  16182  usgredg3  16335  ushgredgedg  16347  ushgredgedgloop  16349  subgruhgredgdm  16391  edginwlkd  16476  iedginwlk  16478
  Copyright terms: Public domain W3C validator