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

Theorem fcof1o 5449
Description: Show that two functions are inverse to each other by computing their compositions. (Contributed by Mario Carneiro, 21-Mar-2015.)
Assertion
Ref Expression
fcof1o  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  ( F : A -1-1-onto-> B  /\  `' F  =  G ) )

Proof of Theorem fcof1o
StepHypRef Expression
1 fcof1 5443 . . . 4  |-  ( ( F : A --> B  /\  ( G  o.  F
)  =  (  _I  |`  A ) )  ->  F : A -1-1-> B )
21ad2ant2rl 494 . . 3  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  F : A -1-1-> B )
3 fcofo 5444 . . . . 5  |-  ( ( F : A --> B  /\  G : B --> A  /\  ( F  o.  G
)  =  (  _I  |`  B ) )  ->  F : A -onto-> B )
433expa 1138 . . . 4  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  ( F  o.  G )  =  (  _I  |`  B ) )  ->  F : A -onto-> B )
54adantrr 462 . . 3  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  F : A -onto-> B )
6 df-f1o 4929 . . 3  |-  ( F : A -1-1-onto-> B  <->  ( F : A -1-1-> B  /\  F : A -onto-> B ) )
72, 5, 6sylanbrc 408 . 2  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  F : A -1-1-onto-> B )
8 simprl 497 . . . 4  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  ( F  o.  G )  =  (  _I  |`  B ) )
98coeq2d 4516 . . 3  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  ( `' F  o.  ( F  o.  G )
)  =  ( `' F  o.  (  _I  |`  B ) ) )
10 coass 4859 . . . 4  |-  ( ( `' F  o.  F
)  o.  G )  =  ( `' F  o.  ( F  o.  G
) )
11 f1ococnv1 5175 . . . . . . 7  |-  ( F : A -1-1-onto-> B  ->  ( `' F  o.  F )  =  (  _I  |`  A ) )
127, 11syl 14 . . . . . 6  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  ( `' F  o.  F
)  =  (  _I  |`  A ) )
1312coeq1d 4515 . . . . 5  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  (
( `' F  o.  F )  o.  G
)  =  ( (  _I  |`  A )  o.  G ) )
14 fcoi2 5091 . . . . . 6  |-  ( G : B --> A  -> 
( (  _I  |`  A )  o.  G )  =  G )
1514ad2antlr 472 . . . . 5  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  (
(  _I  |`  A )  o.  G )  =  G )
1613, 15eqtrd 2113 . . . 4  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  (
( `' F  o.  F )  o.  G
)  =  G )
1710, 16syl5eqr 2127 . . 3  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  ( `' F  o.  ( F  o.  G )
)  =  G )
18 f1ocnv 5159 . . . 4  |-  ( F : A -1-1-onto-> B  ->  `' F : B -1-1-onto-> A )
19 f1of 5146 . . . 4  |-  ( `' F : B -1-1-onto-> A  ->  `' F : B --> A )
20 fcoi1 5090 . . . 4  |-  ( `' F : B --> A  -> 
( `' F  o.  (  _I  |`  B ) )  =  `' F
)
217, 18, 19, 204syl 18 . . 3  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  ( `' F  o.  (  _I  |`  B ) )  =  `' F )
229, 17, 213eqtr3rd 2122 . 2  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  `' F  =  G )
237, 22jca 300 1  |-  ( ( ( F : A --> B  /\  G : B --> A )  /\  (
( F  o.  G
)  =  (  _I  |`  B )  /\  ( G  o.  F )  =  (  _I  |`  A ) ) )  ->  ( F : A -1-1-onto-> B  /\  `' F  =  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    = wceq 1284    _I cid 4043   `'ccnv 4362    |` cres 4365    o. ccom 4367   -->wf 4918   -1-1->wf1 4919   -onto->wfo 4920   -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-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  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-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator