MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  resdif Structured version   Visualization version   GIF version

Theorem resdif 6720
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
StepHypRef Expression
1 fofun 6673 . . . . . 6 ((𝐹𝐴):𝐴onto𝐶 → Fun (𝐹𝐴))
2 difss 4062 . . . . . . 7 (𝐴𝐵) ⊆ 𝐴
3 fof 6672 . . . . . . . 8 ((𝐹𝐴):𝐴onto𝐶 → (𝐹𝐴):𝐴𝐶)
43fdmd 6595 . . . . . . 7 ((𝐹𝐴):𝐴onto𝐶 → dom (𝐹𝐴) = 𝐴)
52, 4sseqtrrid 3970 . . . . . 6 ((𝐹𝐴):𝐴onto𝐶 → (𝐴𝐵) ⊆ dom (𝐹𝐴))
6 fores 6682 . . . . . 6 ((Fun (𝐹𝐴) ∧ (𝐴𝐵) ⊆ dom (𝐹𝐴)) → ((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)))
71, 5, 6syl2anc 583 . . . . 5 ((𝐹𝐴):𝐴onto𝐶 → ((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)))
8 resres 5893 . . . . . . . 8 ((𝐹𝐴) ↾ (𝐴𝐵)) = (𝐹 ↾ (𝐴 ∩ (𝐴𝐵)))
9 indif 4200 . . . . . . . . 9 (𝐴 ∩ (𝐴𝐵)) = (𝐴𝐵)
109reseq2i 5877 . . . . . . . 8 (𝐹 ↾ (𝐴 ∩ (𝐴𝐵))) = (𝐹 ↾ (𝐴𝐵))
118, 10eqtri 2766 . . . . . . 7 ((𝐹𝐴) ↾ (𝐴𝐵)) = (𝐹 ↾ (𝐴𝐵))
12 foeq1 6668 . . . . . . 7 (((𝐹𝐴) ↾ (𝐴𝐵)) = (𝐹 ↾ (𝐴𝐵)) → (((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵))))
1311, 12ax-mp 5 . . . . . 6 (((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)))
1411rneqi 5835 . . . . . . . 8 ran ((𝐹𝐴) ↾ (𝐴𝐵)) = ran (𝐹 ↾ (𝐴𝐵))
15 df-ima 5593 . . . . . . . 8 ((𝐹𝐴) “ (𝐴𝐵)) = ran ((𝐹𝐴) ↾ (𝐴𝐵))
16 df-ima 5593 . . . . . . . 8 (𝐹 “ (𝐴𝐵)) = ran (𝐹 ↾ (𝐴𝐵))
1714, 15, 163eqtr4i 2776 . . . . . . 7 ((𝐹𝐴) “ (𝐴𝐵)) = (𝐹 “ (𝐴𝐵))
18 foeq3 6670 . . . . . . 7 (((𝐹𝐴) “ (𝐴𝐵)) = (𝐹 “ (𝐴𝐵)) → ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵))))
1917, 18ax-mp 5 . . . . . 6 ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)))
2013, 19bitri 274 . . . . 5 (((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)))
217, 20sylib 217 . . . 4 ((𝐹𝐴):𝐴onto𝐶 → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)))
22 funres11 6495 . . . 4 (Fun 𝐹 → Fun (𝐹 ↾ (𝐴𝐵)))
23 dff1o3 6706 . . . . 5 ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)) ↔ ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)) ∧ Fun (𝐹 ↾ (𝐴𝐵))))
2423biimpri 227 . . . 4 (((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)) ∧ Fun (𝐹 ↾ (𝐴𝐵))) → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)))
2521, 22, 24syl2anr 596 . . 3 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶) → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)))
26253adant3 1130 . 2 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)))
27 df-ima 5593 . . . . . . 7 (𝐹𝐴) = ran (𝐹𝐴)
28 forn 6675 . . . . . . 7 ((𝐹𝐴):𝐴onto𝐶 → ran (𝐹𝐴) = 𝐶)
2927, 28eqtrid 2790 . . . . . 6 ((𝐹𝐴):𝐴onto𝐶 → (𝐹𝐴) = 𝐶)
30 df-ima 5593 . . . . . . 7 (𝐹𝐵) = ran (𝐹𝐵)
31 forn 6675 . . . . . . 7 ((𝐹𝐵):𝐵onto𝐷 → ran (𝐹𝐵) = 𝐷)
3230, 31eqtrid 2790 . . . . . 6 ((𝐹𝐵):𝐵onto𝐷 → (𝐹𝐵) = 𝐷)
3329, 32anim12i 612 . . . . 5 (((𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → ((𝐹𝐴) = 𝐶 ∧ (𝐹𝐵) = 𝐷))
34 imadif 6502 . . . . . 6 (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∖ (𝐹𝐵)))
35 difeq12 4048 . . . . . 6 (((𝐹𝐴) = 𝐶 ∧ (𝐹𝐵) = 𝐷) → ((𝐹𝐴) ∖ (𝐹𝐵)) = (𝐶𝐷))
3634, 35sylan9eq 2799 . . . . 5 ((Fun 𝐹 ∧ ((𝐹𝐴) = 𝐶 ∧ (𝐹𝐵) = 𝐷)) → (𝐹 “ (𝐴𝐵)) = (𝐶𝐷))
3733, 36sylan2 592 . . . 4 ((Fun 𝐹 ∧ ((𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷)) → (𝐹 “ (𝐴𝐵)) = (𝐶𝐷))
38373impb 1113 . . 3 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → (𝐹 “ (𝐴𝐵)) = (𝐶𝐷))
3938f1oeq3d 6697 . 2 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐶𝐷)))
4026, 39mpbid 231 1 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐶𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  w3a 1085   = wceq 1539  cdif 3880  cin 3882  wss 3883  ccnv 5579  dom cdm 5580  ran crn 5581  cres 5582  cima 5583  Fun wfun 6412  ontowfo 6416  1-1-ontowf1o 6417
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425
This theorem is referenced by:  resin  6721  dif1enlem  8905  canthp1lem2  10340  symgcom  31254  cycpmconjvlem  31310  subfacp1lem3  33044  subfacp1lem5  33046
  Copyright terms: Public domain W3C validator