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

Theorem cygabl 19009
Description: A cyclic group is abelian. (Contributed by Mario Carneiro, 21-Apr-2016.) (Proof shortened by AV, 20-Jan-2024.)
Assertion
Ref Expression
cygabl (𝐺 ∈ CycGrp → 𝐺 ∈ Abel)

Proof of Theorem cygabl
Dummy variables 𝑛 𝑥 𝑎 𝑏 𝑖 𝑚 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2821 . . 3 (Base‘𝐺) = (Base‘𝐺)
2 eqid 2821 . . 3 (.g𝐺) = (.g𝐺)
31, 2iscyg3 19004 . 2 (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)))
4 eqidd 2822 . . . 4 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → (Base‘𝐺) = (Base‘𝐺))
5 eqidd 2822 . . . 4 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → (+g𝐺) = (+g𝐺))
6 simpll 765 . . . 4 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → 𝐺 ∈ Grp)
7 oveq1 7162 . . . . . . . . . . 11 (𝑛 = 𝑖 → (𝑛(.g𝐺)𝑥) = (𝑖(.g𝐺)𝑥))
87eqeq2d 2832 . . . . . . . . . 10 (𝑛 = 𝑖 → (𝑦 = (𝑛(.g𝐺)𝑥) ↔ 𝑦 = (𝑖(.g𝐺)𝑥)))
98cbvrexvw 3450 . . . . . . . . 9 (∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥) ↔ ∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
109biimpi 218 . . . . . . . 8 (∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥) → ∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
1110ralimi 3160 . . . . . . 7 (∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥) → ∀𝑦 ∈ (Base‘𝐺)∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
1211adantl 484 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → ∀𝑦 ∈ (Base‘𝐺)∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
13123ad2ant1 1129 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ∀𝑦 ∈ (Base‘𝐺)∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
14 simpll 765 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → 𝐺 ∈ Grp)
15 simpr 487 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) → 𝑥 ∈ (Base‘𝐺))
1615anim1ci 617 . . . . . . . . . 10 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝑥 ∈ (Base‘𝐺)))
17 df-3an 1085 . . . . . . . . . 10 ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ (Base‘𝐺)) ↔ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝑥 ∈ (Base‘𝐺)))
1816, 17sylibr 236 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ (Base‘𝐺)))
19 eqid 2821 . . . . . . . . . 10 (+g𝐺) = (+g𝐺)
201, 2, 19mulgdir 18258 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ (Base‘𝐺))) → ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
2114, 18, 20syl2anc 586 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
2221ralrimivva 3191 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) → ∀𝑚 ∈ ℤ ∀𝑛 ∈ ℤ ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
2322adantr 483 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → ∀𝑚 ∈ ℤ ∀𝑛 ∈ ℤ ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
24233ad2ant1 1129 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ∀𝑚 ∈ ℤ ∀𝑛 ∈ ℤ ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
25 simp2 1133 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝑎 ∈ (Base‘𝐺))
26 simp3 1134 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝑏 ∈ (Base‘𝐺))
27 zsscn 11988 . . . . . 6 ℤ ⊆ ℂ
2827a1i 11 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ℤ ⊆ ℂ)
2913, 24, 25, 26, 28cyccom 18345 . . . 4 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → (𝑎(+g𝐺)𝑏) = (𝑏(+g𝐺)𝑎))
304, 5, 6, 29isabld 18919 . . 3 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → 𝐺 ∈ Abel)
3130r19.29an 3288 . 2 ((𝐺 ∈ Grp ∧ ∃𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → 𝐺 ∈ Abel)
323, 31sylbi 219 1 (𝐺 ∈ CycGrp → 𝐺 ∈ Abel)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1533  wcel 2110  wral 3138  wrex 3139  wss 3935  cfv 6354  (class class class)co 7155  cc 10534   + caddc 10539  cz 11980  Basecbs 16482  +gcplusg 16564  Grpcgrp 18102  .gcmg 18223  Abelcabl 18906  CycGrpccyg 18995
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460  ax-cnex 10592  ax-resscn 10593  ax-1cn 10594  ax-icn 10595  ax-addcl 10596  ax-addrcl 10597  ax-mulcl 10598  ax-mulrcl 10599  ax-mulcom 10600  ax-addass 10601  ax-mulass 10602  ax-distr 10603  ax-i2m1 10604  ax-1ne0 10605  ax-1rid 10606  ax-rnegex 10607  ax-rrecex 10608  ax-cnre 10609  ax-pre-lttri 10610  ax-pre-lttrn 10611  ax-pre-ltadd 10612  ax-pre-mulgt0 10613
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4838  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-tr 5172  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-riota 7113  df-ov 7158  df-oprab 7159  df-mpo 7160  df-om 7580  df-1st 7688  df-2nd 7689  df-wrecs 7946  df-recs 8007  df-rdg 8045  df-er 8288  df-en 8509  df-dom 8510  df-sdom 8511  df-pnf 10676  df-mnf 10677  df-xr 10678  df-ltxr 10679  df-le 10680  df-sub 10871  df-neg 10872  df-nn 11638  df-n0 11897  df-z 11981  df-uz 12243  df-fz 12892  df-seq 13369  df-0g 16714  df-mgm 17851  df-sgrp 17900  df-mnd 17911  df-grp 18105  df-minusg 18106  df-mulg 18224  df-cmn 18907  df-abl 18908  df-cyg 18996
This theorem is referenced by:  lt6abl  19014  frgpcyg  20719
  Copyright terms: Public domain W3C validator