ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  resdif Unicode version

Theorem resdif 5641
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
StepHypRef Expression
1 fofun 5596 . . . . . 6  |-  ( ( F  |`  A ) : A -onto-> C  ->  Fun  ( F  |`  A ) )
2 difss 3349 . . . . . . 7  |-  ( A 
\  B )  C_  A
3 fof 5595 . . . . . . . 8  |-  ( ( F  |`  A ) : A -onto-> C  ->  ( F  |`  A ) : A --> C )
4 fdm 5519 . . . . . . . 8  |-  ( ( F  |`  A ) : A --> C  ->  dom  ( F  |`  A )  =  A )
53, 4syl 14 . . . . . . 7  |-  ( ( F  |`  A ) : A -onto-> C  ->  dom  ( F  |`  A )  =  A )
62, 5sseqtrrid 3293 . . . . . 6  |-  ( ( F  |`  A ) : A -onto-> C  ->  ( A 
\  B )  C_  dom  ( F  |`  A ) )
7 fores 5605 . . . . . 6  |-  ( ( Fun  ( F  |`  A )  /\  ( A  \  B )  C_  dom  ( F  |`  A ) )  ->  ( ( F  |`  A )  |`  ( A  \  B ) ) : ( A 
\  B ) -onto-> ( ( F  |`  A )
" ( A  \  B ) ) )
81, 6, 7syl2anc 411 . . . . 5  |-  ( ( F  |`  A ) : A -onto-> C  ->  ( ( F  |`  A )  |`  ( A  \  B
) ) : ( A  \  B )
-onto-> ( ( F  |`  A ) " ( A  \  B ) ) )
9 resres 5055 . . . . . . . 8  |-  ( ( F  |`  A )  |`  ( A  \  B
) )  =  ( F  |`  ( A  i^i  ( A  \  B
) ) )
10 indif 3468 . . . . . . . . 9  |-  ( A  i^i  ( A  \  B ) )  =  ( A  \  B
)
1110reseq2i 5040 . . . . . . . 8  |-  ( F  |`  ( A  i^i  ( A  \  B ) ) )  =  ( F  |`  ( A  \  B
) )
129, 11eqtri 2255 . . . . . . 7  |-  ( ( F  |`  A )  |`  ( A  \  B
) )  =  ( F  |`  ( A  \  B ) )
13 foeq1 5591 . . . . . . 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 ) ) ) )
1412, 13ax-mp 5 . . . . . 6  |-  ( ( ( F  |`  A )  |`  ( A  \  B
) ) : ( A  \  B )
-onto-> ( ( F  |`  A ) " ( A  \  B ) )  <-> 
( F  |`  ( A  \  B ) ) : ( A  \  B ) -onto-> ( ( F  |`  A ) " ( A  \  B ) ) )
1512rneqi 4990 . . . . . . . 8  |-  ran  (
( F  |`  A )  |`  ( A  \  B
) )  =  ran  ( F  |`  ( A 
\  B ) )
16 df-ima 4767 . . . . . . . 8  |-  ( ( F  |`  A ) " ( A  \  B ) )  =  ran  ( ( F  |`  A )  |`  ( A  \  B ) )
17 df-ima 4767 . . . . . . . 8  |-  ( F
" ( A  \  B ) )  =  ran  ( F  |`  ( A  \  B ) )
1815, 16, 173eqtr4i 2265 . . . . . . 7  |-  ( ( F  |`  A ) " ( A  \  B ) )  =  ( F " ( A  \  B ) )
19 foeq3 5593 . . . . . . 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 ) ) ) )
2018, 19ax-mp 5 . . . . . 6  |-  ( ( F  |`  ( A  \  B ) ) : ( A  \  B
) -onto-> ( ( F  |`  A ) " ( A  \  B ) )  <-> 
( F  |`  ( A  \  B ) ) : ( A  \  B ) -onto-> ( F
" ( A  \  B ) ) )
2114, 20bitri 184 . . . . 5  |-  ( ( ( F  |`  A )  |`  ( A  \  B
) ) : ( A  \  B )
-onto-> ( ( F  |`  A ) " ( A  \  B ) )  <-> 
( F  |`  ( A  \  B ) ) : ( A  \  B ) -onto-> ( F
" ( A  \  B ) ) )
228, 21sylib 122 . . . 4  |-  ( ( F  |`  A ) : A -onto-> C  ->  ( F  |`  ( A  \  B
) ) : ( A  \  B )
-onto-> ( F " ( A  \  B ) ) )
23 funres11 5433 . . . 4  |-  ( Fun  `' F  ->  Fun  `' ( F  |`  ( A 
\  B ) ) )
24 dff1o3 5625 . . . . 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 ) ) ) )
2524biimpri 133 . . . 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 ) ) )
2622, 23, 25syl2anr 290 . . 3  |-  ( ( Fun  `' F  /\  ( F  |`  A ) : A -onto-> C )  ->  ( F  |`  ( A  \  B ) ) : ( A 
\  B ) -1-1-onto-> ( F
" ( A  \  B ) ) )
27263adant3 1044 . 2  |-  ( ( Fun  `' F  /\  ( F  |`  A ) : A -onto-> C  /\  ( F  |`  B ) : B -onto-> D )  ->  ( F  |`  ( A  \  B ) ) : ( A 
\  B ) -1-1-onto-> ( F
" ( A  \  B ) ) )
28 df-ima 4767 . . . . . . 7  |-  ( F
" A )  =  ran  ( F  |`  A )
29 forn 5598 . . . . . . 7  |-  ( ( F  |`  A ) : A -onto-> C  ->  ran  ( F  |`  A )  =  C )
3028, 29eqtrid 2279 . . . . . 6  |-  ( ( F  |`  A ) : A -onto-> C  ->  ( F
" A )  =  C )
31 df-ima 4767 . . . . . . 7  |-  ( F
" B )  =  ran  ( F  |`  B )
32 forn 5598 . . . . . . 7  |-  ( ( F  |`  B ) : B -onto-> D  ->  ran  ( F  |`  B )  =  D )
3331, 32eqtrid 2279 . . . . . 6  |-  ( ( F  |`  B ) : B -onto-> D  ->  ( F
" B )  =  D )
3430, 33anim12i 338 . . . . 5  |-  ( ( ( F  |`  A ) : A -onto-> C  /\  ( F  |`  B ) : B -onto-> D )  ->  ( ( F
" A )  =  C  /\  ( F
" B )  =  D ) )
35 imadif 5441 . . . . . 6  |-  ( Fun  `' F  ->  ( F
" ( A  \  B ) )  =  ( ( F " A )  \  ( F " B ) ) )
36 difeq12 3336 . . . . . 6  |-  ( ( ( F " A
)  =  C  /\  ( F " B )  =  D )  -> 
( ( F " A )  \  ( F " B ) )  =  ( C  \  D ) )
3735, 36sylan9eq 2287 . . . . 5  |-  ( ( Fun  `' F  /\  ( ( F " A )  =  C  /\  ( F " B )  =  D ) )  ->  ( F " ( A  \  B ) )  =  ( C  \  D
) )
3834, 37sylan2 286 . . . 4  |-  ( ( Fun  `' F  /\  ( ( F  |`  A ) : A -onto-> C  /\  ( F  |`  B ) : B -onto-> D ) )  -> 
( F " ( A  \  B ) )  =  ( C  \  D ) )
39383impb 1226 . . 3  |-  ( ( Fun  `' F  /\  ( F  |`  A ) : A -onto-> C  /\  ( F  |`  B ) : B -onto-> D )  ->  ( F "
( A  \  B
) )  =  ( C  \  D ) )
40 f1oeq3 5609 . . 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
) ) )
4139, 40syl 14 . 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
) ) )
4227, 41mpbid 147 1  |-  ( ( Fun  `' F  /\  ( F  |`  A ) : A -onto-> C  /\  ( F  |`  B ) : B -onto-> D )  ->  ( F  |`  ( A  \  B ) ) : ( A 
\  B ) -1-1-onto-> ( C 
\  D ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    \ cdif 3211    i^i cin 3213    C_ wss 3214   `'ccnv 4753   dom cdm 4754   ran crn 4755    |` cres 4756   "cima 4757   Fun wfun 5351   -->wf 5353   -onto->wfo 5355   -1-1-onto->wf1o 5356
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364
This theorem is referenced by:  dif1en  7149
  Copyright terms: Public domain W3C validator