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

Theorem fvelrn 5808
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 2295 . . . . 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 5670 . . . . 5  |-  ( x  =  A  ->  ( F `  x )  =  ( F `  A ) )
43eleq1d 2301 . . . 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 5790 . . . . 5  |-  ( ( Fun  F  /\  x  e.  dom  F )  ->  <. x ,  ( F `
 x ) >.  e.  F )
7 vex 2816 . . . . . 6  |-  x  e. 
_V
8 opeq1 3883 . . . . . . 7  |-  ( y  =  x  ->  <. y ,  ( F `  x ) >.  =  <. x ,  ( F `  x ) >. )
98eleq1d 2301 . . . . . 6  |-  ( y  =  x  ->  ( <. y ,  ( F `
 x ) >.  e.  F  <->  <. x ,  ( F `  x )
>.  e.  F ) )
107, 9spcev 2912 . . . . 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 5687 . . . . 5  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( F `  x
)  e.  _V )
13 elrn2g 4945 . . . . 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 2875 . 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 2203   _Vcvv 2813   <.cop 3692   dom cdm 4749   ran crn 4750   Fun wfun 5346   ` cfv 5352
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 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-sbc 3043  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-iota 5312  df-fun 5354  df-fn 5355  df-fv 5360
This theorem is referenced by:  fnfvelrn  5809  eldmrexrn  5818  funfvima  5918  elunirn  5939  frecuzrdgdomlem  10779  frecuzrdgsuctlem  10785  gsumpropd2  13606  iedgedgg  16056  usgredg3  16209  ushgredgedg  16221  ushgredgedgloop  16223  subgruhgredgdm  16265  edginwlkd  16350  iedginwlk  16352
  Copyright terms: Public domain W3C validator