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

Theorem ghminv 13656
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 13651 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
2 ghminv.b . . . . . . 7 𝐵 = (Base‘𝑆)
3 eqid 2206 . . . . . . 7 (+g𝑆) = (+g𝑆)
4 eqid 2206 . . . . . . 7 (0g𝑆) = (0g𝑆)
5 ghminv.y . . . . . . 7 𝑀 = (invg𝑆)
62, 3, 4, 5grprinv 13453 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑋𝐵) → (𝑋(+g𝑆)(𝑀𝑋)) = (0g𝑆))
71, 6sylan 283 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝑋(+g𝑆)(𝑀𝑋)) = (0g𝑆))
87fveq2d 5592 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑋(+g𝑆)(𝑀𝑋))) = (𝐹‘(0g𝑆)))
92, 5grpinvcl 13450 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑋𝐵) → (𝑀𝑋) ∈ 𝐵)
101, 9sylan 283 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝑀𝑋) ∈ 𝐵)
11 eqid 2206 . . . . . 6 (+g𝑇) = (+g𝑇)
122, 3, 11ghmlin 13654 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵 ∧ (𝑀𝑋) ∈ 𝐵) → (𝐹‘(𝑋(+g𝑆)(𝑀𝑋))) = ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))))
1310, 12mpd3an3 1351 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑋(+g𝑆)(𝑀𝑋))) = ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))))
14 eqid 2206 . . . . . 6 (0g𝑇) = (0g𝑇)
154, 14ghmid 13655 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g𝑆)) = (0g𝑇))
1615adantr 276 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(0g𝑆)) = (0g𝑇))
178, 13, 163eqtr3d 2247 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))) = (0g𝑇))
18 ghmgrp2 13652 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
1918adantr 276 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → 𝑇 ∈ Grp)
20 eqid 2206 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
212, 20ghmf 13653 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:𝐵⟶(Base‘𝑇))
2221ffvelcdmda 5727 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹𝑋) ∈ (Base‘𝑇))
2321adantr 276 . . . . 5 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → 𝐹:𝐵⟶(Base‘𝑇))
2423, 10ffvelcdmd 5728 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑀𝑋)) ∈ (Base‘𝑇))
25 ghminv.z . . . . 5 𝑁 = (invg𝑇)
2620, 11, 14, 25grpinvid1 13454 . . . 4 ((𝑇 ∈ Grp ∧ (𝐹𝑋) ∈ (Base‘𝑇) ∧ (𝐹‘(𝑀𝑋)) ∈ (Base‘𝑇)) → ((𝑁‘(𝐹𝑋)) = (𝐹‘(𝑀𝑋)) ↔ ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))) = (0g𝑇)))
2719, 22, 24, 26syl3anc 1250 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → ((𝑁‘(𝐹𝑋)) = (𝐹‘(𝑀𝑋)) ↔ ((𝐹𝑋)(+g𝑇)(𝐹‘(𝑀𝑋))) = (0g𝑇)))
2817, 27mpbird 167 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝑁‘(𝐹𝑋)) = (𝐹‘(𝑀𝑋)))
2928eqcomd 2212 1 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑋𝐵) → (𝐹‘(𝑀𝑋)) = (𝑁‘(𝐹𝑋)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wcel 2177  wf 5275  cfv 5279  (class class class)co 5956  Basecbs 12902  +gcplusg 12979  0gc0g 13158  Grpcgrp 13402  invgcminusg 13403   GrpHom cghm 13646
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4166  ax-sep 4169  ax-pow 4225  ax-pr 4260  ax-un 4487  ax-setind 4592  ax-cnex 8031  ax-resscn 8032  ax-1re 8034  ax-addrcl 8037
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-pw 3622  df-sn 3643  df-pr 3644  df-op 3646  df-uni 3856  df-int 3891  df-iun 3934  df-br 4051  df-opab 4113  df-mpt 4114  df-id 4347  df-xp 4688  df-rel 4689  df-cnv 4690  df-co 4691  df-dm 4692  df-rn 4693  df-res 4694  df-ima 4695  df-iota 5240  df-fun 5281  df-fn 5282  df-f 5283  df-f1 5284  df-fo 5285  df-f1o 5286  df-fv 5287  df-riota 5911  df-ov 5959  df-oprab 5960  df-mpo 5961  df-inn 9052  df-2 9110  df-ndx 12905  df-slot 12906  df-base 12908  df-plusg 12992  df-0g 13160  df-mgm 13258  df-sgrp 13304  df-mnd 13319  df-grp 13405  df-minusg 13406  df-ghm 13647
This theorem is referenced by:  ghmsub  13657  ghmmulg  13662  ghmrn  13663  ghmpreima  13672  ghmeql  13673
  Copyright terms: Public domain W3C validator