Theorem funfvima3 5952

Description: A class including a function contains the function's value in the image of the singleton of the argument. (Contributed by NM, 23-Mar-2004.)

Assertion

Ref	Expression
funfvima3	|- ( ( Fun F /\ F C_ G ) -> ( A e. dom F -> ( F ` A ) e. ( G " { A } ) ) )

Proof of Theorem funfvima3

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funfvop 5821	. . . . . 6 |- ( ( Fun F /\ A e. dom F ) -> <. A , ( F ` A ) >. e. F )
2		ssel 3242	. . . . . 6 |- ( F C_ G -> ( <. A , ( F ` A ) >. e. F -> <. A , ( F ` A ) >. e. G ) )
3	1, 2	syl5 32	. . . . 5 |- ( F C_ G -> ( ( Fun F /\ A e. dom F ) -> <. A , ( F ` A ) >. e. G ) )
4	3	imp 124	. . . 4 |- ( ( F C_ G /\ ( Fun F /\ A e. dom F ) ) -> <. A , ( F ` A ) >. e. G )
5		simpr 110	. . . . . 6 |- ( ( Fun F /\ A e. dom F ) -> A e. dom F )
6		sneq 3720	. . . . . . . . . 10 |- ( x = A -> { x } = { A } )
7	6	imaeq2d 5126	. . . . . . . . 9 |- ( x = A -> ( G " { x } ) = ( G " { A } ) )
8	7	eleq2d 2308	. . . . . . . 8 |- ( x = A -> ( ( F ` A ) e. ( G " { x } ) <-> ( F ` A ) e. ( G " { A } ) ) )
9		opeq1 3904	. . . . . . . . 9 |- ( x = A -> <. x , ( F ` A ) >. = <. A , ( F ` A ) >. )
10	9	eleq1d 2307	. . . . . . . 8 |- ( x = A -> ( <. x , ( F ` A ) >. e. G <-> <. A , ( F ` A ) >. e. G ) )
11	8, 10	bibi12d 235	. . . . . . 7 |- ( x = A -> ( ( ( F ` A ) e. ( G " { x } ) <-> <. x , ( F ` A ) >. e. G ) <-> ( ( F ` A ) e. ( G " { A } ) <-> <. A , ( F ` A ) >. e. G ) ) )
12	11	adantl 277	. . . . . 6 |- ( ( ( Fun F /\ A e. dom F ) /\ x = A ) -> ( ( ( F ` A ) e. ( G " { x } ) <-> <. x , ( F ` A ) >. e. G ) <-> ( ( F ` A ) e. ( G " { A } ) <-> <. A , ( F ` A ) >. e. G ) ) )
13		vex 2824	. . . . . . 7 |- x e. _V
14		funfvex 5712	. . . . . . 7 |- ( ( Fun F /\ A e. dom F ) -> ( F ` A ) e. _V )
15		elimasng 5155	. . . . . . 7 |- ( ( x e. _V /\ ( F ` A ) e. _V ) -> ( ( F ` A ) e. ( G " { x } ) <-> <. x , ( F ` A ) >. e. G ) )
16	13, 14, 15	sylancr 418	. . . . . 6 |- ( ( Fun F /\ A e. dom F ) -> ( ( F ` A ) e. ( G " { x } ) <-> <. x , ( F ` A ) >. e. G ) )
17	5, 12, 16	vtocld 2875	. . . . 5 |- ( ( Fun F /\ A e. dom F ) -> ( ( F ` A ) e. ( G " { A } ) <-> <. A , ( F ` A ) >. e. G ) )
18	17	adantl 277	. . . 4 |- ( ( F C_ G /\ ( Fun F /\ A e. dom F ) ) -> ( ( F ` A ) e. ( G " { A } ) <-> <. A , ( F ` A ) >. e. G ) )
19	4, 18	mpbird 167	. . 3 |- ( ( F C_ G /\ ( Fun F /\ A e. dom F ) ) -> ( F ` A ) e. ( G " { A } ) )
20	19	exp32 365	. 2 |- ( F C_ G -> ( Fun F -> ( A e. dom F -> ( F ` A ) e. ( G " { A } ) ) ) )
21	20	impcom 125	1 |- ( ( Fun F /\ F C_ G ) -> ( A e. dom F -> ( F ` A ) e. ( G " { A } ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   _Vcvv 2821   C_ wss 3220   {csn 3709   <.cop 3712   dom cdm 4774   "cima 4777   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-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385

This theorem is used by: (None)