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

Theorem resdif 5544
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 5499 . . . . . 6  |-  ( ( F  |`  A ) : A -onto-> C  ->  Fun  ( F  |`  A ) )
2 difss 3299 . . . . . . 7  |-  ( A 
\  B )  C_  A
3 fof 5498 . . . . . . . 8  |-  ( ( F  |`  A ) : A -onto-> C  ->  ( F  |`  A ) : A --> C )
4 fdm 5431 . . . . . . . 8  |-  ( ( F  |`  A ) : A --> C  ->  dom  ( F  |`  A )  =  A )
53, 4syl 14 . . . . . . 7  |-  ( ( F  |`  A ) : A -onto-> C  ->  dom  ( F  |`  A )  =  A )
62, 5sseqtrrid 3244 . . . . . 6  |-  ( ( F  |`  A ) : A -onto-> C  ->  ( A 
\  B )  C_  dom  ( F  |`  A ) )
7 fores 5508 . . . . . 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 4971 . . . . . . . 8  |-  ( ( F  |`  A )  |`  ( A  \  B
) )  =  ( F  |`  ( A  i^i  ( A  \  B
) ) )
10 indif 3416 . . . . . . . . 9  |-  ( A  i^i  ( A  \  B ) )  =  ( A  \  B
)
1110reseq2i 4956 . . . . . . . 8  |-  ( F  |`  ( A  i^i  ( A  \  B ) ) )  =  ( F  |`  ( A  \  B
) )
129, 11eqtri 2226 . . . . . . 7  |-  ( ( F  |`  A )  |`  ( A  \  B
) )  =  ( F  |`  ( A  \  B ) )
13 foeq1 5494 . . . . . . 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 4906 . . . . . . . 8  |-  ran  (
( F  |`  A )  |`  ( A  \  B
) )  =  ran  ( F  |`  ( A 
\  B ) )
16 df-ima 4688 . . . . . . . 8  |-  ( ( F  |`  A ) " ( A  \  B ) )  =  ran  ( ( F  |`  A )  |`  ( A  \  B ) )
17 df-ima 4688 . . . . . . . 8  |-  ( F
" ( A  \  B ) )  =  ran  ( F  |`  ( A  \  B ) )
1815, 16, 173eqtr4i 2236 . . . . . . 7  |-  ( ( F  |`  A ) " ( A  \  B ) )  =  ( F " ( A  \  B ) )
19 foeq3 5496 . . . . . . 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 5346 . . . 4  |-  ( Fun  `' F  ->  Fun  `' ( F  |`  ( A 
\  B ) ) )
24 dff1o3 5528 . . . . 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 1020 . 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 4688 . . . . . . 7  |-  ( F
" A )  =  ran  ( F  |`  A )
29 forn 5501 . . . . . . 7  |-  ( ( F  |`  A ) : A -onto-> C  ->  ran  ( F  |`  A )  =  C )
3028, 29eqtrid 2250 . . . . . 6  |-  ( ( F  |`  A ) : A -onto-> C  ->  ( F
" A )  =  C )
31 df-ima 4688 . . . . . . 7  |-  ( F
" B )  =  ran  ( F  |`  B )
32 forn 5501 . . . . . . 7  |-  ( ( F  |`  B ) : B -onto-> D  ->  ran  ( F  |`  B )  =  D )
3331, 32eqtrid 2250 . . . . . 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 5354 . . . . . 6  |-  ( Fun  `' F  ->  ( F
" ( A  \  B ) )  =  ( ( F " A )  \  ( F " B ) ) )
36 difeq12 3286 . . . . . 6  |-  ( ( ( F " A
)  =  C  /\  ( F " B )  =  D )  -> 
( ( F " A )  \  ( F " B ) )  =  ( C  \  D ) )
3735, 36sylan9eq 2258 . . . . 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 1202 . . 3  |-  ( ( Fun  `' F  /\  ( F  |`  A ) : A -onto-> C  /\  ( F  |`  B ) : B -onto-> D )  ->  ( F "
( A  \  B
) )  =  ( C  \  D ) )
40 f1oeq3 5512 . . 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 981    = wceq 1373    \ cdif 3163    i^i cin 3165    C_ wss 3166   `'ccnv 4674   dom cdm 4675   ran crn 4676    |` cres 4677   "cima 4678   Fun wfun 5265   -->wf 5267   -onto->wfo 5269   -1-1-onto->wf1o 5270
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-br 4045  df-opab 4106  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278
This theorem is referenced by:  dif1en  6976
  Copyright terms: Public domain W3C validator