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

Theorem fvelrn 5774
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 2292 . . . . 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 5635 . . . . 5  |-  ( x  =  A  ->  ( F `  x )  =  ( F `  A ) )
43eleq1d 2298 . . . 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 5755 . . . . 5  |-  ( ( Fun  F  /\  x  e.  dom  F )  ->  <. x ,  ( F `
 x ) >.  e.  F )
7 vex 2803 . . . . . 6  |-  x  e. 
_V
8 opeq1 3860 . . . . . . 7  |-  ( y  =  x  ->  <. y ,  ( F `  x ) >.  =  <. x ,  ( F `  x ) >. )
98eleq1d 2298 . . . . . 6  |-  ( y  =  x  ->  ( <. y ,  ( F `
 x ) >.  e.  F  <->  <. x ,  ( F `  x )
>.  e.  F ) )
107, 9spcev 2899 . . . . 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 5652 . . . . 5  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( F `  x
)  e.  _V )
13 elrn2g 4918 . . . . 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 2862 . 2  |-  ( A  e.  dom  F  -> 
( ( Fun  F  /\  A  e.  dom  F )  ->  ( F `  A )  e.  ran  F ) )
1716anabsi7 581 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 1395   E.wex 1538    e. wcel 2200   _Vcvv 2800   <.cop 3670   dom cdm 4723   ran crn 4724   Fun wfun 5318   ` cfv 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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-iota 5284  df-fun 5326  df-fn 5327  df-fv 5332
This theorem is referenced by:  fnfvelrn  5775  eldmrexrn  5784  funfvima  5881  elunirn  5902  frecuzrdgdomlem  10669  frecuzrdgsuctlem  10675  gsumpropd2  13466  iedgedgg  15902  usgredg3  16053  ushgredgedg  16065  ushgredgedgloop  16067  edginwlkd  16152  iedginwlk  16154
  Copyright terms: Public domain W3C validator