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

Theorem ghmid 19291
Description: A homomorphism of groups preserves the identity. (Contributed by Stefan O'Rear, 31-Dec-2014.)
Hypotheses
Ref Expression
ghmid.y 𝑌 = (0g𝑆)
ghmid.z 0 = (0g𝑇)
Assertion
Ref Expression
ghmid (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹𝑌) = 0 )

Proof of Theorem ghmid
StepHypRef Expression
1 ghmgrp1 19287 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
2 eqid 2761 . . . . . . 7 (Base‘𝑆) = (Base‘𝑆)
3 ghmid.y . . . . . . 7 𝑌 = (0g𝑆)
42, 3grpidcl 19031 . . . . . 6 (𝑆 ∈ Grp → 𝑌 ∈ (Base‘𝑆))
51, 4syl 18 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑌 ∈ (Base‘𝑆))
6 eqid 2761 . . . . . 6 (+g𝑆) = (+g𝑆)
7 eqid 2761 . . . . . 6 (+g𝑇) = (+g𝑇)
82, 6, 7ghmlin 19290 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑌 ∈ (Base‘𝑆) ∧ 𝑌 ∈ (Base‘𝑆)) → (𝐹‘(𝑌(+g𝑆)𝑌)) = ((𝐹𝑌)(+g𝑇)(𝐹𝑌)))
95, 5, 8mpd3an23 1490 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g𝑆)𝑌)) = ((𝐹𝑌)(+g𝑇)(𝐹𝑌)))
102, 6, 3grplid 19033 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑌 ∈ (Base‘𝑆)) → (𝑌(+g𝑆)𝑌) = 𝑌)
111, 5, 10syl2anc 595 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑌(+g𝑆)𝑌) = 𝑌)
1211fveq2d 6885 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g𝑆)𝑌)) = (𝐹𝑌))
139, 12eqtr3d 2798 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → ((𝐹𝑌)(+g𝑇)(𝐹𝑌)) = (𝐹𝑌))
14 ghmgrp2 19288 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
15 eqid 2761 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
162, 15ghmf 19289 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
1716, 5ffvelcdmd 7080 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹𝑌) ∈ (Base‘𝑇))
18 ghmid.z . . . . 5 0 = (0g𝑇)
1915, 7, 18grpid 19041 . . . 4 ((𝑇 ∈ Grp ∧ (𝐹𝑌) ∈ (Base‘𝑇)) → (((𝐹𝑌)(+g𝑇)(𝐹𝑌)) = (𝐹𝑌) ↔ 0 = (𝐹𝑌)))
2014, 17, 19syl2anc 595 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (((𝐹𝑌)(+g𝑇)(𝐹𝑌)) = (𝐹𝑌) ↔ 0 = (𝐹𝑌)))
2113, 20mpbid 235 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 0 = (𝐹𝑌))
2221eqcomd 2767 1 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹𝑌) = 0 )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1568  wcel 2141  cfv 6536  (class class class)co 7410  Basecbs 17268  +gcplusg 17309  0gc0g 17491  Grpcgrp 18999   GrpHom cghm 19282
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7985  df-2nd 7986  df-map 8825  df-0g 17493  df-mgm 18697  df-sgrp 18776  df-mnd 18792  df-grp 19002  df-ghm 19283
This theorem is referenced by:  ghminv  19292  ghmmhm  19295  ghmpreima  19307  f1ghm0to0  19314  kerf1ghm  19316  ghmqusker  19356  lactghmga  19474  nrhmzr  20621  zrinitorngc  20726  imadrhmcl  20879  srng0  20936  islmhm2  21138  zrh0  21642  chrrhm  21660  zndvds0  21679  ip0l  21765  evlslem2  22209  evlslem3  22210  evlslem6  22211  rhmmpl  22519  rhmply1vr1  22523  0mat2pmat  22872  nmolb2d  24854  nmoi  24864  nmoix  24865  nmoleub  24867  nmoleub2lem2  25254  nmhmcn  25258  dchrptlem2  27405  psgnid  33383  ricnzr1  33574  ricdomn1  33575  mplidomlem  33883  dimkerim  33983  lvecendof1f1o  33989  ricdrng1  43244  rhmpsr  43263
  Copyright terms: Public domain W3C validator