Theorem resin 6636

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

Proof of Theorem resin

Step	Hyp	Ref	Expression
1		resdif 6635	. . . 4 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐶 ∖ 𝐷))
2		f1ofo 6622	. . . 4 ⊢ ((𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–1-1-onto→(𝐶 ∖ 𝐷) → (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→(𝐶 ∖ 𝐷))
3	1, 2	syl 17	. . 3 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→(𝐶 ∖ 𝐷))
4		resdif 6635	. . 3 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ (𝐴 ∖ 𝐵)):(𝐴 ∖ 𝐵)–onto→(𝐶 ∖ 𝐷)) → (𝐹 ↾ (𝐴 ∖ (𝐴 ∖ 𝐵))):(𝐴 ∖ (𝐴 ∖ 𝐵))–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)))
5	3, 4	syld3an3 1405	. 2 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → (𝐹 ↾ (𝐴 ∖ (𝐴 ∖ 𝐵))):(𝐴 ∖ (𝐴 ∖ 𝐵))–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)))
6		dfin4 4244	. . . 4 ⊢ (𝐶 ∩ 𝐷) = (𝐶 ∖ (𝐶 ∖ 𝐷))
7		f1oeq3 6606	. . . 4 ⊢ ((𝐶 ∩ 𝐷) = (𝐶 ∖ (𝐶 ∖ 𝐷)) → ((𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∩ 𝐵)–1-1-onto→(𝐶 ∩ 𝐷) ↔ (𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∩ 𝐵)–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷))))
8	6, 7	ax-mp 5	. . 3 ⊢ ((𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∩ 𝐵)–1-1-onto→(𝐶 ∩ 𝐷) ↔ (𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∩ 𝐵)–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)))
9		dfin4 4244	. . . 4 ⊢ (𝐴 ∩ 𝐵) = (𝐴 ∖ (𝐴 ∖ 𝐵))
10		f1oeq2 6605	. . . 4 ⊢ ((𝐴 ∩ 𝐵) = (𝐴 ∖ (𝐴 ∖ 𝐵)) → ((𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∩ 𝐵)–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)) ↔ (𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∖ (𝐴 ∖ 𝐵))–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷))))
11	9, 10	ax-mp 5	. . 3 ⊢ ((𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∩ 𝐵)–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)) ↔ (𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∖ (𝐴 ∖ 𝐵))–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)))
12	9	reseq2i 5850	. . . 4 ⊢ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐹 ↾ (𝐴 ∖ (𝐴 ∖ 𝐵)))
13		f1oeq1 6604	. . . 4 ⊢ ((𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐹 ↾ (𝐴 ∖ (𝐴 ∖ 𝐵))) → ((𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∖ (𝐴 ∖ 𝐵))–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)) ↔ (𝐹 ↾ (𝐴 ∖ (𝐴 ∖ 𝐵))):(𝐴 ∖ (𝐴 ∖ 𝐵))–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷))))
14	12, 13	ax-mp 5	. . 3 ⊢ ((𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∖ (𝐴 ∖ 𝐵))–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)) ↔ (𝐹 ↾ (𝐴 ∖ (𝐴 ∖ 𝐵))):(𝐴 ∖ (𝐴 ∖ 𝐵))–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)))
15	8, 11, 14	3bitrri 300	. 2 ⊢ ((𝐹 ↾ (𝐴 ∖ (𝐴 ∖ 𝐵))):(𝐴 ∖ (𝐴 ∖ 𝐵))–1-1-onto→(𝐶 ∖ (𝐶 ∖ 𝐷)) ↔ (𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∩ 𝐵)–1-1-onto→(𝐶 ∩ 𝐷))
16	5, 15	sylib 220	1 ⊢ ((Fun ◡𝐹 ∧ (𝐹 ↾ 𝐴):𝐴–onto→𝐶 ∧ (𝐹 ↾ 𝐵):𝐵–onto→𝐷) → (𝐹 ↾ (𝐴 ∩ 𝐵)):(𝐴 ∩ 𝐵)–1-1-onto→(𝐶 ∩ 𝐷))

Syntax hints:   → wi 4   ↔ wb 208   ∧ w3a 1083   = wceq 1537   ∖ cdif 3933   ∩ cin 3935  ^◡ccnv 5554   ↾ cres 5557  Fun wfun 6349  –onto→wfo 6353  –1-1-onto→wf1o 6354

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-br 5067  df-opab 5129  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362

This theorem is referenced by: (None)