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

Theorem f1orescnv 5162
Description: The converse of a one-to-one-onto restricted function. (Contributed by Paul Chapman, 21-Apr-2008.)
Assertion
Ref Expression
f1orescnv  |-  ( ( Fun  `' F  /\  ( F  |`  R ) : R -1-1-onto-> P )  ->  ( `' F  |`  P ) : P -1-1-onto-> R )

Proof of Theorem f1orescnv
StepHypRef Expression
1 f1ocnv 5159 . . 3  |-  ( ( F  |`  R ) : R -1-1-onto-> P  ->  `' ( F  |`  R ) : P -1-1-onto-> R )
21adantl 271 . 2  |-  ( ( Fun  `' F  /\  ( F  |`  R ) : R -1-1-onto-> P )  ->  `' ( F  |`  R ) : P -1-1-onto-> R )
3 funcnvres 4992 . . . 4  |-  ( Fun  `' F  ->  `' ( F  |`  R )  =  ( `' F  |`  ( F " R
) ) )
4 df-ima 4376 . . . . . 6  |-  ( F
" R )  =  ran  ( F  |`  R )
5 dff1o5 5155 . . . . . . 7  |-  ( ( F  |`  R ) : R -1-1-onto-> P  <->  ( ( F  |`  R ) : R -1-1-> P  /\  ran  ( F  |`  R )  =  P ) )
65simprbi 269 . . . . . 6  |-  ( ( F  |`  R ) : R -1-1-onto-> P  ->  ran  ( F  |`  R )  =  P )
74, 6syl5eq 2125 . . . . 5  |-  ( ( F  |`  R ) : R -1-1-onto-> P  ->  ( F " R )  =  P )
87reseq2d 4630 . . . 4  |-  ( ( F  |`  R ) : R -1-1-onto-> P  ->  ( `' F  |`  ( F " R ) )  =  ( `' F  |`  P ) )
93, 8sylan9eq 2133 . . 3  |-  ( ( Fun  `' F  /\  ( F  |`  R ) : R -1-1-onto-> P )  ->  `' ( F  |`  R )  =  ( `' F  |`  P ) )
10 f1oeq1 5137 . . 3  |-  ( `' ( F  |`  R )  =  ( `' F  |`  P )  ->  ( `' ( F  |`  R ) : P -1-1-onto-> R  <->  ( `' F  |`  P ) : P -1-1-onto-> R ) )
119, 10syl 14 . 2  |-  ( ( Fun  `' F  /\  ( F  |`  R ) : R -1-1-onto-> P )  ->  ( `' ( F  |`  R ) : P -1-1-onto-> R  <->  ( `' F  |`  P ) : P -1-1-onto-> R ) )
122, 11mpbid 145 1  |-  ( ( Fun  `' F  /\  ( F  |`  R ) : R -1-1-onto-> P )  ->  ( `' F  |`  P ) : P -1-1-onto-> R )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1284   `'ccnv 4362   ran crn 4364    |` cres 4365   "cima 4366   Fun wfun 4916   -1-1->wf1 4919   -1-1-onto->wf1o 4921
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929
This theorem is referenced by:  f1oresrab  5350
  Copyright terms: Public domain W3C validator