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

Theorem ghminv 14003
Description: A homomorphism of groups preserves inverses. (Contributed by Stefan O'Rear, 31-Dec-2014.)
Hypotheses
Ref Expression
ghminv.b 𝐵 = (Base‘𝑆)
ghminv.y 𝑀 = (invg𝑆)
ghminv.z 𝑁 = (invg𝑇)
Assertion
Ref Expression
ghminv ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑀𝑋)) = (𝑁‘(𝐹𝑋)))

Proof of Theorem ghminv
StepHypRef Expression
1 ghmgrp1 13998 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
2 ghminv.b . . . . . . 7 𝐵 = (Base‘𝑆)
3 eqid 2234 . . . . . . 7 (+g𝑆) = (+g𝑆)
4 eqid 2234 . . . . . . 7 (0g𝑆) = (0g𝑆)
5 ghminv.y . . . . . . 7 𝑀 = (invg𝑆)
62, 3, 4, 5grprinv 13806 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑋𝐵) → (𝑋(+g𝑆)(𝑀𝑋)) = (0g𝑆))
71, 6sylan 283 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝑋(+g𝑆)(𝑀𝑋)) = (0g𝑆))
87fveq2d 5679 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑋(+g𝑆)(𝑀𝑋))) = (𝐹‘(0g𝑆)))
92, 5grpinvcl 13803 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑋𝐵) → (𝑀𝑋) ∈ 𝐵)
101, 9sylan 283 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝑀𝑋) ∈ 𝐵)
11 eqid 2234 . . . . . 6 (+g𝑇) = (+g𝑇)
122, 3, 11ghmlin 14001 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵 ∧ (𝑀𝑋) ∈ 𝐵) → (𝐹‘(𝑋(+g𝑆)(𝑀𝑋))) = ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))))
1310, 12mpd3an3 1375 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑋(+g𝑆)(𝑀𝑋))) = ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))))
14 eqid 2234 . . . . . 6 (0g𝑇) = (0g𝑇)
154, 14ghmid 14002 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
1615adantr 276 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(0g𝑆)) = (0g𝑇))
178, 13, 163eqtr3d 2275 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))) = (0g𝑇))
18 ghmgrp2 13999 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
1918adantr 276 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → 𝑇 ∈ Grp)
20 eqid 2234 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
212, 20ghmf 14000 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:𝐵⟶(Base‘𝑇))
2221ffvelcdmda 5817 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹𝑋) ∈ (Base‘𝑇))
2321adantr 276 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → 𝐹:𝐵⟶(Base‘𝑇))
2423, 10ffvelcdmd 5818 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑀𝑋)) ∈ (Base‘𝑇))
25 ghminv.z . . . . 5 𝑁 = (invg𝑇)
2620, 11, 14, 25grpinvid1 13807 . . . 4 ((𝑇 ∈ Grp ∧ (𝐹𝑋) ∈ (Base‘𝑇) ∧ (𝐹‘(𝑀𝑋)) ∈ (Base‘𝑇)) → ((𝑁‘(𝐹𝑋)) = (𝐹‘(𝑀𝑋)) ↔ ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))) = (0g𝑇)))
2719, 22, 24, 26syl3anc 1274 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → ((𝑁‘(𝐹𝑋)) = (𝐹‘(𝑀𝑋)) ↔ ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))) = (0g𝑇)))
2817, 27mpbird 167 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝑁‘(𝐹𝑋)) = (𝐹‘(𝑀𝑋)))
2928eqcomd 2240 1 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑀𝑋)) = (𝑁‘(𝐹𝑋)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2205  wf 5353  cfv 5357  (class class class)co 6058  Basecbs 13296  +gcplusg 13374  0gc0g 13553  Grpcgrp 13755  invgcminusg 13756   GrpHom cghm 13993
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-minusg 13759  df-ghm 13994
This theorem is referenced by:  ghmsub  14004  ghmmulg  14009  ghmrn  14010  ghmpreima  14019  ghmeql  14020
  Copyright terms: Public domain W3C validator