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

Theorem ghmid 19397
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 19393 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
2 eqid 2760 . . . . . . 7 (Base‘𝑆) = (Base‘𝑆)
3 ghmid.y . . . . . . 7 𝑌 = (0g‘𝑆)
42, 3grpidcl 19137 . . . . . 6 (𝑆 ∈ Grp → 𝑌 ∈ (Base‘𝑆))
51, 4syl 18 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑌 ∈ (Base‘𝑆))
6 eqid 2760 . . . . . 6 (+g‘𝑆) = (+g‘𝑆)
7 eqid 2760 . . . . . 6 (+g‘𝑇) = (+g‘𝑇)
82, 6, 7ghmlin 19396 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑌 ∈ (Base‘𝑆) ∧ 𝑌 ∈ (Base‘𝑆)) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)))
95, 5, 8mpd3an23 1492 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)))
102, 6, 3grplid 19139 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑌 ∈ (Base‘𝑆)) → (𝑌(+g‘𝑆)𝑌) = 𝑌)
111, 5, 10syl2anc 596 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑌(+g‘𝑆)𝑌) = 𝑌)
1211fveq2d 6877 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g‘𝑆)𝑌)) = (𝐹‘𝑌))
139, 12eqtr3d 2797 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → ((𝐹‘𝑌)(+g‘𝑇)(𝐹‘𝑌)) = (𝐹‘𝑌))
14 ghmgrp2 19394 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
15 eqid 2760 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
162, 15ghmf 19395 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
1716, 5ffvelcdmd 7073 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘𝑌) ∈ (Base‘𝑇))
18 ghmid.z . . . . 5 0 = (0g‘𝑇)
1915, 7, 18grpid 19147 . . . 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 1570   ∈ wcel 2145  ‘cfv 6527  (class class class)co 7408  Basecbs 17348  +gcplusg 17389  0gc0g 17571  Grpcgrp 19105   GrpHom cghm 19388
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 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  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 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-map 8827  df-0g 17573  df-mgm 18777  df-sgrp 18869  df-mnd 18885  df-grp 19108  df-ghm 19389
This theorem is used by:  ghminv  19398  ghmmhm  19401  ghmpreima  19413  f1ghm0to0  19420  kerf1ghm  19422  ghmqusker  19462  lactghmga  19580  nrhmzr  20750  zrinitorngc  20855  imadrhmcl  21015  srng0  21072  islmhm2  21274  zrh0  21780  chrrhm  21798  zndvds0  21817  ip0l  21903  evlslem2  22349  evlslem3  22350  evlslem6  22351  rhmmpl  22659  rhmply1vr1  22663  0mat2pmat  23015  nmolb2d  24998  nmoi  25008  nmoix  25009  nmoleub  25011  nmoleub2lem2  25398  nmhmcn  25402  dchrptlem2  27555  psgnid  33591  ricnzr1  33782  ricdomn1  33783  mplidomlem  34092  dimkerim  34192  lvecendof1f1o  34198  ricdrng1  43514  rhmpsr  43533
  Copyright terms: Public domain W3C validator