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

Theorem ghminv 13836
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 13831 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
2 ghminv.b . . . . . . 7 𝐵 = (Base‘𝑆)
3 eqid 2231 . . . . . . 7 (+g𝑆) = (+g𝑆)
4 eqid 2231 . . . . . . 7 (0g𝑆) = (0g𝑆)
5 ghminv.y . . . . . . 7 𝑀 = (invg𝑆)
62, 3, 4, 5grprinv 13633 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑋𝐵) → (𝑋(+g𝑆)(𝑀𝑋)) = (0g𝑆))
71, 6sylan 283 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝑋(+g𝑆)(𝑀𝑋)) = (0g𝑆))
87fveq2d 5643 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑋(+g𝑆)(𝑀𝑋))) = (𝐹‘(0g𝑆)))
92, 5grpinvcl 13630 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑋𝐵) → (𝑀𝑋) ∈ 𝐵)
101, 9sylan 283 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝑀𝑋) ∈ 𝐵)
11 eqid 2231 . . . . . 6 (+g𝑇) = (+g𝑇)
122, 3, 11ghmlin 13834 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵 ∧ (𝑀𝑋) ∈ 𝐵) → (𝐹‘(𝑋(+g𝑆)(𝑀𝑋))) = ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))))
1310, 12mpd3an3 1374 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑋(+g𝑆)(𝑀𝑋))) = ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))))
14 eqid 2231 . . . . . 6 (0g𝑇) = (0g𝑇)
154, 14ghmid 13835 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
1615adantr 276 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(0g𝑆)) = (0g𝑇))
178, 13, 163eqtr3d 2272 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))) = (0g𝑇))
18 ghmgrp2 13832 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
1918adantr 276 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → 𝑇 ∈ Grp)
20 eqid 2231 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
212, 20ghmf 13833 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:𝐵⟶(Base‘𝑇))
2221ffvelcdmda 5782 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹𝑋) ∈ (Base‘𝑇))
2321adantr 276 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → 𝐹:𝐵⟶(Base‘𝑇))
2423, 10ffvelcdmd 5783 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑀𝑋)) ∈ (Base‘𝑇))
25 ghminv.z . . . . 5 𝑁 = (invg𝑇)
2620, 11, 14, 25grpinvid1 13634 . . . 4 ((𝑇 ∈ Grp ∧ (𝐹𝑋) ∈ (Base‘𝑇) ∧ (𝐹‘(𝑀𝑋)) ∈ (Base‘𝑇)) → ((𝑁‘(𝐹𝑋)) = (𝐹‘(𝑀𝑋)) ↔ ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))) = (0g𝑇)))
2719, 22, 24, 26syl3anc 1273 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → ((𝑁‘(𝐹𝑋)) = (𝐹‘(𝑀𝑋)) ↔ ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))) = (0g𝑇)))
2817, 27mpbird 167 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝑁‘(𝐹𝑋)) = (𝐹‘(𝑀𝑋)))
2928eqcomd 2237 1 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑀𝑋)) = (𝑁‘(𝐹𝑋)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1397  wcel 2202  wf 5322  cfv 5326  (class class class)co 6017  Basecbs 13081  +gcplusg 13159  0gc0g 13338  Grpcgrp 13582  invgcminusg 13583   GrpHom cghm 13826
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-inn 9143  df-2 9201  df-ndx 13084  df-slot 13085  df-base 13087  df-plusg 13172  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-grp 13585  df-minusg 13586  df-ghm 13827
This theorem is referenced by:  ghmsub  13837  ghmmulg  13842  ghmrn  13843  ghmpreima  13852  ghmeql  13853
  Copyright terms: Public domain W3C validator