Theorem resin 5308

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

Assertion

Ref	Expression
resin	⊢ ((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 resin

Step	Hyp	Ref	Expression
1		resdif 5307	. . . 4 ⊢ ((Fun ◡F ∧ (F ↾ A):A–onto→C ∧ (F ↾ B):B–onto→D) → (F ↾ (A ∖ B)):(A ∖ B)–1-1-onto→(C ∖ D))
2		f1ofo 5294	. . . 4 ⊢ ((F ↾ (A ∖ B)):(A ∖ B)–1-1-onto→(C ∖ D) → (F ↾ (A ∖ B)):(A ∖ B)–onto→(C ∖ D))
3	1, 2	syl 15	. . 3 ⊢ ((Fun ◡F ∧ (F ↾ A):A–onto→C ∧ (F ↾ B):B–onto→D) → (F ↾ (A ∖ B)):(A ∖ B)–onto→(C ∖ D))
4		resdif 5307	. . 3 ⊢ ((Fun ◡F ∧ (F ↾ A):A–onto→C ∧ (F ↾ (A ∖ B)):(A ∖ B)–onto→(C ∖ D)) → (F ↾ (A ∖ (A ∖ B))):(A ∖ (A ∖ B))–1-1-onto→(C ∖ (C ∖ D)))
5	3, 4	syld3an3 1227	. 2 ⊢ ((Fun ◡F ∧ (F ↾ A):A–onto→C ∧ (F ↾ B):B–onto→D) → (F ↾ (A ∖ (A ∖ B))):(A ∖ (A ∖ B))–1-1-onto→(C ∖ (C ∖ D)))
6		dfin4 3496	. . . 4 ⊢ (C ∩ D) = (C ∖ (C ∖ D))
7		f1oeq3 5284	. . . 4 ⊢ ((C ∩ D) = (C ∖ (C ∖ D)) → ((F ↾ (A ∩ B)):(A ∩ B)–1-1-onto→(C ∩ D) ↔ (F ↾ (A ∩ B)):(A ∩ B)–1-1-onto→(C ∖ (C ∖ D))))
8	6, 7	ax-mp 5	. . 3 ⊢ ((F ↾ (A ∩ B)):(A ∩ B)–1-1-onto→(C ∩ D) ↔ (F ↾ (A ∩ B)):(A ∩ B)–1-1-onto→(C ∖ (C ∖ D)))
9		dfin4 3496	. . . 4 ⊢ (A ∩ B) = (A ∖ (A ∖ B))
10		f1oeq2 5283	. . . 4 ⊢ ((A ∩ B) = (A ∖ (A ∖ B)) → ((F ↾ (A ∩ B)):(A ∩ B)–1-1-onto→(C ∖ (C ∖ D)) ↔ (F ↾ (A ∩ B)):(A ∖ (A ∖ B))–1-1-onto→(C ∖ (C ∖ D))))
11	9, 10	ax-mp 5	. . 3 ⊢ ((F ↾ (A ∩ B)):(A ∩ B)–1-1-onto→(C ∖ (C ∖ D)) ↔ (F ↾ (A ∩ B)):(A ∖ (A ∖ B))–1-1-onto→(C ∖ (C ∖ D)))
12	9	reseq2i 4932	. . . 4 ⊢ (F ↾ (A ∩ B)) = (F ↾ (A ∖ (A ∖ B)))
13		f1oeq1 5282	. . . 4 ⊢ ((F ↾ (A ∩ B)) = (F ↾ (A ∖ (A ∖ B))) → ((F ↾ (A ∩ B)):(A ∖ (A ∖ B))–1-1-onto→(C ∖ (C ∖ D)) ↔ (F ↾ (A ∖ (A ∖ B))):(A ∖ (A ∖ B))–1-1-onto→(C ∖ (C ∖ D))))
14	12, 13	ax-mp 5	. . 3 ⊢ ((F ↾ (A ∩ B)):(A ∖ (A ∖ B))–1-1-onto→(C ∖ (C ∖ D)) ↔ (F ↾ (A ∖ (A ∖ B))):(A ∖ (A ∖ B))–1-1-onto→(C ∖ (C ∖ D)))
15	8, 11, 14	3bitrri 263	. 2 ⊢ ((F ↾ (A ∖ (A ∖ B))):(A ∖ (A ∖ B))–1-1-onto→(C ∖ (C ∖ D)) ↔ (F ↾ (A ∩ B)):(A ∩ B)–1-1-onto→(C ∩ D))
16	5, 15	sylib 188	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   ∧ w3a 934   = wceq 1642   ∖ cdif 3207   ∩ cin 3209  ^◡ccnv 4772   ↾ cres 4775  Fun wfun 4776  –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: (None)