Theorem fnressn 5744

Description: A function restricted to a singleton. (Contributed by NM, 9-Oct-2004.)

Assertion

Ref	Expression
fnressn	|- ( ( F Fn A /\ B e. A ) -> ( F |` { B } ) = { <. B , ( F ` B ) >. } )

Proof of Theorem fnressn

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sneq 3629	. . . . . 6 |- ( x = B -> { x } = { B } )
2	1	reseq2d 4942	. . . . 5 |- ( x = B -> ( F |` { x } ) = ( F |` { B } ) )
3		fveq2 5554	. . . . . . 7 |- ( x = B -> ( F ` x ) = ( F ` B ) )
4		opeq12 3806	. . . . . . 7 |- ( ( x = B /\ ( F ` x ) = ( F ` B ) ) -> <. x , ( F ` x ) >. = <. B , ( F ` B ) >. )
5	3, 4	mpdan 421	. . . . . 6 |- ( x = B -> <. x , ( F ` x ) >. = <. B , ( F ` B ) >. )
6	5	sneqd 3631	. . . . 5 |- ( x = B -> { <. x , ( F ` x ) >. } = { <. B , ( F ` B ) >. } )
7	2, 6	eqeq12d 2208	. . . 4 |- ( x = B -> ( ( F |` { x } ) = { <. x , ( F ` x ) >. } <-> ( F |` { B } ) = { <. B , ( F ` B ) >. } ) )
8	7	imbi2d 230	. . 3 |- ( x = B -> ( ( F Fn A -> ( F |` { x } ) = { <. x , ( F ` x ) >. } ) <-> ( F Fn A -> ( F |` { B } ) = { <. B , ( F ` B ) >. } ) ) )
9		vex 2763	. . . . . . 7 |- x e. _V
10	9	snss 3753	. . . . . 6 |- ( x e. A <-> { x } C_ A )
11		fnssres 5367	. . . . . 6 |- ( ( F Fn A /\ { x } C_ A ) -> ( F |` { x } ) Fn { x } )
12	10, 11	sylan2b 287	. . . . 5 |- ( ( F Fn A /\ x e. A ) -> ( F |` { x } ) Fn { x } )
13		dffn2 5405	. . . . . . 7 |- ( ( F |` { x } ) Fn { x } <-> ( F |` { x } ) : { x } --> _V )
14	9	fsn2 5732	. . . . . . 7 |- ( ( F |` { x } ) : { x } --> _V <-> ( ( ( F |` { x } ) ` x ) e. _V /\ ( F |` { x } ) = { <. x , ( ( F |` { x } ) ` x ) >. } ) )
15	13, 14	bitri 184	. . . . . 6 |- ( ( F |` { x } ) Fn { x } <-> ( ( ( F |` { x } ) ` x ) e. _V /\ ( F |` { x } ) = { <. x , ( ( F |` { x } ) ` x ) >. } ) )
16		snssi 3762	. . . . . . . . . 10 |- ( x e. A -> { x } C_ A )
17	16, 11	sylan2 286	. . . . . . . . 9 |- ( ( F Fn A /\ x e. A ) -> ( F |` { x } ) Fn { x } )
18		vsnid 3650	. . . . . . . . 9 |- x e. { x }
19		funfvex 5571	. . . . . . . . . 10 |- ( ( Fun ( F |` { x } ) /\ x e. dom ( F |` { x } ) ) -> ( ( F |` { x } ) ` x ) e. _V )
20	19	funfni 5354	. . . . . . . . 9 |- ( ( ( F |` { x } ) Fn { x } /\ x e. { x } ) -> ( ( F |` { x } ) ` x ) e. _V )
21	17, 18, 20	sylancl 413	. . . . . . . 8 |- ( ( F Fn A /\ x e. A ) -> ( ( F |` { x } ) ` x ) e. _V )
22	21	biantrurd 305	. . . . . . 7 |- ( ( F Fn A /\ x e. A ) -> ( ( F |` { x } ) = { <. x , ( ( F |` { x } ) ` x ) >. } <-> ( ( ( F |` { x } ) ` x ) e. _V /\ ( F |` { x } ) = { <. x , ( ( F |` { x } ) ` x ) >. } ) ) )
23		fvres 5578	. . . . . . . . . . 11 |- ( x e. { x } -> ( ( F |` { x } ) ` x ) = ( F ` x ) )
24	18, 23	ax-mp 5	. . . . . . . . . 10 |- ( ( F |` { x } ) ` x ) = ( F ` x )
25	24	opeq2i 3808	. . . . . . . . 9 |- <. x , ( ( F |` { x } ) ` x ) >. = <. x , ( F ` x ) >.
26	25	sneqi 3630	. . . . . . . 8 |- { <. x , ( ( F |` { x } ) ` x ) >. } = { <. x , ( F ` x ) >. }
27	26	eqeq2i 2204	. . . . . . 7 |- ( ( F |` { x } ) = { <. x , ( ( F |` { x } ) ` x ) >. } <-> ( F |` { x } ) = { <. x , ( F ` x ) >. } )
28	22, 27	bitr3di 195	. . . . . 6 |- ( ( F Fn A /\ x e. A ) -> ( ( ( ( F |` { x } ) ` x ) e. _V /\ ( F |` { x } ) = { <. x , ( ( F |` { x } ) ` x ) >. } ) <-> ( F |` { x } ) = { <. x , ( F ` x ) >. } ) )
29	15, 28	bitrid 192	. . . . 5 |- ( ( F Fn A /\ x e. A ) -> ( ( F |` { x } ) Fn { x } <-> ( F |` { x } ) = { <. x , ( F ` x ) >. } ) )
30	12, 29	mpbid 147	. . . 4 |- ( ( F Fn A /\ x e. A ) -> ( F |` { x } ) = { <. x , ( F ` x ) >. } )
31	30	expcom 116	. . 3 |- ( x e. A -> ( F Fn A -> ( F |` { x } ) = { <. x , ( F ` x ) >. } ) )
32	8, 31	vtoclga 2826	. 2 |- ( B e. A -> ( F Fn A -> ( F |` { B } ) = { <. B , ( F ` B ) >. } ) )
33	32	impcom 125	1 |- ( ( F Fn A /\ B e. A ) -> ( F |` { B } ) = { <. B , ( F ` B ) >. } )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1364   e. wcel 2164   _Vcvv 2760   C_ wss 3153   {csn 3618   <.cop 3621   |` cres 4661   Fn wfn 5249   -->wf 5250   ` cfv 5254

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-v 2762  df-sbc 2986  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262

This theorem is referenced by:  fressnfv  5745  fnsnsplitss  5757  fnsnsplitdc  6558  dif1en  6935  fnfi  6995  fseq1p1m1  10160  resunimafz0  10902