Theorem ffvresb 5871

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 5539	. . . . . 6 |- ( ( F |` A ) : A --> B -> dom ( F |` A ) = A )
2		dmres 5084	. . . . . . 7 |- dom ( F |` A ) = ( A i^i dom F )
3		inss2 3452	. . . . . . 7 |- ( A i^i dom F ) C_ dom F
4	2, 3	eqsstri 3280	. . . . . 6 |- dom ( F |` A ) C_ dom F
5	1, 4	eqsstrrdi 3301	. . . . 5 |- ( ( F |` A ) : A --> B -> A C_ dom F )
6	5	sselda 3248	. . . 4 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> x e. dom F )
7		fvres 5719	. . . . . 6 |- ( x e. A -> ( ( F |` A ) ` x ) = ( F ` x ) )
8	7	adantl 277	. . . . 5 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> ( ( F |` A ) ` x ) = ( F ` x ) )
9		ffvelcdm 5841	. . . . 5 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> ( ( F |` A ) ` x ) e. B )
10	8, 9	eqeltrrd 2316	. . . 4 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> ( F ` x ) e. B )
11	6, 10	jca 306	. . 3 |- ( ( ( F |` A ) : A --> B /\ x e. A ) -> ( x e. dom F /\ ( F ` x ) e. B ) )
12	11	ralrimiva 2623	. 2 |- ( ( F |` A ) : A --> B -> A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) )
13		simpl 109	. . . . . . 7 |- ( ( x e. dom F /\ ( F ` x ) e. B ) -> x e. dom F )
14	13	ralimi 2613	. . . . . 6 |- ( A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) -> A. x e. A x e. dom F )
15		dfss3 3236	. . . . . 6 |- ( A C_ dom F <-> A. x e. A x e. dom F )
16	14, 15	sylibr 134	. . . . 5 |- ( A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) -> A C_ dom F )
17		funfn 5407	. . . . . 6 |- ( Fun F <-> F Fn dom F )
18		fnssres 5496	. . . . . 6 |- ( ( F Fn dom F /\ A C_ dom F ) -> ( F |` A ) Fn A )
19	17, 18	sylanb 284	. . . . 5 |- ( ( Fun F /\ A C_ dom F ) -> ( F |` A ) Fn A )
20	16, 19	sylan2 286	. . . 4 |- ( ( Fun F /\ A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) -> ( F |` A ) Fn A )
21		simpr 110	. . . . . . . 8 |- ( ( x e. dom F /\ ( F ` x ) e. B ) -> ( F ` x ) e. B )
22	7	eleq1d 2307	. . . . . . . 8 |- ( x e. A -> ( ( ( F |` A ) ` x ) e. B <-> ( F ` x ) e. B ) )
23	21, 22	imbitrrid 156	. . . . . . 7 |- ( x e. A -> ( ( x e. dom F /\ ( F ` x ) e. B ) -> ( ( F |` A ) ` x ) e. B ) )
24	23	ralimia 2611	. . . . . 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 277	. . . . 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 5868	. . . . 5 |- ( ( ( F |` A ) Fn A /\ A. x e. A ( ( F |` A ) ` x ) e. B ) -> ran ( F |` A ) C_ B )
27	20, 25, 26	syl2anc 415	. . . 4 |- ( ( Fun F /\ A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) -> ran ( F |` A ) C_ B )
28		df-f 5381	. . . 4 |- ( ( F |` A ) : A --> B <-> ( ( F |` A ) Fn A /\ ran ( F |` A ) C_ B ) )
29	20, 27, 28	sylanbrc 421	. . 3 |- ( ( Fun F /\ A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) -> ( F |` A ) : A --> B )
30	29	ex 115	. 2 |- ( Fun F -> ( A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) -> ( F |` A ) : A --> B ) )
31	12, 30	impbid2 143	1 |- ( Fun F -> ( ( F |` A ) : A --> B <-> A. x e. A ( x e. dom F /\ ( F ` x ) e. B ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   i^i cin 3219   C_ wss 3220   dom cdm 4774   ran crn 4775   |` cres 4776   Fun wfun 5371   Fn wfn 5372   -->wf 5373   ` 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-mpt 4194  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-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385

This theorem is used by:  resflem  5872  tfrcl  6635  frecfcllem  6675  lmbr2  15315  lmff  15350