Theorem fcof1o 5811

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

Step	Hyp	Ref	Expression
1		fcof1 5805	. . . 4 |- ( ( F : A --> B /\ ( G o. F ) = ( _I |` A ) ) -> F : A -1-1-> B )
2	1	ad2ant2rl 511	. . 3 |- ( ( ( F : A --> B /\ G : B --> A ) /\ ( ( F o. G ) = ( _I |` B ) /\ ( G o. F ) = ( _I |` A ) ) ) -> F : A -1-1-> B )
3		fcofo 5806	. . . . 5 |- ( ( F : A --> B /\ G : B --> A /\ ( F o. G ) = ( _I |` B ) ) -> F : A -onto-> B )
4	3	3expa 1205	. . . 4 |- ( ( ( F : A --> B /\ G : B --> A ) /\ ( F o. G ) = ( _I |` B ) ) -> F : A -onto-> B )
5	4	adantrr 479	. . 3 |- ( ( ( F : A --> B /\ G : B --> A ) /\ ( ( F o. G ) = ( _I |` B ) /\ ( G o. F ) = ( _I |` A ) ) ) -> F : A -onto-> B )
6		df-f1o 5242	. . 3 |- ( F : A -1-1-onto-> B <-> ( F : A -1-1-> B /\ F : A -onto-> B ) )
7	2, 5, 6	sylanbrc 417	. 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 529	. . . 4 |- ( ( ( F : A --> B /\ G : B --> A ) /\ ( ( F o. G ) = ( _I |` B ) /\ ( G o. F ) = ( _I |` A ) ) ) -> ( F o. G ) = ( _I |` B ) )
9	8	coeq2d 4807	. . 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 5165	. . . 4 |- ( ( `' F o. F ) o. G ) = ( `' F o. ( F o. G ) )
11		f1ococnv1 5509	. . . . . . 7 |- ( F : A -1-1-onto-> B -> ( `' F o. F ) = ( _I |` A ) )
12	7, 11	syl 14	. . . . . 6 |- ( ( ( F : A --> B /\ G : B --> A ) /\ ( ( F o. G ) = ( _I |` B ) /\ ( G o. F ) = ( _I |` A ) ) ) -> ( `' F o. F ) = ( _I |` A ) )
13	12	coeq1d 4806	. . . . 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 5416	. . . . . 6 |- ( G : B --> A -> ( ( _I |` A ) o. G ) = G )
15	14	ad2antlr 489	. . . . 5 |- ( ( ( F : A --> B /\ G : B --> A ) /\ ( ( F o. G ) = ( _I |` B ) /\ ( G o. F ) = ( _I |` A ) ) ) -> ( ( _I |` A ) o. G ) = G )
16	13, 15	eqtrd 2222	. . . 4 |- ( ( ( F : A --> B /\ G : B --> A ) /\ ( ( F o. G ) = ( _I |` B ) /\ ( G o. F ) = ( _I |` A ) ) ) -> ( ( `' F o. F ) o. G ) = G )
17	10, 16	eqtr3id 2236	. . 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 5493	. . . 4 |- ( F : A -1-1-onto-> B -> `' F : B -1-1-onto-> A )
19		f1of 5480	. . . 4 |- ( `' F : B -1-1-onto-> A -> `' F : B --> A )
20		fcoi1 5415	. . . 4 |- ( `' F : B --> A -> ( `' F o. ( _I |` B ) ) = `' F )
21	7, 18, 19, 20	4syl 18	. . 3 |- ( ( ( F : A --> B /\ G : B --> A ) /\ ( ( F o. G ) = ( _I |` B ) /\ ( G o. F ) = ( _I |` A ) ) ) -> ( `' F o. ( _I |` B ) ) = `' F )
22	9, 17, 21	3eqtr3rd 2231	. 2 |- ( ( ( F : A --> B /\ G : B --> A ) /\ ( ( F o. G ) = ( _I |` B ) /\ ( G o. F ) = ( _I |` A ) ) ) -> `' F = G )
23	7, 22	jca 306	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 ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1364   _I cid 4306   `'ccnv 4643   |` cres 4646   o. ccom 4648   -->wf 5231   -1-1->wf1 5232   -onto->wfo 5233   -1-1-onto->wf1o 5234

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4192  ax-pr 4227

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2754  df-sbc 2978  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4311  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243

This theorem is referenced by:  txswaphmeo  14298