Theorem resdif 5848

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 5807	. . . . . 6 |- ( ( F |` A ) : A -onto-> C -> Fun ( F |` A ) )
2		difss 3549	. . . . . . 7 |- ( A \ B ) C_ A
3		fof 5806	. . . . . . . 8 |- ( ( F |` A ) : A -onto-> C -> ( F |` A ) : A --> C )
4		fdm 5745	. . . . . . . 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 3467	. . . . . 6 |- ( ( F |` A ) : A -onto-> C -> ( A \ B ) C_ dom ( F |` A ) )
7		fores 5815	. . . . . 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 673	. . . . 5 |- ( ( F |` A ) : A -onto-> C -> ( ( F |` A ) |` ( A \ B ) ) : ( A \ B ) -onto-> ( ( F |` A ) " ( A \ B ) ) )
9		resres 5123	. . . . . . . 8 |- ( ( F |` A ) |` ( A \ B ) ) = ( F |` ( A i^i ( A \ B ) ) )
10		indif 3676	. . . . . . . . 9 |- ( A i^i ( A \ B ) ) = ( A \ B )
11	10	reseq2i 5108	. . . . . . . 8 |- ( F |` ( A i^i ( A \ B ) ) ) = ( F |` ( A \ B ) )
12	9, 11	eqtri 2493	. . . . . . 7 |- ( ( F |` A ) |` ( A \ B ) ) = ( F |` ( A \ B ) )
13		foeq1 5802	. . . . . . 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 5067	. . . . . . . 8 |- ran ( ( F |` A ) |` ( A \ B ) ) = ran ( F |` ( A \ B ) )
16		df-ima 4852	. . . . . . . 8 |- ( ( F |` A ) " ( A \ B ) ) = ran ( ( F |` A ) |` ( A \ B ) )
17		df-ima 4852	. . . . . . . 8 |- ( F " ( A \ B ) ) = ran ( F |` ( A \ B ) )
18	15, 16, 17	3eqtr4i 2503	. . . . . . 7 |- ( ( F |` A ) " ( A \ B ) ) = ( F " ( A \ B ) )
19		foeq3 5804	. . . . . . 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 257	. . . . 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 201	. . . 4 |- ( ( F |` A ) : A -onto-> C -> ( F |` ( A \ B ) ) : ( A \ B ) -onto-> ( F " ( A \ B ) ) )
23		funres11 5661	. . . 4 |- ( Fun `' F -> Fun `' ( F |` ( A \ B ) ) )
24		dff1o3 5834	. . . . 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 211	. . . 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 486	. . 3 |- ( ( Fun `' F /\ ( F |` A ) : A -onto-> C ) -> ( F |` ( A \ B ) ) : ( A \ B ) -1-1-onto-> ( F " ( A \ B ) ) )
27	26	3adant3 1050	. 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 4852	. . . . . . 7 |- ( F " A ) = ran ( F |` A )
29		forn 5809	. . . . . . 7 |- ( ( F |` A ) : A -onto-> C -> ran ( F |` A ) = C )
30	28, 29	syl5eq 2517	. . . . . 6 |- ( ( F |` A ) : A -onto-> C -> ( F " A ) = C )
31		df-ima 4852	. . . . . . 7 |- ( F " B ) = ran ( F |` B )
32		forn 5809	. . . . . . 7 |- ( ( F |` B ) : B -onto-> D -> ran ( F |` B ) = D )
33	31, 32	syl5eq 2517	. . . . . 6 |- ( ( F |` B ) : B -onto-> D -> ( F " B ) = D )
34	30, 33	anim12i 576	. . . . 5 |- ( ( ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) -> ( ( F " A ) = C /\ ( F " B ) = D ) )
35		imadif 5668	. . . . . 6 |- ( Fun `' F -> ( F " ( A \ B ) ) = ( ( F " A ) \ ( F " B ) ) )
36		difeq12 3535	. . . . . 6 |- ( ( ( F " A ) = C /\ ( F " B ) = D ) -> ( ( F " A ) \ ( F " B ) ) = ( C \ D ) )
37	35, 36	sylan9eq 2525	. . . . 5 |- ( ( Fun `' F /\ ( ( F " A ) = C /\ ( F " B ) = D ) ) -> ( F " ( A \ B ) ) = ( C \ D ) )
38	34, 37	sylan2 482	. . . 4 |- ( ( Fun `' F /\ ( ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) ) -> ( F " ( A \ B ) ) = ( C \ D ) )
39	38	3impb 1227	. . 3 |- ( ( Fun `' F /\ ( F |` A ) : A -onto-> C /\ ( F |` B ) : B -onto-> D ) -> ( F " ( A \ B ) ) = ( C \ D ) )
40		f1oeq3 5820	. . 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 215	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 189   /\ wa 376   /\ w3a 1007   = wceq 1452   \ cdif 3387   i^i cin 3389   C_ wss 3390   `'ccnv 4838   dom cdm 4839   ran crn 4840   |` cres 4841   "cima 4842   Fun wfun 5583   -->wf 5585   -onto->wfo 5587   -1-1-onto->wf1o 5588

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-9 1913  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-sep 4518  ax-nul 4527  ax-pr 4639

This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-mo 2324  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-ral 2761  df-rex 2762  df-rab 2765  df-v 3033  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-nul 3723  df-if 3873  df-sn 3960  df-pr 3962  df-op 3966  df-br 4396  df-opab 4455  df-id 4754  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850  df-res 4851  df-ima 4852  df-fun 5591  df-fn 5592  df-f 5593  df-f1 5594  df-fo 5595  df-f1o 5596

This theorem is referenced by:  resin  5849  canthp1lem2  9096  subfacp1lem3  29977  subfacp1lem5  29979