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

Theorem ghmmhm 14115
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 14107 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
21grpmndd 13877 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Mnd)
3 ghmgrp2 14108 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
43grpmndd 13877 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Mnd)
5 eqid 2238 . . . 4 (Base‘𝑆) = (Base‘𝑆)
6 eqid 2238 . . . 4 (Base‘𝑇) = (Base‘𝑇)
75, 6ghmf 14109 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
8 eqid 2238 . . . . . 6 (+g‘𝑆) = (+g‘𝑆)
9 eqid 2238 . . . . . 6 (+g‘𝑇) = (+g‘𝑇)
105, 8, 9ghmlin 14110 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
11103expb 1235 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
1211ralrimivva 2632 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
13 eqid 2238 . . . 4 (0g‘𝑆) = (0g‘𝑆)
14 eqid 2238 . . . 4 (0g‘𝑇) = (0g‘𝑇)
1513, 14ghmid 14111 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
167, 12, 153jca 1208 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇)))
175, 6, 8, 9, 13, 14ismhm 13827 . 2 (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))))
182, 4, 16, 17syl21anbrc 1213 1 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹 ∈ (𝑆 MndHom 𝑇))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ⟶wf 5376  ‘cfv 5380  (class class class)co 6088  Basecbs 13410  +gcplusg 13490  0gc0g 13669  Mndcmnd 13788   MndHom cmhm 13823   GrpHom cghm 14102
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-coll 4248  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  df-grp 13867  df-ghm 14103
This theorem is used by:  ghmmhmb  14116  ghmmulg  14118  resghm2  14123  ghmco  14126  ghmeql  14129  gsummulc1fi  14475  gsummulc2fi  14476  lgseisenlem4  16397
  Copyright terms: Public domain W3C validator