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

Theorem fcof1 5696
Description: An application is injective if a retraction exists. Proposition 8 of [BourbakiEns] p. E.II.18. (Contributed by FL, 11-Nov-2011.) (Revised by Mario Carneiro, 27-Dec-2014.)
Assertion
Ref Expression
fcof1  |-  ( ( F : A --> B  /\  ( R  o.  F
)  =  (  _I  |`  A ) )  ->  F : A -1-1-> B )

Proof of Theorem fcof1
StepHypRef Expression
1 simpl 445 . 2  |-  ( ( F : A --> B  /\  ( R  o.  F
)  =  (  _I  |`  A ) )  ->  F : A --> B )
2 simprr 736 . . . . . . . 8  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( F `  x )  =  ( F `  y ) )
32fveq2d 5427 . . . . . . 7  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( R `  ( F `  x
) )  =  ( R `  ( F `
 y ) ) )
4 simpll 733 . . . . . . . 8  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  F : A
--> B )
5 simprll 741 . . . . . . . 8  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  x  e.  A )
6 fvco3 5495 . . . . . . . 8  |-  ( ( F : A --> B  /\  x  e.  A )  ->  ( ( R  o.  F ) `  x
)  =  ( R `
 ( F `  x ) ) )
74, 5, 6syl2anc 645 . . . . . . 7  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( ( R  o.  F ) `  x )  =  ( R `  ( F `
 x ) ) )
8 simprlr 742 . . . . . . . 8  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  y  e.  A )
9 fvco3 5495 . . . . . . . 8  |-  ( ( F : A --> B  /\  y  e.  A )  ->  ( ( R  o.  F ) `  y
)  =  ( R `
 ( F `  y ) ) )
104, 8, 9syl2anc 645 . . . . . . 7  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( ( R  o.  F ) `  y )  =  ( R `  ( F `
 y ) ) )
113, 7, 103eqtr4d 2298 . . . . . 6  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( ( R  o.  F ) `  x )  =  ( ( R  o.  F
) `  y )
)
12 simplr 734 . . . . . . 7  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( R  o.  F )  =  (  _I  |`  A )
)
1312fveq1d 5425 . . . . . 6  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( ( R  o.  F ) `  x )  =  ( (  _I  |`  A ) `
 x ) )
1412fveq1d 5425 . . . . . 6  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( ( R  o.  F ) `  y )  =  ( (  _I  |`  A ) `
 y ) )
1511, 13, 143eqtr3d 2296 . . . . 5  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( (  _I  |`  A ) `  x )  =  ( (  _I  |`  A ) `
 y ) )
16 fvresi 5610 . . . . . 6  |-  ( x  e.  A  ->  (
(  _I  |`  A ) `
 x )  =  x )
175, 16syl 17 . . . . 5  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( (  _I  |`  A ) `  x )  =  x )
18 fvresi 5610 . . . . . 6  |-  ( y  e.  A  ->  (
(  _I  |`  A ) `
 y )  =  y )
198, 18syl 17 . . . . 5  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  ( (  _I  |`  A ) `  y )  =  y )
2015, 17, 193eqtr3d 2296 . . . 4  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( (
x  e.  A  /\  y  e.  A )  /\  ( F `  x
)  =  ( F `
 y ) ) )  ->  x  =  y )
2120expr 601 . . 3  |-  ( ( ( F : A --> B  /\  ( R  o.  F )  =  (  _I  |`  A )
)  /\  ( x  e.  A  /\  y  e.  A ) )  -> 
( ( F `  x )  =  ( F `  y )  ->  x  =  y ) )
2221ralrimivva 2606 . 2  |-  ( ( F : A --> B  /\  ( R  o.  F
)  =  (  _I  |`  A ) )  ->  A. x  e.  A  A. y  e.  A  ( ( F `  x )  =  ( F `  y )  ->  x  =  y ) )
23 dff13 5682 . 2  |-  ( F : A -1-1-> B  <->  ( F : A --> B  /\  A. x  e.  A  A. y  e.  A  (
( F `  x
)  =  ( F `
 y )  ->  x  =  y )
) )
241, 22, 23sylanbrc 648 1  |-  ( ( F : A --> B  /\  ( R  o.  F
)  =  (  _I  |`  A ) )  ->  F : A -1-1-> B )
Colors of variables: wff set class
Syntax hints:    -> wi 6    /\ wa 360    = wceq 1619    e. wcel 1621   A.wral 2516    _I cid 4241    |` cres 4628    o. ccom 4630   -->wf 4634   -1-1->wf1 4635   ` cfv 4638
This theorem is referenced by:  fcof1o  5702  injrec2  24451
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2237  ax-sep 4081  ax-nul 4089  ax-pr 4152  ax-un 4449
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2121  df-mo 2122  df-clab 2243  df-cleq 2249  df-clel 2252  df-nfc 2381  df-ne 2421  df-ral 2520  df-rex 2521  df-rab 2523  df-v 2742  df-sbc 2936  df-dif 3097  df-un 3099  df-in 3101  df-ss 3108  df-nul 3398  df-if 3507  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3769  df-br 3964  df-opab 4018  df-id 4246  df-xp 4640  df-rel 4641  df-cnv 4642  df-co 4643  df-dm 4644  df-rn 4645  df-res 4646  df-ima 4647  df-fun 4648  df-fn 4649  df-f 4650  df-f1 4651  df-fv 4654
  Copyright terms: Public domain W3C validator