MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  idmhm Structured version   Visualization version   GIF version

Theorem idmhm 18999
Description: The identity homomorphism on a monoid. (Contributed by AV, 14-Feb-2020.)
Hypothesis
Ref Expression
idmhm.b 𝐵 = (Base‘𝑀)
Assertion
Ref Expression
idmhm (𝑀 ∈ Mnd → ( I ↾ 𝐵) ∈ (𝑀 MndHom 𝑀))

Proof of Theorem idmhm
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 id 23 . 2 (𝑀 ∈ Mnd → 𝑀 ∈ Mnd)
2 f1oi 6868 . . . 4 ( I ↾ 𝐵):𝐵–1-1-onto→𝐵
3 f1of 6829 . . . 4 (( I ↾ 𝐵):𝐵–1-1-onto→𝐵 → ( I ↾ 𝐵):𝐵⟶𝐵)
42, 3mp1i 14 . . 3 (𝑀 ∈ Mnd → ( I ↾ 𝐵):𝐵⟶𝐵)
5 idmhm.b . . . . . . . 8 𝐵 = (Base‘𝑀)
6 eqid 2760 . . . . . . . 8 (+g‘𝑀) = (+g‘𝑀)
75, 6mndcl 18940 . . . . . . 7 ((𝑀 ∈ Mnd ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)
873expb 1138 . . . . . 6 ((𝑀 ∈ Mnd ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)
9 fvresi 7182 . . . . . 6 ((𝑎(+g‘𝑀)𝑏) ∈ 𝐵 → (( I ↾ 𝐵)‘(𝑎(+g‘𝑀)𝑏)) = (𝑎(+g‘𝑀)𝑏))
108, 9syl 18 . . . . 5 ((𝑀 ∈ Mnd ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (( I ↾ 𝐵)‘(𝑎(+g‘𝑀)𝑏)) = (𝑎(+g‘𝑀)𝑏))
11 fvresi 7182 . . . . . . 7 (𝑎 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑎) = 𝑎)
12 fvresi 7182 . . . . . . 7 (𝑏 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑏) = 𝑏)
1311, 12oveqan12d 7443 . . . . . 6 ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → ((( I ↾ 𝐵)‘𝑎)(+g‘𝑀)(( I ↾ 𝐵)‘𝑏)) = (𝑎(+g‘𝑀)𝑏))
1413adantl 487 . . . . 5 ((𝑀 ∈ Mnd ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ((( I ↾ 𝐵)‘𝑎)(+g‘𝑀)(( I ↾ 𝐵)‘𝑏)) = (𝑎(+g‘𝑀)𝑏))
1510, 14eqtr4d 2798 . . . 4 ((𝑀 ∈ Mnd ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (( I ↾ 𝐵)‘(𝑎(+g‘𝑀)𝑏)) = ((( I ↾ 𝐵)‘𝑎)(+g‘𝑀)(( I ↾ 𝐵)‘𝑏)))
1615ralrimivva 3205 . . 3 (𝑀 ∈ Mnd → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (( I ↾ 𝐵)‘(𝑎(+g‘𝑀)𝑏)) = ((( I ↾ 𝐵)‘𝑎)(+g‘𝑀)(( I ↾ 𝐵)‘𝑏)))
17 eqid 2760 . . . . 5 (0g‘𝑀) = (0g‘𝑀)
185, 17mndidcl 18948 . . . 4 (𝑀 ∈ Mnd → (0g‘𝑀) ∈ 𝐵)
19 fvresi 7182 . . . 4 ((0g‘𝑀) ∈ 𝐵 → (( I ↾ 𝐵)‘(0g‘𝑀)) = (0g‘𝑀))
2018, 19syl 18 . . 3 (𝑀 ∈ Mnd → (( I ↾ 𝐵)‘(0g‘𝑀)) = (0g‘𝑀))
214, 16, 203jca 1146 . 2 (𝑀 ∈ Mnd → (( I ↾ 𝐵):𝐵⟶𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (( I ↾ 𝐵)‘(𝑎(+g‘𝑀)𝑏)) = ((( I ↾ 𝐵)‘𝑎)(+g‘𝑀)(( I ↾ 𝐵)‘𝑏)) ∧ (( I ↾ 𝐵)‘(0g‘𝑀)) = (0g‘𝑀)))
225, 5, 6, 6, 17, 17ismhm 18989 . 2 (( I ↾ 𝐵) ∈ (𝑀 MndHom 𝑀) ↔ ((𝑀 ∈ Mnd ∧ 𝑀 ∈ Mnd) ∧ (( I ↾ 𝐵):𝐵⟶𝐵 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (( I ↾ 𝐵)‘(𝑎(+g‘𝑀)𝑏)) = ((( I ↾ 𝐵)‘𝑎)(+g‘𝑀)(( I ↾ 𝐵)‘𝑏)) ∧ (( I ↾ 𝐵)‘(0g‘𝑀)) = (0g‘𝑀))))
231, 1, 21, 22syl21anbrc 1363 1 (𝑀 ∈ Mnd → ( I ↾ 𝐵) ∈ (𝑀 MndHom 𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076   I cid 5545   ↾ cres 5653  ⟶wf 6539  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  +gcplusg 17437  0gc0g 17619  Mndcmnd 18932   MndHom cmhm 18985
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-map 8857  df-0g 17621  df-mgm 18825  df-sgrp 18917  df-mnd 18933  df-mhm 18987
This theorem is used by:  idrhm  20734
  Copyright terms: Public domain W3C validator