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

Theorem foimacnv 5481
Description: A reverse version of f1imacnv 5480. (Contributed by Jeff Hankins, 16-Jul-2009.)
Assertion
Ref Expression
foimacnv  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( F "
( `' F " C ) )  =  C )

Proof of Theorem foimacnv
StepHypRef Expression
1 resima 4942 . 2  |-  ( ( F  |`  ( `' F " C ) )
" ( `' F " C ) )  =  ( F " ( `' F " C ) )
2 fofun 5441 . . . . . 6  |-  ( F : A -onto-> B  ->  Fun  F )
32adantr 276 . . . . 5  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  Fun  F )
4 funcnvres2 5293 . . . . 5  |-  ( Fun 
F  ->  `' ( `' F  |`  C )  =  ( F  |`  ( `' F " C ) ) )
53, 4syl 14 . . . 4  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  `' ( `' F  |`  C )  =  ( F  |`  ( `' F " C ) ) )
65imaeq1d 4971 . . 3  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( `' ( `' F  |`  C )
" ( `' F " C ) )  =  ( ( F  |`  ( `' F " C ) ) " ( `' F " C ) ) )
7 resss 4933 . . . . . . . . . . 11  |-  ( `' F  |`  C )  C_  `' F
8 cnvss 4802 . . . . . . . . . . 11  |-  ( ( `' F  |`  C ) 
C_  `' F  ->  `' ( `' F  |`  C )  C_  `' `' F )
97, 8ax-mp 5 . . . . . . . . . 10  |-  `' ( `' F  |`  C ) 
C_  `' `' F
10 cnvcnvss 5085 . . . . . . . . . 10  |-  `' `' F  C_  F
119, 10sstri 3166 . . . . . . . . 9  |-  `' ( `' F  |`  C ) 
C_  F
12 funss 5237 . . . . . . . . 9  |-  ( `' ( `' F  |`  C )  C_  F  ->  ( Fun  F  ->  Fun  `' ( `' F  |`  C ) ) )
1311, 2, 12mpsyl 65 . . . . . . . 8  |-  ( F : A -onto-> B  ->  Fun  `' ( `' F  |`  C ) )
1413adantr 276 . . . . . . 7  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  Fun  `' ( `' F  |`  C ) )
15 df-ima 4641 . . . . . . . 8  |-  ( `' F " C )  =  ran  ( `' F  |`  C )
16 df-rn 4639 . . . . . . . 8  |-  ran  ( `' F  |`  C )  =  dom  `' ( `' F  |`  C )
1715, 16eqtr2i 2199 . . . . . . 7  |-  dom  `' ( `' F  |`  C )  =  ( `' F " C )
1814, 17jctir 313 . . . . . 6  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( Fun  `' ( `' F  |`  C )  /\  dom  `' ( `' F  |`  C )  =  ( `' F " C ) ) )
19 df-fn 5221 . . . . . 6  |-  ( `' ( `' F  |`  C )  Fn  ( `' F " C )  <-> 
( Fun  `' ( `' F  |`  C )  /\  dom  `' ( `' F  |`  C )  =  ( `' F " C ) ) )
2018, 19sylibr 134 . . . . 5  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  `' ( `' F  |`  C )  Fn  ( `' F " C ) )
21 dfdm4 4821 . . . . . 6  |-  dom  ( `' F  |`  C )  =  ran  `' ( `' F  |`  C )
22 forn 5443 . . . . . . . . . 10  |-  ( F : A -onto-> B  ->  ran  F  =  B )
2322sseq2d 3187 . . . . . . . . 9  |-  ( F : A -onto-> B  -> 
( C  C_  ran  F  <-> 
C  C_  B )
)
2423biimpar 297 . . . . . . . 8  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  C  C_  ran  F )
25 df-rn 4639 . . . . . . . 8  |-  ran  F  =  dom  `' F
2624, 25sseqtrdi 3205 . . . . . . 7  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  C  C_  dom  `' F )
27 ssdmres 4931 . . . . . . 7  |-  ( C 
C_  dom  `' F  <->  dom  ( `' F  |`  C )  =  C )
2826, 27sylib 122 . . . . . 6  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  dom  ( `' F  |`  C )  =  C )
2921, 28eqtr3id 2224 . . . . 5  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ran  `' ( `' F  |`  C )  =  C )
30 df-fo 5224 . . . . 5  |-  ( `' ( `' F  |`  C ) : ( `' F " C )
-onto-> C  <->  ( `' ( `' F  |`  C )  Fn  ( `' F " C )  /\  ran  `' ( `' F  |`  C )  =  C ) )
3120, 29, 30sylanbrc 417 . . . 4  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  `' ( `' F  |`  C ) : ( `' F " C ) -onto-> C )
32 foima 5445 . . . 4  |-  ( `' ( `' F  |`  C ) : ( `' F " C )
-onto-> C  ->  ( `' ( `' F  |`  C )
" ( `' F " C ) )  =  C )
3331, 32syl 14 . . 3  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( `' ( `' F  |`  C )
" ( `' F " C ) )  =  C )
346, 33eqtr3d 2212 . 2  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( ( F  |`  ( `' F " C ) ) "
( `' F " C ) )  =  C )
351, 34eqtr3id 2224 1  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( F "
( `' F " C ) )  =  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1353    C_ wss 3131   `'ccnv 4627   dom cdm 4628   ran crn 4629    |` cres 4630   "cima 4631   Fun wfun 5212    Fn wfn 5213   -onto->wfo 5216
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-opab 4067  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-fun 5220  df-fn 5221  df-f 5222  df-fo 5224
This theorem is referenced by:  f1opw2  6079  fopwdom  6838  fisumss  11402  fprodssdc  11600  hmeoimaf1o  13899
  Copyright terms: Public domain W3C validator