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

Theorem resdif 6637
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 6593 . . . . . 6 ((𝐹𝐴):𝐴onto𝐶 → Fun (𝐹𝐴))
2 difss 4110 . . . . . . 7 (𝐴𝐵) ⊆ 𝐴
3 fof 6592 . . . . . . . 8 ((𝐹𝐴):𝐴onto𝐶 → (𝐹𝐴):𝐴𝐶)
43fdmd 6525 . . . . . . 7 ((𝐹𝐴):𝐴onto𝐶 → dom (𝐹𝐴) = 𝐴)
52, 4sseqtrrid 4022 . . . . . 6 ((𝐹𝐴):𝐴onto𝐶 → (𝐴𝐵) ⊆ dom (𝐹𝐴))
6 fores 6602 . . . . . 6 ((Fun (𝐹𝐴) ∧ (𝐴𝐵) ⊆ dom (𝐹𝐴)) → ((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)))
71, 5, 6syl2anc 586 . . . . 5 ((𝐹𝐴):𝐴onto𝐶 → ((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)))
8 resres 5868 . . . . . . . 8 ((𝐹𝐴) ↾ (𝐴𝐵)) = (𝐹 ↾ (𝐴 ∩ (𝐴𝐵)))
9 indif 4248 . . . . . . . . 9 (𝐴 ∩ (𝐴𝐵)) = (𝐴𝐵)
109reseq2i 5852 . . . . . . . 8 (𝐹 ↾ (𝐴 ∩ (𝐴𝐵))) = (𝐹 ↾ (𝐴𝐵))
118, 10eqtri 2846 . . . . . . 7 ((𝐹𝐴) ↾ (𝐴𝐵)) = (𝐹 ↾ (𝐴𝐵))
12 foeq1 6588 . . . . . . 7 (((𝐹𝐴) ↾ (𝐴𝐵)) = (𝐹 ↾ (𝐴𝐵)) → (((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵))))
1311, 12ax-mp 5 . . . . . 6 (((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)))
1411rneqi 5809 . . . . . . . 8 ran ((𝐹𝐴) ↾ (𝐴𝐵)) = ran (𝐹 ↾ (𝐴𝐵))
15 df-ima 5570 . . . . . . . 8 ((𝐹𝐴) “ (𝐴𝐵)) = ran ((𝐹𝐴) ↾ (𝐴𝐵))
16 df-ima 5570 . . . . . . . 8 (𝐹 “ (𝐴𝐵)) = ran (𝐹 ↾ (𝐴𝐵))
1714, 15, 163eqtr4i 2856 . . . . . . 7 ((𝐹𝐴) “ (𝐴𝐵)) = (𝐹 “ (𝐴𝐵))
18 foeq3 6590 . . . . . . 7 (((𝐹𝐴) “ (𝐴𝐵)) = (𝐹 “ (𝐴𝐵)) → ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵))))
1917, 18ax-mp 5 . . . . . 6 ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)))
2013, 19bitri 277 . . . . 5 (((𝐹𝐴) ↾ (𝐴𝐵)):(𝐴𝐵)–onto→((𝐹𝐴) “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)))
217, 20sylib 220 . . . 4 ((𝐹𝐴):𝐴onto𝐶 → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)))
22 funres11 6433 . . . 4 (Fun 𝐹 → Fun (𝐹 ↾ (𝐴𝐵)))
23 dff1o3 6623 . . . . 5 ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)) ↔ ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)) ∧ Fun (𝐹 ↾ (𝐴𝐵))))
2423biimpri 230 . . . 4 (((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–onto→(𝐹 “ (𝐴𝐵)) ∧ Fun (𝐹 ↾ (𝐴𝐵))) → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)))
2521, 22, 24syl2anr 598 . . 3 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶) → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)))
26253adant3 1128 . 2 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)))
27 df-ima 5570 . . . . . . 7 (𝐹𝐴) = ran (𝐹𝐴)
28 forn 6595 . . . . . . 7 ((𝐹𝐴):𝐴onto𝐶 → ran (𝐹𝐴) = 𝐶)
2927, 28syl5eq 2870 . . . . . 6 ((𝐹𝐴):𝐴onto𝐶 → (𝐹𝐴) = 𝐶)
30 df-ima 5570 . . . . . . 7 (𝐹𝐵) = ran (𝐹𝐵)
31 forn 6595 . . . . . . 7 ((𝐹𝐵):𝐵onto𝐷 → ran (𝐹𝐵) = 𝐷)
3230, 31syl5eq 2870 . . . . . 6 ((𝐹𝐵):𝐵onto𝐷 → (𝐹𝐵) = 𝐷)
3329, 32anim12i 614 . . . . 5 (((𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → ((𝐹𝐴) = 𝐶 ∧ (𝐹𝐵) = 𝐷))
34 imadif 6440 . . . . . 6 (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∖ (𝐹𝐵)))
35 difeq12 4096 . . . . . 6 (((𝐹𝐴) = 𝐶 ∧ (𝐹𝐵) = 𝐷) → ((𝐹𝐴) ∖ (𝐹𝐵)) = (𝐶𝐷))
3634, 35sylan9eq 2878 . . . . 5 ((Fun 𝐹 ∧ ((𝐹𝐴) = 𝐶 ∧ (𝐹𝐵) = 𝐷)) → (𝐹 “ (𝐴𝐵)) = (𝐶𝐷))
3733, 36sylan2 594 . . . 4 ((Fun 𝐹 ∧ ((𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷)) → (𝐹 “ (𝐴𝐵)) = (𝐶𝐷))
38373impb 1111 . . 3 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → (𝐹 “ (𝐴𝐵)) = (𝐶𝐷))
3938f1oeq3d 6614 . 2 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → ((𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐹 “ (𝐴𝐵)) ↔ (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐶𝐷)))
4026, 39mpbid 234 1 ((Fun 𝐹 ∧ (𝐹𝐴):𝐴onto𝐶 ∧ (𝐹𝐵):𝐵onto𝐷) → (𝐹 ↾ (𝐴𝐵)):(𝐴𝐵)–1-1-onto→(𝐶𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083   = wceq 1537  cdif 3935  cin 3937  wss 3938  ccnv 5556  dom cdm 5557  ran crn 5558  cres 5559  cima 5560  Fun wfun 6351  ontowfo 6355  1-1-ontowf1o 6356
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 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332
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 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-br 5069  df-opab 5131  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364
This theorem is referenced by:  resin  6638  canthp1lem2  10077  symgcom  30729  cycpmconjvlem  30785  subfacp1lem3  32431  subfacp1lem5  32433
  Copyright terms: Public domain W3C validator