Theorem resdif 5307

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 5271	. . . . . 6 ⊢ ((F ↾ A):A–onto→C → Fun (F ↾ A))
2		difss 3394	. . . . . . 7 ⊢ (A ∖ B) ⊆ A
3		fof 5270	. . . . . . . 8 ⊢ ((F ↾ A):A–onto→C → (F ↾ A):A–→C)
4		fdm 5227	. . . . . . . 8 ⊢ ((F ↾ A):A–→C → dom (F ↾ A) = A)
5	3, 4	syl 15	. . . . . . 7 ⊢ ((F ↾ A):A–onto→C → dom (F ↾ A) = A)
6	2, 5	syl5sseqr 3321	. . . . . 6 ⊢ ((F ↾ A):A–onto→C → (A ∖ B) ⊆ dom (F ↾ A))
7		fores 5279	. . . . . 6 ⊢ ((Fun (F ↾ A) ∧ (A ∖ B) ⊆ dom (F ↾ A)) → ((F ↾ A) ↾ (A ∖ B)):(A ∖ B)–onto→((F ↾ A) “ (A ∖ B)))
8	1, 6, 7	syl2anc 642	. . . . 5 ⊢ ((F ↾ A):A–onto→C → ((F ↾ A) ↾ (A ∖ B)):(A ∖ B)–onto→((F ↾ A) “ (A ∖ B)))
9		resabs1 4993	. . . . . . . 8 ⊢ ((A ∖ B) ⊆ A → ((F ↾ A) ↾ (A ∖ B)) = (F ↾ (A ∖ B)))
10	2, 9	ax-mp 5	. . . . . . 7 ⊢ ((F ↾ A) ↾ (A ∖ B)) = (F ↾ (A ∖ B))
11		foeq1 5266	. . . . . . 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))))
12	10, 11	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)))
13	10	rneqi 4958	. . . . . . . 8 ⊢ ran ((F ↾ A) ↾ (A ∖ B)) = ran (F ↾ (A ∖ B))
14		dfima3 4952	. . . . . . . 8 ⊢ ((F ↾ A) “ (A ∖ B)) = ran ((F ↾ A) ↾ (A ∖ B))
15		dfima3 4952	. . . . . . . 8 ⊢ (F “ (A ∖ B)) = ran (F ↾ (A ∖ B))
16	13, 14, 15	3eqtr4i 2383	. . . . . . 7 ⊢ ((F ↾ A) “ (A ∖ B)) = (F “ (A ∖ B))
17		foeq3 5268	. . . . . . 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))))
18	16, 17	ax-mp 5	. . . . . 6 ⊢ ((F ↾ (A ∖ B)):(A ∖ B)–onto→((F ↾ A) “ (A ∖ B)) ↔ (F ↾ (A ∖ B)):(A ∖ B)–onto→(F “ (A ∖ B)))
19	12, 18	bitri 240	. . . . 5 ⊢ (((F ↾ A) ↾ (A ∖ B)):(A ∖ B)–onto→((F ↾ A) “ (A ∖ B)) ↔ (F ↾ (A ∖ B)):(A ∖ B)–onto→(F “ (A ∖ B)))
20	8, 19	sylib 188	. . . 4 ⊢ ((F ↾ A):A–onto→C → (F ↾ (A ∖ B)):(A ∖ B)–onto→(F “ (A ∖ B)))
21		funres11 5165	. . . 4 ⊢ (Fun ◡F → Fun ◡(F ↾ (A ∖ B)))
22		dff1o3 5293	. . . . 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))))
23	22	biimpri 197	. . . 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)))
24	20, 21, 23	syl2anr 464	. . 3 ⊢ ((Fun ◡F ∧ (F ↾ A):A–onto→C) → (F ↾ (A ∖ B)):(A ∖ B)–1-1-onto→(F “ (A ∖ B)))
25	24	3adant3 975	. 2 ⊢ ((Fun ◡F ∧ (F ↾ A):A–onto→C ∧ (F ↾ B):B–onto→D) → (F ↾ (A ∖ B)):(A ∖ B)–1-1-onto→(F “ (A ∖ B)))
26		dfima3 4952	. . . . . . 7 ⊢ (F “ A) = ran (F ↾ A)
27		forn 5273	. . . . . . 7 ⊢ ((F ↾ A):A–onto→C → ran (F ↾ A) = C)
28	26, 27	syl5eq 2397	. . . . . 6 ⊢ ((F ↾ A):A–onto→C → (F “ A) = C)
29		dfima3 4952	. . . . . . 7 ⊢ (F “ B) = ran (F ↾ B)
30		forn 5273	. . . . . . 7 ⊢ ((F ↾ B):B–onto→D → ran (F ↾ B) = D)
31	29, 30	syl5eq 2397	. . . . . 6 ⊢ ((F ↾ B):B–onto→D → (F “ B) = D)
32	28, 31	anim12i 549	. . . . 5 ⊢ (((F ↾ A):A–onto→C ∧ (F ↾ B):B–onto→D) → ((F “ A) = C ∧ (F “ B) = D))
33		imadif 5172	. . . . . 6 ⊢ (Fun ◡F → (F “ (A ∖ B)) = ((F “ A) ∖ (F “ B)))
34		difeq12 3381	. . . . . 6 ⊢ (((F “ A) = C ∧ (F “ B) = D) → ((F “ A) ∖ (F “ B)) = (C ∖ D))
35	33, 34	sylan9eq 2405	. . . . 5 ⊢ ((Fun ◡F ∧ ((F “ A) = C ∧ (F “ B) = D)) → (F “ (A ∖ B)) = (C ∖ D))
36	32, 35	sylan2 460	. . . 4 ⊢ ((Fun ◡F ∧ ((F ↾ A):A–onto→C ∧ (F ↾ B):B–onto→D)) → (F “ (A ∖ B)) = (C ∖ D))
37	36	3impb 1147	. . 3 ⊢ ((Fun ◡F ∧ (F ↾ A):A–onto→C ∧ (F ↾ B):B–onto→D) → (F “ (A ∖ B)) = (C ∖ D))
38		f1oeq3 5284	. . 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)))
39	37, 38	syl 15	. 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)))
40	25, 39	mpbid 201	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 176   ∧ wa 358   ∧ w3a 934   = wceq 1642   ∖ cdif 3207   ⊆ wss 3258   “ cima 4723  ^◡ccnv 4772  dom cdm 4773  ran crn 4774   ↾ cres 4775  Fun wfun 4776  –→wf 4778  –onto→wfo 4780  –1-1-onto→wf1o 4781

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-reu 2622  df-rmo 2623  df-rab 2624  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-pss 3262  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-iota 4340  df-0c 4378  df-addc 4379  df-nnc 4380  df-fin 4381  df-lefin 4441  df-ltfin 4442  df-ncfin 4443  df-tfin 4444  df-evenfin 4445  df-oddfin 4446  df-sfin 4447  df-spfin 4448  df-phi 4566  df-op 4567  df-proj1 4568  df-proj2 4569  df-opab 4624  df-br 4641  df-co 4727  df-ima 4728  df-id 4768  df-xp 4785  df-cnv 4786  df-rn 4787  df-dm 4788  df-res 4789  df-fun 4790  df-fn 4791  df-f 4792  df-f1 4793  df-fo 4794  df-f1o 4795

This theorem is referenced by:  resin  5308