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

Theorem mhmismgmhm 18902
Description: Each monoid homomorphism is a magma homomorphism. (Contributed by AV, 29-Feb-2020.)
Assertion
Ref Expression
mhmismgmhm (𝐹 ∈ (𝑅 MndHom 𝑆) → 𝐹 ∈ (𝑅 MgmHom 𝑆))

Proof of Theorem mhmismgmhm
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mndmgm 18846 . . . 4 (𝑅 ∈ Mnd → 𝑅 ∈ Mgm)
2 mndmgm 18846 . . . 4 (𝑆 ∈ Mnd → 𝑆 ∈ Mgm)
31, 2anim12i 625 . . 3 ((𝑅 ∈ Mnd ∧ 𝑆 ∈ Mnd) → (𝑅 ∈ Mgm ∧ 𝑆 ∈ Mgm))
4 3simpa 1166 . . 3 ((𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(+g𝑅)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦)) ∧ (𝐹‘(0g𝑅)) = (0g𝑆)) → (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(+g𝑅)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦))))
53, 4anim12i 625 . 2 (((𝑅 ∈ Mnd ∧ 𝑆 ∈ Mnd) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(+g𝑅)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦)) ∧ (𝐹‘(0g𝑅)) = (0g𝑆))) → ((𝑅 ∈ Mgm ∧ 𝑆 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(+g𝑅)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦)))))
6 eqid 2760 . . 3 (Base‘𝑅) = (Base‘𝑅)
7 eqid 2760 . . 3 (Base‘𝑆) = (Base‘𝑆)
8 eqid 2760 . . 3 (+g𝑅) = (+g𝑅)
9 eqid 2760 . . 3 (+g𝑆) = (+g𝑆)
10 eqid 2760 . . 3 (0g𝑅) = (0g𝑅)
11 eqid 2760 . . 3 (0g𝑆) = (0g𝑆)
126, 7, 8, 9, 10, 11ismhm 18896 . 2 (𝐹 ∈ (𝑅 MndHom 𝑆) ↔ ((𝑅 ∈ Mnd ∧ 𝑆 ∈ Mnd) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(+g𝑅)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦)) ∧ (𝐹‘(0g𝑅)) = (0g𝑆))))
136, 7, 8, 9ismgmhm 18801 . 2 (𝐹 ∈ (𝑅 MgmHom 𝑆) ↔ ((𝑅 ∈ Mgm ∧ 𝑆 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(+g𝑅)𝑦)) = ((𝐹𝑥)(+g𝑆)(𝐹𝑦)))))
145, 12, 133imtr4i 295 1 (𝐹 ∈ (𝑅 MndHom 𝑆) → 𝐹 ∈ (𝑅 MgmHom 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3076  wf 6529  cfv 6533  (class class class)co 7414  Basecbs 17304  +gcplusg 17345  0gc0g 17527  Mgmcmgm 18731   MgmHom cmgmhm 18795  Mndcmnd 18839   MndHom cmhm 18892
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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-rab 3413  df-v 3452  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-map 8831  df-mgmhm 18797  df-sgrp 18824  df-mnd 18840  df-mhm 18894
This theorem is used by:  rhmisrnghm  20625
  Copyright terms: Public domain W3C validator