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

Theorem ghmid 13955
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 13951 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
2 eqid 2232 . . . . . . 7 (Base‘𝑆) = (Base‘𝑆)
3 ghmid.y . . . . . . 7 𝑌 = (0g𝑆)
42, 3grpidcl 13731 . . . . . 6 (𝑆 ∈ Grp → 𝑌 ∈ (Base‘𝑆))
51, 4syl 14 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑌 ∈ (Base‘𝑆))
6 eqid 2232 . . . . . 6 (+g𝑆) = (+g𝑆)
7 eqid 2232 . . . . . 6 (+g𝑇) = (+g𝑇)
82, 6, 7ghmlin 13954 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑌 ∈ (Base‘𝑆) ∧ 𝑌 ∈ (Base‘𝑆)) → (𝐹‘(𝑌(+g𝑆)𝑌)) = ((𝐹𝑌)(+g𝑇)(𝐹𝑌)))
95, 5, 8mpd3an23 1376 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g𝑆)𝑌)) = ((𝐹𝑌)(+g𝑇)(𝐹𝑌)))
102, 6, 3grplid 13733 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑌 ∈ (Base‘𝑆)) → (𝑌(+g𝑆)𝑌) = 𝑌)
111, 5, 10syl2anc 411 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑌(+g𝑆)𝑌) = 𝑌)
1211fveq2d 5673 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(𝑌(+g𝑆)𝑌)) = (𝐹𝑌))
139, 12eqtr3d 2267 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → ((𝐹𝑌)(+g𝑇)(𝐹𝑌)) = (𝐹𝑌))
14 ghmgrp2 13952 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
15 eqid 2232 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
162, 15ghmf 13953 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
1716, 5ffvelcdmd 5812 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹𝑌) ∈ (Base‘𝑇))
18 ghmid.z . . . . 5 0 = (0g𝑇)
1915, 7, 18grpid 13741 . . . 4 ((𝑇 ∈ Grp ∧ (𝐹𝑌) ∈ (Base‘𝑇)) → (((𝐹𝑌)(+g𝑇)(𝐹𝑌)) = (𝐹𝑌) ↔ 0 = (𝐹𝑌)))
2014, 17, 19syl2anc 411 . . 3 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (((𝐹𝑌)(+g𝑇)(𝐹𝑌)) = (𝐹𝑌) ↔ 0 = (𝐹𝑌)))
2113, 20mpbid 147 . 2 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 0 = (𝐹𝑌))
2221eqcomd 2238 1 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹𝑌) = 0 )
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1398  wcel 2203  cfv 5351  (class class class)co 6049  Basecbs 13201  +gcplusg 13279  0gc0g 13458  Grpcgrp 13702   GrpHom cghm 13946
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 4224  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-1re 8217  ax-addrcl 8220
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 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-inn 9234  df-2 9292  df-ndx 13204  df-slot 13205  df-base 13207  df-plusg 13292  df-0g 13460  df-mgm 13558  df-sgrp 13604  df-mnd 13619  df-grp 13705  df-ghm 13947
This theorem is referenced by:  ghminv  13956  ghmmhm  13959  ghmpreima  13972  f1ghm0to0  13978  kerf1ghm  13980  zrh0  14760  zndvds0  14785
  Copyright terms: Public domain W3C validator