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

Theorem idmhm 13835
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 5682 . . . 4  |-  (  _I  |`  B ) : B -1-1-onto-> B
3 f1of 5642 . . . 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 2238 . . . . . . . 8  |-  ( +g  `  M )  =  ( +g  `  M )
75, 6mndcl 13795 . . . . . . 7  |-  ( ( M  e.  Mnd  /\  a  e.  B  /\  b  e.  B )  ->  ( a ( +g  `  M ) b )  e.  B )
873expb 1235 . . . . . 6  |-  ( ( M  e.  Mnd  /\  ( a  e.  B  /\  b  e.  B
) )  ->  (
a ( +g  `  M
) b )  e.  B )
9 fvresi 5911 . . . . . 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 5911 . . . . . . 7  |-  ( a  e.  B  ->  (
(  _I  |`  B ) `
 a )  =  a )
12 fvresi 5911 . . . . . . 7  |-  ( b  e.  B  ->  (
(  _I  |`  B ) `
 b )  =  b )
1311, 12oveqan12d 6107 . . . . . 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 2274 . . . 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 2632 . . 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 2238 . . . . 5  |-  ( 0g
`  M )  =  ( 0g `  M
)
185, 17mndidcl 13802 . . . 4  |-  ( M  e.  Mnd  ->  ( 0g `  M )  e.  B )
19 fvresi 5911 . . . 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 1208 . 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 13827 . 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 1213 1  |-  ( M  e.  Mnd  ->  (  _I  |`  B )  e.  ( M MndHom  M ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528    _I cid 4435    |` cres 4778   -->wf 5376   -1-1-onto->wf1o 5379   ` cfv 5380  (class class class)co 6088   Basecbs 13410   +g cplusg 13490   0gc0g 13669   Mndcmnd 13788   MndHom cmhm 13823
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1re 8279  ax-addrcl 8282
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-map 6928  df-inn 9314  df-2 9372  df-ndx 13413  df-slot 13414  df-base 13416  df-plusg 13503  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-mhm 13825
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator