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

Theorem idmhm 12865
Description: The identity homomorphism on a monoid. (Contributed by AV, 14-Feb-2020.)
Hypothesis
Ref Expression
idmhm.b  |-  B  =  ( Base `  M
)
Assertion
Ref Expression
idmhm  |-  ( M  e.  Mnd  ->  (  _I  |`  B )  e.  ( M MndHom  M ) )

Proof of Theorem idmhm
Dummy variables  a  b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 id 19 . 2  |-  ( M  e.  Mnd  ->  M  e.  Mnd )
2 f1oi 5501 . . . 4  |-  (  _I  |`  B ) : B -1-1-onto-> B
3 f1of 5463 . . . 4  |-  ( (  _I  |`  B ) : B -1-1-onto-> B  ->  (  _I  |`  B ) : B --> B )
42, 3mp1i 10 . . 3  |-  ( M  e.  Mnd  ->  (  _I  |`  B ) : B --> B )
5 idmhm.b . . . . . . . 8  |-  B  =  ( Base `  M
)
6 eqid 2177 . . . . . . . 8  |-  ( +g  `  M )  =  ( +g  `  M )
75, 6mndcl 12829 . . . . . . 7  |-  ( ( M  e.  Mnd  /\  a  e.  B  /\  b  e.  B )  ->  ( a ( +g  `  M ) b )  e.  B )
873expb 1204 . . . . . 6  |-  ( ( M  e.  Mnd  /\  ( a  e.  B  /\  b  e.  B
) )  ->  (
a ( +g  `  M
) b )  e.  B )
9 fvresi 5711 . . . . . 6  |-  ( ( a ( +g  `  M
) b )  e.  B  ->  ( (  _I  |`  B ) `  ( a ( +g  `  M ) b ) )  =  ( a ( +g  `  M
) b ) )
108, 9syl 14 . . . . 5  |-  ( ( M  e.  Mnd  /\  ( a  e.  B  /\  b  e.  B
) )  ->  (
(  _I  |`  B ) `
 ( a ( +g  `  M ) b ) )  =  ( a ( +g  `  M ) b ) )
11 fvresi 5711 . . . . . . 7  |-  ( a  e.  B  ->  (
(  _I  |`  B ) `
 a )  =  a )
12 fvresi 5711 . . . . . . 7  |-  ( b  e.  B  ->  (
(  _I  |`  B ) `
 b )  =  b )
1311, 12oveqan12d 5896 . . . . . 6  |-  ( ( a  e.  B  /\  b  e.  B )  ->  ( ( (  _I  |`  B ) `  a
) ( +g  `  M
) ( (  _I  |`  B ) `  b
) )  =  ( a ( +g  `  M
) b ) )
1413adantl 277 . . . . 5  |-  ( ( M  e.  Mnd  /\  ( a  e.  B  /\  b  e.  B
) )  ->  (
( (  _I  |`  B ) `
 a ) ( +g  `  M ) ( (  _I  |`  B ) `
 b ) )  =  ( a ( +g  `  M ) b ) )
1510, 14eqtr4d 2213 . . . 4  |-  ( ( M  e.  Mnd  /\  ( a  e.  B  /\  b  e.  B
) )  ->  (
(  _I  |`  B ) `
 ( a ( +g  `  M ) b ) )  =  ( ( (  _I  |`  B ) `  a
) ( +g  `  M
) ( (  _I  |`  B ) `  b
) ) )
1615ralrimivva 2559 . . 3  |-  ( M  e.  Mnd  ->  A. a  e.  B  A. b  e.  B  ( (  _I  |`  B ) `  ( a ( +g  `  M ) b ) )  =  ( ( (  _I  |`  B ) `
 a ) ( +g  `  M ) ( (  _I  |`  B ) `
 b ) ) )
17 eqid 2177 . . . . 5  |-  ( 0g
`  M )  =  ( 0g `  M
)
185, 17mndidcl 12836 . . . 4  |-  ( M  e.  Mnd  ->  ( 0g `  M )  e.  B )
19 fvresi 5711 . . . 4  |-  ( ( 0g `  M )  e.  B  ->  (
(  _I  |`  B ) `
 ( 0g `  M ) )  =  ( 0g `  M
) )
2018, 19syl 14 . . 3  |-  ( M  e.  Mnd  ->  (
(  _I  |`  B ) `
 ( 0g `  M ) )  =  ( 0g `  M
) )
214, 16, 203jca 1177 . 2  |-  ( M  e.  Mnd  ->  (
(  _I  |`  B ) : B --> B  /\  A. a  e.  B  A. b  e.  B  (
(  _I  |`  B ) `
 ( a ( +g  `  M ) b ) )  =  ( ( (  _I  |`  B ) `  a
) ( +g  `  M
) ( (  _I  |`  B ) `  b
) )  /\  (
(  _I  |`  B ) `
 ( 0g `  M ) )  =  ( 0g `  M
) ) )
225, 5, 6, 6, 17, 17ismhm 12858 . 2  |-  ( (  _I  |`  B )  e.  ( M MndHom  M )  <-> 
( ( M  e. 
Mnd  /\  M  e.  Mnd )  /\  (
(  _I  |`  B ) : B --> B  /\  A. a  e.  B  A. b  e.  B  (
(  _I  |`  B ) `
 ( a ( +g  `  M ) b ) )  =  ( ( (  _I  |`  B ) `  a
) ( +g  `  M
) ( (  _I  |`  B ) `  b
) )  /\  (
(  _I  |`  B ) `
 ( 0g `  M ) )  =  ( 0g `  M
) ) ) )
231, 1, 21, 22syl21anbrc 1182 1  |-  ( M  e.  Mnd  ->  (  _I  |`  B )  e.  ( M MndHom  M ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 978    = wceq 1353    e. wcel 2148   A.wral 2455    _I cid 4290    |` cres 4630   -->wf 5214   -1-1-onto->wf1o 5217   ` cfv 5218  (class class class)co 5877   Basecbs 12464   +g cplusg 12538   0gc0g 12710   Mndcmnd 12822   MndHom cmhm 12854
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-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1re 7907  ax-addrcl 7910
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-map 6652  df-inn 8922  df-2 8980  df-ndx 12467  df-slot 12468  df-base 12470  df-plusg 12551  df-0g 12712  df-mgm 12780  df-sgrp 12813  df-mnd 12823  df-mhm 12856
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator