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

Theorem mhmid 13868
Description: A surjective monoid morphism preserves identity element. (Contributed by Thierry Arnoux, 25-Jan-2020.)
Hypotheses
Ref Expression
ghmgrp.f  |-  ( (
ph  /\  x  e.  X  /\  y  e.  X
)  ->  ( F `  ( x  .+  y
) )  =  ( ( F `  x
)  .+^  ( F `  y ) ) )
ghmgrp.x  |-  X  =  ( Base `  G
)
ghmgrp.y  |-  Y  =  ( Base `  H
)
ghmgrp.p  |-  .+  =  ( +g  `  G )
ghmgrp.q  |-  .+^  =  ( +g  `  H )
ghmgrp.1  |-  ( ph  ->  F : X -onto-> Y
)
mhmmnd.3  |-  ( ph  ->  G  e.  Mnd )
mhmid.0  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
mhmid  |-  ( ph  ->  ( F `  .0.  )  =  ( 0g `  H ) )
Distinct variable groups:    x, F, y   
x, G, y    x,  .+ , y    x, H, y   
x, X, y    x, Y, y    x,  .+^ , y    ph, x, y    x,  .0. , y

Proof of Theorem mhmid
Dummy variables  a  i are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ghmgrp.y . 2  |-  Y  =  ( Base `  H
)
2 eqid 2234 . 2  |-  ( 0g
`  H )  =  ( 0g `  H
)
3 ghmgrp.q . 2  |-  .+^  =  ( +g  `  H )
4 ghmgrp.1 . . . 4  |-  ( ph  ->  F : X -onto-> Y
)
5 fof 5595 . . . 4  |-  ( F : X -onto-> Y  ->  F : X --> Y )
64, 5syl 14 . . 3  |-  ( ph  ->  F : X --> Y )
7 mhmmnd.3 . . . 4  |-  ( ph  ->  G  e.  Mnd )
8 ghmgrp.x . . . . 5  |-  X  =  ( Base `  G
)
9 mhmid.0 . . . . 5  |-  .0.  =  ( 0g `  G )
108, 9mndidcl 13691 . . . 4  |-  ( G  e.  Mnd  ->  .0.  e.  X )
117, 10syl 14 . . 3  |-  ( ph  ->  .0.  e.  X )
126, 11ffvelcdmd 5818 . 2  |-  ( ph  ->  ( F `  .0.  )  e.  Y )
13 simplll 535 . . . . . . 7  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ph )
14 ghmgrp.f . . . . . . 7  |-  ( (
ph  /\  x  e.  X  /\  y  e.  X
)  ->  ( F `  ( x  .+  y
) )  =  ( ( F `  x
)  .+^  ( F `  y ) ) )
1513, 14syl3an1 1307 . . . . . 6  |-  ( ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  /\  x  e.  X  /\  y  e.  X )  ->  ( F `  ( x  .+  y ) )  =  ( ( F `  x )  .+^  ( F `
 y ) ) )
167ad3antrrr 492 . . . . . . 7  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  G  e.  Mnd )
1716, 10syl 14 . . . . . 6  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  .0.  e.  X )
18 simplr 529 . . . . . 6  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  i  e.  X )
1915, 17, 18mhmlem 13867 . . . . 5  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( F `  (  .0.  .+  i
) )  =  ( ( F `  .0.  )  .+^  ( F `  i ) ) )
20 ghmgrp.p . . . . . . . 8  |-  .+  =  ( +g  `  G )
218, 20, 9mndlid 13696 . . . . . . 7  |-  ( ( G  e.  Mnd  /\  i  e.  X )  ->  (  .0.  .+  i
)  =  i )
2216, 18, 21syl2anc 411 . . . . . 6  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  (  .0.  .+  i )  =  i )
2322fveq2d 5679 . . . . 5  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( F `  (  .0.  .+  i
) )  =  ( F `  i ) )
2419, 23eqtr3d 2269 . . . 4  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( ( F `  .0.  )  .+^  ( F `  i ) )  =  ( F `
 i ) )
25 simpr 110 . . . . 5  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( F `  i )  =  a )
2625oveq2d 6074 . . . 4  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( ( F `  .0.  )  .+^  ( F `  i ) )  =  ( ( F `  .0.  )  .+^  a ) )
2724, 26, 253eqtr3d 2275 . . 3  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( ( F `  .0.  )  .+^  a )  =  a )
28 foelcdmi 5734 . . . 4  |-  ( ( F : X -onto-> Y  /\  a  e.  Y
)  ->  E. i  e.  X  ( F `  i )  =  a )
294, 28sylan 283 . . 3  |-  ( (
ph  /\  a  e.  Y )  ->  E. i  e.  X  ( F `  i )  =  a )
3027, 29r19.29a 2688 . 2  |-  ( (
ph  /\  a  e.  Y )  ->  (
( F `  .0.  )  .+^  a )  =  a )
3115, 18, 17mhmlem 13867 . . . . 5  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( F `  ( i  .+  .0.  ) )  =  ( ( F `  i
)  .+^  ( F `  .0.  ) ) )
328, 20, 9mndrid 13697 . . . . . . 7  |-  ( ( G  e.  Mnd  /\  i  e.  X )  ->  ( i  .+  .0.  )  =  i )
3316, 18, 32syl2anc 411 . . . . . 6  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( i  .+  .0.  )  =  i )
3433fveq2d 5679 . . . . 5  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( F `  ( i  .+  .0.  ) )  =  ( F `  i ) )
3531, 34eqtr3d 2269 . . . 4  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( ( F `  i )  .+^  ( F `  .0.  ) )  =  ( F `  i ) )
3625oveq1d 6073 . . . 4  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( ( F `  i )  .+^  ( F `  .0.  ) )  =  ( a  .+^  ( F `  .0.  ) ) )
3735, 36, 253eqtr3d 2275 . . 3  |-  ( ( ( ( ph  /\  a  e.  Y )  /\  i  e.  X
)  /\  ( F `  i )  =  a )  ->  ( a  .+^  ( F `  .0.  ) )  =  a )
3837, 29r19.29a 2688 . 2  |-  ( (
ph  /\  a  e.  Y )  ->  (
a  .+^  ( F `  .0.  ) )  =  a )
391, 2, 3, 12, 30, 38ismgmid2 13643 1  |-  ( ph  ->  ( F `  .0.  )  =  ( 0g `  H ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2205   E.wrex 2523   -->wf 5353   -onto->wfo 5355   ` cfv 5357  (class class class)co 6058   Basecbs 13296   +g cplusg 13374   0gc0g 13553   Mndcmnd 13677
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fo 5363  df-fv 5365  df-riota 6011  df-ov 6061  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678
This theorem is referenced by:  mhmfmhm  13870  ghmgrp  13871
  Copyright terms: Public domain W3C validator