Theorem fvelrn 5839

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.

Step	Hyp	Ref	Expression
1		eleq1 2301	. . . . 5 |- ( x = A -> ( x e. dom F <-> A e. dom F ) )
2	1	anbi2d 468	. . . 4 |- ( x = A -> ( ( Fun F /\ x e. dom F ) <-> ( Fun F /\ A e. dom F ) ) )
3		fveq2 5695	. . . . 5 |- ( x = A -> ( F ` x ) = ( F ` A ) )
4	3	eleq1d 2307	. . . 4 |- ( x = A -> ( ( F ` x ) e. ran F <-> ( F ` A ) e. ran F ) )
5	2, 4	imbi12d 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 5821	. . . . 5 |- ( ( Fun F /\ x e. dom F ) -> <. x , ( F ` x ) >. e. F )
7		vex 2824	. . . . . 6 |- x e. _V
8		opeq1 3904	. . . . . . 7 |- ( y = x -> <. y , ( F ` x ) >. = <. x , ( F ` x ) >. )
9	8	eleq1d 2307	. . . . . 6 |- ( y = x -> ( <. y , ( F ` x ) >. e. F <-> <. x , ( F ` x ) >. e. F ) )
10	7, 9	spcev 2920	. . . . 5 |- ( <. x , ( F ` x ) >. e. F -> E. y <. y , ( F ` x ) >. e. F )
11	6, 10	syl 14	. . . 4 |- ( ( Fun F /\ x e. dom F ) -> E. y <. y , ( F ` x ) >. e. F )
12		funfvex 5712	. . . . 5 |- ( ( Fun F /\ x e. dom F ) -> ( F ` x ) e. _V )
13		elrn2g 4970	. . . . 5 |- ( ( F ` x ) e. _V -> ( ( F ` x ) e. ran F <-> E. y <. y , ( F ` x ) >. e. F ) )
14	12, 13	syl 14	. . . 4 |- ( ( Fun F /\ x e. dom F ) -> ( ( F ` x ) e. ran F <-> E. y <. y , ( F ` x ) >. e. F ) )
15	11, 14	mpbird 167	. . 3 |- ( ( Fun F /\ x e. dom F ) -> ( F ` x ) e. ran F )
16	5, 15	vtoclg 2883	. 2 |- ( A e. dom F -> ( ( Fun F /\ A e. dom F ) -> ( F ` A ) e. ran F ) )
17	16	anabsi7 587	1 |- ( ( Fun F /\ A e. dom F ) -> ( F ` A ) e. ran F )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   E.wex 1545   e. wcel 2209   _Vcvv 2821   <.cop 3712   dom cdm 4774   ran crn 4775   Fun wfun 5371   ` cfv 5377

This proof depends on 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 4249  ax-pow 4311  ax-pr 4346

This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385

This theorem is used by:  fnfvelrn  5840  eldmrexrn  5849  funfvima  5950  elunirn  5972  frecuzrdgdomlem  10854  frecuzrdgsuctlem  10860  iedgedgg  16302  usgredg3  16455  ushgredgedg  16467  ushgredgedgloop  16469  subgruhgredgdm  16511  edginwlkd  16596  iedginwlk  16598