Theorem ffvresb 5455

Description: A necessary and sufficient condition for a restricted function. (Contributed by Mario Carneiro, 14-Nov-2013.)

Assertion

Ref	Expression
ffvresb	|- ( Fun F -> ( ( F |` A ) : A --> B <-> A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) )

Distinct variable groups:   x, A   x, B   x, F

Proof of Theorem ffvresb

Step	Hyp	Ref	Expression
1		fdm 5160	. . . . . 6 |- ( ( F |` A ) : A --> B -> dom ( F |` A ) = A )
2		dmres 4729	. . . . . . 7 |- dom ( F |` A ) = ( A i^i dom F )
3		inss2 3221	. . . . . . 7 |- ( A i^i dom F ) C_ dom F
4	2, 3	eqsstri 3056	. . . . . 6 |- dom ( F |` A ) C_ dom F
5	1, 4	syl6eqssr 3077	. . . . 5 |- ( ( F |` A ) : A --> B -> A C_ dom F )
6	5	sselda 3025	. . . 4 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> x e. dom F )
7		fvres 5323	. . . . . 6 |- ( x e. A -> ( ( F |` A ) ` x ) = ( F ` x ) )
8	7	adantl 271	. . . . 5 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> ( ( F |` A ) ` x ) = ( F ` x ) )
9		ffvelrn 5426	. . . . 5 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> ( ( F |` A ) ` x ) e. B )
10	8, 9	eqeltrrd 2165	. . . 4 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> ( F ` x ) e. B )
11	6, 10	jca 300	. . 3 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> ( x e. dom F /\ ( F ` x ) e. B ) )
12	11	ralrimiva 2446	. 2 |- ( ( F |` A ) : A --> B -> A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) )
13		simpl 107	. . . . . . 7 |- ( ( x e. dom F /\ ( F ` x ) e. B ) -> x e. dom F )
14	13	ralimi 2438	. . . . . 6 |- ( A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) -> A. x e. A x e. dom F )
15		dfss3 3015	. . . . . 6 |- ( A C_ dom F <-> A. x e. A x e. dom F )
16	14, 15	sylibr 132	. . . . 5 |- ( A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) -> A C_ dom F )
17		funfn 5039	. . . . . 6 |- ( Fun F <-> F Fn dom F )
18		fnssres 5121	. . . . . 6 |- ( ( F Fn dom F /\ A C_ dom F ) -> ( F |` A ) Fn A )
19	17, 18	sylanb 278	. . . . 5 |- ( ( Fun F /\ A C_ dom F ) -> ( F |` A ) Fn A )
20	16, 19	sylan2 280	. . . 4 |- ( ( Fun F /\ A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) -> ( F |` A ) Fn A )
21		simpr 108	. . . . . . . 8 |- ( ( x e. dom F /\ ( F ` x ) e. B ) -> ( F ` x ) e. B )
22	7	eleq1d 2156	. . . . . . . 8 |- ( x e. A -> ( ( ( F |` A ) ` x ) e. B <-> ( F ` x ) e. B ) )
23	21, 22	syl5ibr 154	. . . . . . 7 |- ( x e. A -> ( ( x e. dom F /\ ( F ` x ) e. B ) -> ( ( F |` A ) ` x ) e. B ) )
24	23	ralimia 2436	. . . . . 6 |- ( A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) -> A. x e. A ( ( F |` A ) ` x ) e. B )
25	24	adantl 271	. . . . 5 |- ( ( Fun F /\ A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) -> A. x e. A ( ( F |` A ) ` x ) e. B )
26		fnfvrnss 5452	. . . . 5 |- ( ( ( F |` A ) Fn A /\ A. x e. A ( ( F |` A ) ` x ) e. B ) -> ran ( F |` A ) C_ B )
27	20, 25, 26	syl2anc 403	. . . 4 |- ( ( Fun F /\ A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) -> ran ( F |` A ) C_ B )
28		df-f 5014	. . . 4 |- ( ( F |` A ) : A --> B <-> ( ( F |` A ) Fn A /\ ran ( F |` A ) C_ B ) )
29	20, 27, 28	sylanbrc 408	. . 3 |- ( ( Fun F /\ A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) -> ( F |` A ) : A --> B )
30	29	ex 113	. 2 |- ( Fun F -> ( A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) -> ( F |` A ) : A --> B ) )
31	12, 30	impbid2 141	1 |- ( Fun F -> ( ( F |` A ) : A --> B <-> A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) )

Syntax hints:   -> wi 4   /\ wa 102   <-> wb 103   = wceq 1289   e. wcel 1438   A.wral 2359   i^i cin 2998   C_ wss 2999   dom cdm 4436   ran crn 4437   |` cres 4438   Fun wfun 5004   Fn wfn 5005   -->wf 5006   ` cfv 5010

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3955  ax-pow 4007  ax-pr 4034

This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ral 2364  df-rex 2365  df-v 2621  df-sbc 2841  df-un 3003  df-in 3005  df-ss 3012  df-pw 3429  df-sn 3450  df-pr 3451  df-op 3453  df-uni 3652  df-br 3844  df-opab 3898  df-mpt 3899  df-id 4118  df-xp 4442  df-rel 4443  df-cnv 4444  df-co 4445  df-dm 4446  df-rn 4447  df-res 4448  df-iota 4975  df-fun 5012  df-fn 5013  df-f 5014  df-fv 5018

This theorem is referenced by:  resflem  5456  tfrcl  6121  frecfcllem  6161