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

Theorem foimacnv 6154
Description: A reverse version of f1imacnv 6153. (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 5431 . 2  |-  ( ( F  |`  ( `' F " C ) )
" ( `' F " C ) )  =  ( F " ( `' F " C ) )
2 fofun 6116 . . . . . 6  |-  ( F : A -onto-> B  ->  Fun  F )
32adantr 481 . . . . 5  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  Fun  F )
4 funcnvres2 5969 . . . . 5  |-  ( Fun 
F  ->  `' ( `' F  |`  C )  =  ( F  |`  ( `' F " C ) ) )
53, 4syl 17 . . . 4  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  `' ( `' F  |`  C )  =  ( F  |`  ( `' F " C ) ) )
65imaeq1d 5465 . . 3  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( `' ( `' F  |`  C )
" ( `' F " C ) )  =  ( ( F  |`  ( `' F " C ) ) " ( `' F " C ) ) )
7 resss 5422 . . . . . . . . . . 11  |-  ( `' F  |`  C )  C_  `' F
8 cnvss 5294 . . . . . . . . . . 11  |-  ( ( `' F  |`  C ) 
C_  `' F  ->  `' ( `' F  |`  C )  C_  `' `' F )
97, 8ax-mp 5 . . . . . . . . . 10  |-  `' ( `' F  |`  C ) 
C_  `' `' F
10 cnvcnvss 5589 . . . . . . . . . 10  |-  `' `' F  C_  F
119, 10sstri 3612 . . . . . . . . 9  |-  `' ( `' F  |`  C ) 
C_  F
12 funss 5907 . . . . . . . . 9  |-  ( `' ( `' F  |`  C )  C_  F  ->  ( Fun  F  ->  Fun  `' ( `' F  |`  C ) ) )
1311, 2, 12mpsyl 68 . . . . . . . 8  |-  ( F : A -onto-> B  ->  Fun  `' ( `' F  |`  C ) )
1413adantr 481 . . . . . . 7  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  Fun  `' ( `' F  |`  C ) )
15 df-ima 5127 . . . . . . . 8  |-  ( `' F " C )  =  ran  ( `' F  |`  C )
16 df-rn 5125 . . . . . . . 8  |-  ran  ( `' F  |`  C )  =  dom  `' ( `' F  |`  C )
1715, 16eqtr2i 2645 . . . . . . 7  |-  dom  `' ( `' F  |`  C )  =  ( `' F " C )
1814, 17jctir 561 . . . . . 6  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( Fun  `' ( `' F  |`  C )  /\  dom  `' ( `' F  |`  C )  =  ( `' F " C ) ) )
19 df-fn 5891 . . . . . 6  |-  ( `' ( `' F  |`  C )  Fn  ( `' F " C )  <-> 
( Fun  `' ( `' F  |`  C )  /\  dom  `' ( `' F  |`  C )  =  ( `' F " C ) ) )
2018, 19sylibr 224 . . . . 5  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  `' ( `' F  |`  C )  Fn  ( `' F " C ) )
21 dfdm4 5316 . . . . . 6  |-  dom  ( `' F  |`  C )  =  ran  `' ( `' F  |`  C )
22 forn 6118 . . . . . . . . . 10  |-  ( F : A -onto-> B  ->  ran  F  =  B )
2322sseq2d 3633 . . . . . . . . 9  |-  ( F : A -onto-> B  -> 
( C  C_  ran  F  <-> 
C  C_  B )
)
2423biimpar 502 . . . . . . . 8  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  C  C_  ran  F )
25 df-rn 5125 . . . . . . . 8  |-  ran  F  =  dom  `' F
2624, 25syl6sseq 3651 . . . . . . 7  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  C  C_  dom  `' F )
27 ssdmres 5420 . . . . . . 7  |-  ( C 
C_  dom  `' F  <->  dom  ( `' F  |`  C )  =  C )
2826, 27sylib 208 . . . . . 6  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  dom  ( `' F  |`  C )  =  C )
2921, 28syl5eqr 2670 . . . . 5  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ran  `' ( `' F  |`  C )  =  C )
30 df-fo 5894 . . . . 5  |-  ( `' ( `' F  |`  C ) : ( `' F " C )
-onto-> C  <->  ( `' ( `' F  |`  C )  Fn  ( `' F " C )  /\  ran  `' ( `' F  |`  C )  =  C ) )
3120, 29, 30sylanbrc 698 . . . 4  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  `' ( `' F  |`  C ) : ( `' F " C ) -onto-> C )
32 foima 6120 . . . 4  |-  ( `' ( `' F  |`  C ) : ( `' F " C )
-onto-> C  ->  ( `' ( `' F  |`  C )
" ( `' F " C ) )  =  C )
3331, 32syl 17 . . 3  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( `' ( `' F  |`  C )
" ( `' F " C ) )  =  C )
346, 33eqtr3d 2658 . 2  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( ( F  |`  ( `' F " C ) ) "
( `' F " C ) )  =  C )
351, 34syl5eqr 2670 1  |-  ( ( F : A -onto-> B  /\  C  C_  B )  ->  ( F "
( `' F " C ) )  =  C )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    C_ wss 3574   `'ccnv 5113   dom cdm 5114   ran crn 5115    |` cres 5116   "cima 5117   Fun wfun 5882    Fn wfn 5883   -onto->wfo 5886
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-fun 5890  df-fn 5891  df-f 5892  df-fo 5894
This theorem is referenced by:  f1opw2  6888  imacosupp  7335  fopwdom  8068  f1opwfi  8270  enfin2i  9143  fin1a2lem7  9228  fsumss  14456  fprodss  14678  gicsubgen  17721  coe1mul2lem2  19638  cncmp  21195  cnconn  21225  qtoprest  21520  qtopomap  21521  qtopcmap  21522  hmeoimaf1o  21573  elfm3  21754  imasf1oxms  22294  mbfimaopnlem  23422  cvmsss2  31256  diaintclN  36347  dibintclN  36456  dihintcl  36633  lnmepi  37655  pwfi2f1o  37666  sge0f1o  40599
  Copyright terms: Public domain W3C validator