Theorem resdif 5832

Description: The restriction of a one-to-one onto function to a difference maps onto the difference of the images. (Contributed by Paul Chapman, 11-Apr-2009.)

Assertion

Ref	Expression
resdif	|- ( ( Fun `' F /\ ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) -> ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( C \ D ) )

Proof of Theorem resdif

Step	Hyp	Ref	Expression
1		fofun 5792	. . . . . 6 |- ( ( F |` A ) : A -onto-> C -> Fun ( F |` A ) )
2		difss 3559	. . . . . . 7 |- ( A \ B ) C_ A
3		fof 5791	. . . . . . . 8 |- ( ( F |` A ) : A -onto-> C -> ( F |` A ) : A --> C )
4		fdm 5731	. . . . . . . 8 |- ( ( F |` A ) : A --> C -> dom ( F |` A ) = A )
5	3, 4	syl 17	. . . . . . 7 |- ( ( F |` A ) : A -onto-> C -> dom ( F |` A ) = A )
6	2, 5	syl5sseqr 3480	. . . . . 6 |- ( ( F |` A ) : A -onto-> C -> ( A \ B ) C_ dom ( F |` A ) )
7		fores 5800	. . . . . 6 |- ( ( Fun ( F |` A ) /\ ( A \ B ) C_ dom ( F |` A ) ) -> ( ( F |` A ) |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) )
8	1, 6, 7	syl2anc 666	. . . . 5 |- ( ( F |` A ) : A -onto-> C -> ( ( F |` A ) |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) )
9		resres 5116	. . . . . . . 8 |- ( ( F |` A ) |` ( A \ B ) ) = ( F |` ( A i^i ( A \ B ) ) )
10		indif 3684	. . . . . . . . 9 |- ( A i^i ( A \ B ) ) = ( A \ B )
11	10	reseq2i 5101	. . . . . . . 8 |- ( F |` ( A i^i ( A \ B ) ) ) = ( F |` ( A \ B ) )
12	9, 11	eqtri 2472	. . . . . . 7 |- ( ( F |` A ) |` ( A \ B ) ) = ( F |` ( A \ B ) )
13		foeq1 5787	. . . . . . 7 |- ( ( ( F |` A ) |` ( A \ B ) ) = ( F |` ( A \ B ) ) -> ( ( ( F |` A ) |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) <-> ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) ) )
14	12, 13	ax-mp 5	. . . . . 6 |- ( ( ( F |` A ) |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) <-> ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) )
15	12	rneqi 5060	. . . . . . . 8 |- ran ( ( F |` A ) |` ( A \ B ) ) = ran ( F |` ( A \ B ) )
16		df-ima 4846	. . . . . . . 8 |- ( ( F |` A ) " ( A \ B ) ) = ran ( ( F |` A ) |` ( A \ B ) )
17		df-ima 4846	. . . . . . . 8 |- ( F " ( A \ B ) ) = ran ( F |` ( A \ B ) )
18	15, 16, 17	3eqtr4i 2482	. . . . . . 7 |- ( ( F |` A ) " ( A \ B ) ) = ( F " ( A \ B ) )
19		foeq3 5789	. . . . . . 7 |- ( ( ( F |` A ) " ( A \ B ) ) = ( F " ( A \ B ) ) -> ( ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) <-> ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( F " ( A \ B ) ) ) )
20	18, 19	ax-mp 5	. . . . . 6 |- ( ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) <-> ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( F " ( A \ B ) ) )
21	14, 20	bitri 253	. . . . 5 |- ( ( ( F |` A ) |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) <-> ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( F " ( A \ B ) ) )
22	8, 21	sylib 200	. . . 4 |- ( ( F |` A ) : A -onto-> C -> ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( F " ( A \ B ) ) )
23		funres11 5649	. . . 4 |- ( Fun `' F -> Fun `' ( F |` ( A \ B ) ) )
24		dff1o3 5818	. . . . 5 |- ( ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( F " ( A \ B ) ) <-> ( ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( F " ( A \ B ) ) /\ Fun `' ( F |` ( A \ B ) ) ) )
25	24	biimpri 210	. . . 4 |- ( ( ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( F " ( A \ B ) ) /\ Fun `' ( F |` ( A \ B ) ) ) -> ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( F " ( A \ B ) ) )
26	22, 23, 25	syl2anr 481	. . 3 |- ( ( Fun `' F /\ ( F |` A ) : A -onto-> C ) -> ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( F " ( A \ B ) ) )
27	26	3adant3 1027	. 2 |- ( ( Fun `' F /\ ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) -> ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( F " ( A \ B ) ) )
28		df-ima 4846	. . . . . . 7 |- ( F " A ) = ran ( F |` A )
29		forn 5794	. . . . . . 7 |- ( ( F |` A ) : A -onto-> C -> ran ( F |` A ) = C )
30	28, 29	syl5eq 2496	. . . . . 6 |- ( ( F |` A ) : A -onto-> C -> ( F " A ) = C )
31		df-ima 4846	. . . . . . 7 |- ( F " B ) = ran ( F |` B )
32		forn 5794	. . . . . . 7 |- ( ( F |` B ) : B -onto-> D -> ran ( F |` B ) = D )
33	31, 32	syl5eq 2496	. . . . . 6 |- ( ( F |` B ) : B -onto-> D -> ( F " B ) = D )
34	30, 33	anim12i 569	. . . . 5 |- ( ( ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) -> ( ( F " A ) = C /\ ( F " B ) = D ) )
35		imadif 5656	. . . . . 6 |- ( Fun `' F -> ( F " ( A \ B ) ) = ( ( F " A ) \ ( F " B ) ) )
36		difeq12 3545	. . . . . 6 |- ( ( ( F " A ) = C /\ ( F " B ) = D ) -> ( ( F " A ) \ ( F " B ) ) = ( C \ D ) )
37	35, 36	sylan9eq 2504	. . . . 5 |- ( ( Fun `' F /\ ( ( F " A ) = C /\ ( F " B ) = D ) ) -> ( F " ( A \ B ) ) = ( C \ D ) )
38	34, 37	sylan2 477	. . . 4 |- ( ( Fun `' F /\ ( ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) ) -> ( F " ( A \ B ) ) = ( C \ D ) )
39	38	3impb 1203	. . 3 |- ( ( Fun `' F /\ ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) -> ( F " ( A \ B ) ) = ( C \ D ) )
40		f1oeq3 5805	. . 3 |- ( ( F " ( A \ B ) ) = ( C \ D ) -> ( ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( F " ( A \ B ) ) <-> ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( C \ D ) ) )
41	39, 40	syl 17	. 2 |- ( ( Fun `' F /\ ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) -> ( ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( F " ( A \ B ) ) <-> ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( C \ D ) ) )
42	27, 41	mpbid 214	1 |- ( ( Fun `' F /\ ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) -> ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( C \ D ) )

Syntax hints:   -> wi 4   <-> wb 188   /\ wa 371   /\ w3a 984   = wceq 1443   \ cdif 3400   i^i cin 3402   C_ wss 3403   `'ccnv 4832   dom cdm 4833   ran crn 4834   |` cres 4835   "cima 4836   Fun wfun 5575   -->wf 5577   -onto->wfo 5579   -1-1-onto->wf1o 5580

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1668  ax-4 1681  ax-5 1757  ax-6 1804  ax-7 1850  ax-9 1895  ax-10 1914  ax-11 1919  ax-12 1932  ax-13 2090  ax-ext 2430  ax-sep 4524  ax-nul 4533  ax-pr 4638

This theorem depends on definitions:  df-bi 189  df-or 372  df-an 373  df-3an 986  df-tru 1446  df-ex 1663  df-nf 1667  df-sb 1797  df-eu 2302  df-mo 2303  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2580  df-ne 2623  df-ral 2741  df-rex 2742  df-rab 2745  df-v 3046  df-dif 3406  df-un 3408  df-in 3410  df-ss 3417  df-nul 3731  df-if 3881  df-sn 3968  df-pr 3970  df-op 3974  df-br 4402  df-opab 4461  df-id 4748  df-xp 4839  df-rel 4840  df-cnv 4841  df-co 4842  df-dm 4843  df-rn 4844  df-res 4845  df-ima 4846  df-fun 5583  df-fn 5584  df-f 5585  df-f1 5586  df-fo 5587  df-f1o 5588

This theorem is referenced by:  resin  5833  canthp1lem2  9075  subfacp1lem3  29898  subfacp1lem5  29900