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

Theorem ghmid 19436
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 19432 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
2 eqid 2760 . . . . . . 7 (Base‘𝑆) = (Base‘𝑆)
3 ghmid.y . . . . . . 7 𝑌 = (0g‘𝑆)
42, 3grpidcl 19176 . . . . . 6 (𝑆 ∈ Grp → 𝑌 ∈ (Base‘𝑆))
51, 4syl 18 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑌 ∈ (Base‘𝑆))
6 eqid 2760 . . . . . 6 (+g‘𝑆) = (+g‘𝑆)
7 eqid 2760 . . . . . 6 (+g‘𝑇) = (+g‘𝑇)
82, 6, 7ghmlin 19435 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑌 ∈ (Base‘𝑆) ∧ 𝑌 ∈ (Base‘𝑆)) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)))
95, 5, 8mpd3an23 1492 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)))
102, 6, 3grplid 19178 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑌 ∈ (Base‘𝑆)) → (𝑌(+g‘𝑆)𝑌) = 𝑌)
111, 5, 10syl2anc 596 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑌(+g‘𝑆)𝑌) = 𝑌)
1211fveq2d 6889 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = (𝐹‘𝑌))
139, 12eqtr3d 2797 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌))
14 ghmgrp2 19433 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
15 eqid 2760 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
162, 15ghmf 19434 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
1716, 5ffvelcdmd 7085 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) ∈ (Base‘𝑇))
18 ghmid.z . . . . 5 0 = (0g‘𝑇)
1915, 7, 18grpid 19186 . . . 4 ((𝑇 ∈ Grp ∧ (𝐹‘𝑌) ∈ (Base‘𝑇)) → (((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌) ↔ 0 = (𝐹‘𝑌)))
2014, 17, 19syl2anc 596 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌) ↔ 0 = (𝐹‘𝑌)))
2113, 20mpbid 235 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 0 = (𝐹‘𝑌))
2221eqcomd 2766 1 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) = 0 )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +gcplusg 17428  0gc0g 17610  Grpcgrp 19144   GrpHom cghm 19427
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 5326  ax-pr 5390  ax-un 7751
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-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8849  df-0g 17612  df-mgm 18816  df-sgrp 18908  df-mnd 18924  df-grp 19147  df-ghm 19428
This theorem is used by:  ghminv  19437  ghmmhm  19440  ghmpreima  19452  f1ghm0to0  19459  kerf1ghm  19461  ghmqusker  19501  lactghmga  19619  nrhmzr  20789  zrinitorngc  20894  imadrhmcl  21054  srng0  21111  islmhm2  21313  zrh0  21819  chrrhm  21837  zndvds0  21856  ip0l  21942  evlslem2  22388  evlslem3  22389  evlslem6  22390  rhmmpl  22698  rhmply1vr1  22702  0mat2pmat  23054  nmolb2d  25037  nmoi  25047  nmoix  25048  nmoleub  25050  nmoleub2lem2  25437  nmhmcn  25441  dchrptlem2  27592  psgnid  33700  ricnzr1  33891  ricdomn1  33892  mplidomlem  34201  dimkerim  34301  lvecendof1f1o  34307  ricdrng1  43635  rhmpsr  43654
  Copyright terms: Public domain W3C validator