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

Theorem mndfo 14725
Description: The addition operation of a monoid is an onto function (assuming it is a function). (Contributed by Mario Carneiro, 11-Oct-2013.)
Hypotheses
Ref Expression
mndfo.b  |-  B  =  ( Base `  G
)
mndfo.p  |-  .+  =  ( +g  `  G )
Assertion
Ref Expression
mndfo  |-  ( ( G  e.  Mnd  /\  .+  Fn  ( B  X.  B ) )  ->  .+  : ( B  X.  B ) -onto-> B )

Proof of Theorem mndfo
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 449 . . 3  |-  ( ( G  e.  Mnd  /\  .+  Fn  ( B  X.  B ) )  ->  .+  Fn  ( B  X.  B ) )
2 mndfo.b . . . . . . 7  |-  B  =  ( Base `  G
)
3 mndfo.p . . . . . . 7  |-  .+  =  ( +g  `  G )
42, 3mndcl 14700 . . . . . 6  |-  ( ( G  e.  Mnd  /\  x  e.  B  /\  y  e.  B )  ->  ( x  .+  y
)  e.  B )
543expb 1155 . . . . 5  |-  ( ( G  e.  Mnd  /\  ( x  e.  B  /\  y  e.  B
) )  ->  (
x  .+  y )  e.  B )
65ralrimivva 2800 . . . 4  |-  ( G  e.  Mnd  ->  A. x  e.  B  A. y  e.  B  ( x  .+  y )  e.  B
)
76adantr 453 . . 3  |-  ( ( G  e.  Mnd  /\  .+  Fn  ( B  X.  B ) )  ->  A. x  e.  B  A. y  e.  B  ( x  .+  y )  e.  B )
8 ffnov 6177 . . 3  |-  (  .+  : ( B  X.  B ) --> B  <->  (  .+  Fn  ( B  X.  B
)  /\  A. x  e.  B  A. y  e.  B  ( x  .+  y )  e.  B
) )
91, 7, 8sylanbrc 647 . 2  |-  ( ( G  e.  Mnd  /\  .+  Fn  ( B  X.  B ) )  ->  .+  : ( B  X.  B ) --> B )
10 simpr 449 . . . . 5  |-  ( ( G  e.  Mnd  /\  x  e.  B )  ->  x  e.  B )
11 eqid 2438 . . . . . . 7  |-  ( 0g
`  G )  =  ( 0g `  G
)
122, 11mndidcl 14719 . . . . . 6  |-  ( G  e.  Mnd  ->  ( 0g `  G )  e.  B )
1312adantr 453 . . . . 5  |-  ( ( G  e.  Mnd  /\  x  e.  B )  ->  ( 0g `  G
)  e.  B )
142, 3, 11mndrid 14722 . . . . . 6  |-  ( ( G  e.  Mnd  /\  x  e.  B )  ->  ( x  .+  ( 0g `  G ) )  =  x )
1514eqcomd 2443 . . . . 5  |-  ( ( G  e.  Mnd  /\  x  e.  B )  ->  x  =  ( x 
.+  ( 0g `  G ) ) )
16 rspceov 6119 . . . . 5  |-  ( ( x  e.  B  /\  ( 0g `  G )  e.  B  /\  x  =  ( x  .+  ( 0g `  G ) ) )  ->  E. y  e.  B  E. z  e.  B  x  =  ( y  .+  z
) )
1710, 13, 15, 16syl3anc 1185 . . . 4  |-  ( ( G  e.  Mnd  /\  x  e.  B )  ->  E. y  e.  B  E. z  e.  B  x  =  ( y  .+  z ) )
1817ralrimiva 2791 . . 3  |-  ( G  e.  Mnd  ->  A. x  e.  B  E. y  e.  B  E. z  e.  B  x  =  ( y  .+  z
) )
1918adantr 453 . 2  |-  ( ( G  e.  Mnd  /\  .+  Fn  ( B  X.  B ) )  ->  A. x  e.  B  E. y  e.  B  E. z  e.  B  x  =  ( y  .+  z ) )
20 foov 6223 . 2  |-  (  .+  : ( B  X.  B ) -onto-> B  <->  (  .+  : ( B  X.  B ) --> B  /\  A. x  e.  B  E. y  e.  B  E. z  e.  B  x  =  ( y  .+  z ) ) )
219, 19, 20sylanbrc 647 1  |-  ( ( G  e.  Mnd  /\  .+  Fn  ( B  X.  B ) )  ->  .+  : ( B  X.  B ) -onto-> B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 360    = wceq 1653    e. wcel 1726   A.wral 2707   E.wrex 2708    X. cxp 4879    Fn wfn 5452   -->wf 5453   -onto->wfo 5455   ` cfv 5457  (class class class)co 6084   Basecbs 13474   +g cplusg 13534   0gc0g 13728   Mndcmnd 14689
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-sep 4333  ax-nul 4341  ax-pow 4380  ax-pr 4406
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-mo 2288  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2712  df-rex 2713  df-reu 2714  df-rmo 2715  df-rab 2716  df-v 2960  df-sbc 3164  df-csb 3254  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-sn 3822  df-pr 3823  df-op 3825  df-uni 4018  df-iun 4097  df-br 4216  df-opab 4270  df-mpt 4271  df-id 4501  df-xp 4887  df-rel 4888  df-cnv 4889  df-co 4890  df-dm 4891  df-rn 4892  df-iota 5421  df-fun 5459  df-fn 5460  df-f 5461  df-fo 5463  df-fv 5465  df-ov 6087  df-riota 6552  df-0g 13732  df-mnd 14695
  Copyright terms: Public domain W3C validator