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

Theorem ghmmhm 13970
Description: A group homomorphism is a monoid homomorphism. (Contributed by Stefan O'Rear, 7-Mar-2015.)
Assertion
Ref Expression
ghmmhm (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹 ∈ (𝑆 MndHom 𝑇))

Proof of Theorem ghmmhm
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ghmgrp1 13962 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
21grpmndd 13726 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Mnd)
3 ghmgrp2 13963 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
43grpmndd 13726 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Mnd)
5 eqid 2232 . . . 4 (Base‘𝑆) = (Base‘𝑆)
6 eqid 2232 . . . 4 (Base‘𝑇) = (Base‘𝑇)
75, 6ghmf 13964 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
8 eqid 2232 . . . . . 6 (+g𝑆) = (+g𝑆)
9 eqid 2232 . . . . . 6 (+g𝑇) = (+g𝑇)
105, 8, 9ghmlin 13965 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
11103expb 1231 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
1211ralrimivva 2624 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
13 eqid 2232 . . . 4 (0g𝑆) = (0g𝑆)
14 eqid 2232 . . . 4 (0g𝑇) = (0g𝑇)
1513, 14ghmid 13966 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
167, 12, 153jca 1204 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)) ∧ (𝐹‘(0g𝑆)) = (0g𝑇)))
175, 6, 8, 9, 13, 14ismhm 13674 . 2 (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)) ∧ (𝐹‘(0g𝑆)) = (0g𝑇))))
182, 4, 16, 17syl21anbrc 1209 1 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹 ∈ (𝑆 MndHom 𝑇))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 1005   = wceq 1398  wcel 2203  wral 2520  wf 5348  cfv 5352  (class class class)co 6050  Basecbs 13212  +gcplusg 13290  0gc0g 13469  Mndcmnd 13629   MndHom cmhm 13670   GrpHom cghm 13957
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 619  ax-in2 620  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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-map 6884  df-inn 9238  df-2 9296  df-ndx 13215  df-slot 13216  df-base 13218  df-plusg 13303  df-0g 13471  df-mgm 13569  df-sgrp 13615  df-mnd 13630  df-mhm 13672  df-grp 13716  df-ghm 13958
This theorem is referenced by:  ghmmhmb  13971  ghmmulg  13973  resghm2  13978  ghmco  13981  ghmeql  13984  lgseisenlem4  15946
  Copyright terms: Public domain W3C validator