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

Theorem invghm 18599
Description: The inversion map is a group automorphism if and only if the group is abelian. (In general it is only a group homomorphism into the opposite group, but in an abelian group the opposite group coincides with the group itself.) (Contributed by Mario Carneiro, 4-May-2015.)
Hypotheses
Ref Expression
invghm.b 𝐵 = (Base‘𝐺)
invghm.m 𝐼 = (invg𝐺)
Assertion
Ref Expression
invghm (𝐺 ∈ Abel ↔ 𝐼 ∈ (𝐺 GrpHom 𝐺))

Proof of Theorem invghm
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 invghm.b . . 3 𝐵 = (Base‘𝐺)
2 eqid 2825 . . 3 (+g𝐺) = (+g𝐺)
3 ablgrp 18558 . . 3 (𝐺 ∈ Abel → 𝐺 ∈ Grp)
4 invghm.m . . . . 5 𝐼 = (invg𝐺)
51, 4grpinvf 17827 . . . 4 (𝐺 ∈ Grp → 𝐼:𝐵𝐵)
63, 5syl 17 . . 3 (𝐺 ∈ Abel → 𝐼:𝐵𝐵)
71, 2, 4ablinvadd 18575 . . . 4 ((𝐺 ∈ Abel ∧ 𝑥𝐵𝑦𝐵) → (𝐼‘(𝑥(+g𝐺)𝑦)) = ((𝐼𝑥)(+g𝐺)(𝐼𝑦)))
873expb 1153 . . 3 ((𝐺 ∈ Abel ∧ (𝑥𝐵𝑦𝐵)) → (𝐼‘(𝑥(+g𝐺)𝑦)) = ((𝐼𝑥)(+g𝐺)(𝐼𝑦)))
91, 1, 2, 2, 3, 3, 6, 8isghmd 18027 . 2 (𝐺 ∈ Abel → 𝐼 ∈ (𝐺 GrpHom 𝐺))
10 ghmgrp1 18020 . . 3 (𝐼 ∈ (𝐺 GrpHom 𝐺) → 𝐺 ∈ Grp)
1110adantr 474 . . . . . . . 8 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → 𝐺 ∈ Grp)
12 simprr 789 . . . . . . . 8 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → 𝑦𝐵)
13 simprl 787 . . . . . . . 8 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → 𝑥𝐵)
141, 2, 4grpinvadd 17854 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑦𝐵𝑥𝐵) → (𝐼‘(𝑦(+g𝐺)𝑥)) = ((𝐼𝑥)(+g𝐺)(𝐼𝑦)))
1511, 12, 13, 14syl3anc 1494 . . . . . . 7 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝐼‘(𝑦(+g𝐺)𝑥)) = ((𝐼𝑥)(+g𝐺)(𝐼𝑦)))
1615fveq2d 6441 . . . . . 6 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝐼‘(𝐼‘(𝑦(+g𝐺)𝑥))) = (𝐼‘((𝐼𝑥)(+g𝐺)(𝐼𝑦))))
17 simpl 476 . . . . . . 7 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → 𝐼 ∈ (𝐺 GrpHom 𝐺))
181, 4grpinvcl 17828 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → (𝐼𝑥) ∈ 𝐵)
1911, 13, 18syl2anc 579 . . . . . . 7 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝐼𝑥) ∈ 𝐵)
201, 4grpinvcl 17828 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑦𝐵) → (𝐼𝑦) ∈ 𝐵)
2111, 12, 20syl2anc 579 . . . . . . 7 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝐼𝑦) ∈ 𝐵)
221, 2, 2ghmlin 18023 . . . . . . 7 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝐼𝑥) ∈ 𝐵 ∧ (𝐼𝑦) ∈ 𝐵) → (𝐼‘((𝐼𝑥)(+g𝐺)(𝐼𝑦))) = ((𝐼‘(𝐼𝑥))(+g𝐺)(𝐼‘(𝐼𝑦))))
2317, 19, 21, 22syl3anc 1494 . . . . . 6 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝐼‘((𝐼𝑥)(+g𝐺)(𝐼𝑦))) = ((𝐼‘(𝐼𝑥))(+g𝐺)(𝐼‘(𝐼𝑦))))
241, 4grpinvinv 17843 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → (𝐼‘(𝐼𝑥)) = 𝑥)
2511, 13, 24syl2anc 579 . . . . . . 7 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝐼‘(𝐼𝑥)) = 𝑥)
261, 4grpinvinv 17843 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑦𝐵) → (𝐼‘(𝐼𝑦)) = 𝑦)
2711, 12, 26syl2anc 579 . . . . . . 7 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝐼‘(𝐼𝑦)) = 𝑦)
2825, 27oveq12d 6928 . . . . . 6 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → ((𝐼‘(𝐼𝑥))(+g𝐺)(𝐼‘(𝐼𝑦))) = (𝑥(+g𝐺)𝑦))
2916, 23, 283eqtrd 2865 . . . . 5 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝐼‘(𝐼‘(𝑦(+g𝐺)𝑥))) = (𝑥(+g𝐺)𝑦))
301, 2grpcl 17791 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑦𝐵𝑥𝐵) → (𝑦(+g𝐺)𝑥) ∈ 𝐵)
3111, 12, 13, 30syl3anc 1494 . . . . . 6 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝑦(+g𝐺)𝑥) ∈ 𝐵)
321, 4grpinvinv 17843 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑦(+g𝐺)𝑥) ∈ 𝐵) → (𝐼‘(𝐼‘(𝑦(+g𝐺)𝑥))) = (𝑦(+g𝐺)𝑥))
3311, 31, 32syl2anc 579 . . . . 5 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝐼‘(𝐼‘(𝑦(+g𝐺)𝑥))) = (𝑦(+g𝐺)𝑥))
3429, 33eqtr3d 2863 . . . 4 ((𝐼 ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥))
3534ralrimivva 3180 . . 3 (𝐼 ∈ (𝐺 GrpHom 𝐺) → ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥))
361, 2isabl2 18561 . . 3 (𝐺 ∈ Abel ↔ (𝐺 ∈ Grp ∧ ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝐺)𝑦) = (𝑦(+g𝐺)𝑥)))
3710, 35, 36sylanbrc 578 . 2 (𝐼 ∈ (𝐺 GrpHom 𝐺) → 𝐺 ∈ Abel)
389, 37impbii 201 1 (𝐺 ∈ Abel ↔ 𝐼 ∈ (𝐺 GrpHom 𝐺))
Colors of variables: wff setvar class
Syntax hints:  wb 198  wa 386   = wceq 1656  wcel 2164  wral 3117  wf 6123  cfv 6127  (class class class)co 6910  Basecbs 16229  +gcplusg 16312  Grpcgrp 17783  invgcminusg 17784   GrpHom cghm 18015  Abelcabl 18554
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-8 2166  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803  ax-rep 4996  ax-sep 5007  ax-nul 5015  ax-pow 5067  ax-pr 5129  ax-un 7214
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3an 1113  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-reu 3124  df-rmo 3125  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4147  df-if 4309  df-pw 4382  df-sn 4400  df-pr 4402  df-op 4406  df-uni 4661  df-iun 4744  df-br 4876  df-opab 4938  df-mpt 4955  df-id 5252  df-xp 5352  df-rel 5353  df-cnv 5354  df-co 5355  df-dm 5356  df-rn 5357  df-res 5358  df-ima 5359  df-iota 6090  df-fun 6129  df-fn 6130  df-f 6131  df-f1 6132  df-fo 6133  df-f1o 6134  df-fv 6135  df-riota 6871  df-ov 6913  df-oprab 6914  df-mpt2 6915  df-0g 16462  df-mgm 17602  df-sgrp 17644  df-mnd 17655  df-grp 17786  df-minusg 17787  df-ghm 18016  df-cmn 18555  df-abl 18556
This theorem is referenced by:  gsuminv  18706  invlmhm  19408  tsmsinv  22328
  Copyright terms: Public domain W3C validator