Theorem resdif 5475

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 ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐶 ∖ 𝐷))

Proof of Theorem resdif

Step	Hyp	Ref	Expression
1		fofun 5431	. . . . . 6 ⊢ ((𝐹 ↾ 𝐴):𝐴–onto→𝐶 → Fun (𝐹 ↾ 𝐴))
2		difss 3259	. . . . . . 7 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴
3		fof 5430	. . . . . . . 8 ⊢ ((𝐹 ↾ 𝐴):𝐴–onto→𝐶 → (𝐹 ↾ 𝐴):𝐴⟶𝐶)
4		fdm 5363	. . . . . . . 8 ⊢ ((𝐹 ↾ 𝐴):𝐴⟶𝐶 → dom (𝐹 ↾ 𝐴) = 𝐴)
5	3, 4	syl 14	. . . . . . 7 ⊢ ((𝐹 ↾ 𝐴):𝐴–onto→𝐶 → dom (𝐹 ↾ 𝐴) = 𝐴)
6	2, 5	sseqtrrid 3204	. . . . . 6 ⊢ ((𝐹 ↾ 𝐴):𝐴–onto→𝐶 → (𝐴 ∖ 𝐵) ⊆ dom (𝐹 ↾ 𝐴))
7		fores 5439	. . . . . 6 ⊢ ((Fun (𝐹 ↾ 𝐴) ∧ (𝐴 ∖ 𝐵) ⊆ dom (𝐹 ↾ 𝐴)) → ((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)))
8	1, 6, 7	syl2anc 411	. . . . 5 ⊢ ((𝐹 ↾ 𝐴):𝐴–onto→𝐶 → ((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)))
9		resres 4912	. . . . . . . 8 ⊢ ((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵)) = (𝐹 ↾ (𝐴 ∩ (𝐴 ∖ 𝐵)))
10		indif 3376	. . . . . . . . 9 ⊢ (𝐴 ∩ (𝐴 ∖ 𝐵)) = (𝐴 ∖ 𝐵)
11	10	reseq2i 4897	. . . . . . . 8 ⊢ (𝐹 ↾ (𝐴 ∩ (𝐴 ∖ 𝐵))) = (𝐹 ↾ (𝐴 ∖ 𝐵))
12	9, 11	eqtri 2196	. . . . . . 7 ⊢ ((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵)) = (𝐹 ↾ (𝐴 ∖ 𝐵))
13		foeq1 5426	. . . . . . 7 ⊢ (((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵)) = (𝐹 ↾ (𝐴 ∖ 𝐵)) → (((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)) ↔ (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵))))
14	12, 13	ax-mp 5	. . . . . 6 ⊢ (((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)) ↔ (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)))
15	12	rneqi 4848	. . . . . . . 8 ⊢ ran ((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵)) = ran (𝐹 ↾ (𝐴 ∖ 𝐵))
16		df-ima 4633	. . . . . . . 8 ⊢ ((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)) = ran ((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵))
17		df-ima 4633	. . . . . . . 8 ⊢ (𝐹 “ (𝐴 ∖ 𝐵)) = ran (𝐹 ↾ (𝐴 ∖ 𝐵))
18	15, 16, 17	3eqtr4i 2206	. . . . . . 7 ⊢ ((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)) = (𝐹 “ (𝐴 ∖ 𝐵))
19		foeq3 5428	. . . . . . 7 ⊢ (((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)) = (𝐹 “ (𝐴 ∖ 𝐵)) → ((𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)) ↔ (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→(𝐹 “ (𝐴 ∖ 𝐵))))
20	18, 19	ax-mp 5	. . . . . 6 ⊢ ((𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)) ↔ (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→(𝐹 “ (𝐴 ∖ 𝐵)))
21	14, 20	bitri 184	. . . . 5 ⊢ (((𝐹 ↾ 𝐴) ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→((𝐹 ↾ 𝐴) “ (𝐴 ∖ 𝐵)) ↔ (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→(𝐹 “ (𝐴 ∖ 𝐵)))
22	8, 21	sylib 122	. . . 4 ⊢ ((𝐹 ↾ 𝐴):𝐴–onto→𝐶 → (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→(𝐹 “ (𝐴 ∖ 𝐵)))
23		funres11 5280	. . . 4 ⊢ (Fun ◡𝐹 → Fun ◡(𝐹 ↾ (𝐴 ∖ 𝐵)))
24		dff1o3 5459	. . . . 5 ⊢ ((𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐹 “ (𝐴 ∖ 𝐵)) ↔ ((𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→(𝐹 “ (𝐴 ∖ 𝐵)) ∧ Fun ◡(𝐹 ↾ (𝐴 ∖ 𝐵))))
25	24	biimpri 133	. . . 4 ⊢ (((𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→(𝐹 “ (𝐴 ∖ 𝐵)) ∧ Fun ◡(𝐹 ↾ (𝐴 ∖ 𝐵))) → (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐹 “ (𝐴 ∖ 𝐵)))
26	22, 23, 25	syl2anr 290	. . 3 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶) → (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐹 “ (𝐴 ∖ 𝐵)))
27	26	3adant3 1017	. 2 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐹 “ (𝐴 ∖ 𝐵)))
28		df-ima 4633	. . . . . . 7 ⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
29		forn 5433	. . . . . . 7 ⊢ ((𝐹 ↾ 𝐴):𝐴–onto→𝐶 → ran (𝐹 ↾ 𝐴) = 𝐶)
30	28, 29	eqtrid 2220	. . . . . 6 ⊢ ((𝐹 ↾ 𝐴):𝐴–onto→𝐶 → (𝐹 “ 𝐴) = 𝐶)
31		df-ima 4633	. . . . . . 7 ⊢ (𝐹 “ 𝐵) = ran (𝐹 ↾ 𝐵)
32		forn 5433	. . . . . . 7 ⊢ ((𝐹 ↾ 𝐵):𝐵–onto→𝐷 → ran (𝐹 ↾ 𝐵) = 𝐷)
33	31, 32	eqtrid 2220	. . . . . 6 ⊢ ((𝐹 ↾ 𝐵):𝐵–onto→𝐷 → (𝐹 “ 𝐵) = 𝐷)
34	30, 33	anim12i 338	. . . . 5 ⊢ (((𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → ((𝐹 “ 𝐴) = 𝐶 ∧ (𝐹 “ 𝐵) = 𝐷))
35		imadif 5288	. . . . . 6 ⊢ (Fun ◡𝐹 → (𝐹 “ (𝐴 ∖ 𝐵)) = ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)))
36		difeq12 3246	. . . . . 6 ⊢ (((𝐹 “ 𝐴) = 𝐶 ∧ (𝐹 “ 𝐵) = 𝐷) → ((𝐹 “ 𝐴) ∖ (𝐹 “ 𝐵)) = (𝐶 ∖ 𝐷))
37	35, 36	sylan9eq 2228	. . . . 5 ⊢ ((Fun ◡𝐹 ∧ ((𝐹 “ 𝐴) = 𝐶 ∧ (𝐹 “ 𝐵) = 𝐷)) → (𝐹 “ (𝐴 ∖ 𝐵)) = (𝐶 ∖ 𝐷))
38	34, 37	sylan2 286	. . . 4 ⊢ ((Fun ◡𝐹 ∧ ((𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷)) → (𝐹 “ (𝐴 ∖ 𝐵)) = (𝐶 ∖ 𝐷))
39	38	3impb 1199	. . 3 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → (𝐹 “ (𝐴 ∖ 𝐵)) = (𝐶 ∖ 𝐷))
40		f1oeq3 5443	. . 3 ⊢ ((𝐹 “ (𝐴 ∖ 𝐵)) = (𝐶 ∖ 𝐷) → ((𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐹 “ (𝐴 ∖ 𝐵)) ↔ (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐶 ∖ 𝐷)))
41	39, 40	syl 14	. 2 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → ((𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐹 “ (𝐴 ∖ 𝐵)) ↔ (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐶 ∖ 𝐷)))
42	27, 41	mpbid 147	1 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐶 ∖ 𝐷))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 978   = wceq 1353   ∖ cdif 3124   ∩ cin 3126   ⊆ wss 3127  ^◡ccnv 4619  dom cdm 4620  ran crn 4621   ↾ cres 4622   “ cima 4623  Fun wfun 5202  ⟶wf 5204  –onto→wfo 5206  –1-1-onto→wf1o 5207

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-in1 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-rab 2462  df-v 2737  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-br 3999  df-opab 4060  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-fun 5210  df-fn 5211  df-f 5212  df-f1 5213  df-fo 5214  df-f1o 5215

This theorem is referenced by:  dif1en  6869