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

Theorem cygabl 20021
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 2760 . . 3 (Base‘𝐺) = (Base‘𝐺)
2 eqid 2760 . . 3 (.g𝐺) = (.g𝐺)
31, 2iscyg3 20016 . 2 (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)))
4 eqidd 2761 . . . 4 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → (Base‘𝐺) = (Base‘𝐺))
5 eqidd 2761 . . . 4 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → (+g𝐺) = (+g𝐺))
6 simpll 779 . . . 4 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → 𝐺 ∈ Grp)
7 oveq1 7421 . . . . . . . . . . 11 (𝑛 = 𝑖 → (𝑛(.g𝐺)𝑥) = (𝑖(.g𝐺)𝑥))
87eqeq2d 2771 . . . . . . . . . 10 (𝑛 = 𝑖 → (𝑦 = (𝑛(.g𝐺)𝑥) ↔ 𝑦 = (𝑖(.g𝐺)𝑥)))
98cbvrexvw 3241 . . . . . . . . 9 (∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥) ↔ ∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
109biimpi 219 . . . . . . . 8 (∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥) → ∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
1110ralimi 3099 . . . . . . 7 (∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥) → ∀𝑦 ∈ (Base‘𝐺)∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
1211adantl 487 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → ∀𝑦 ∈ (Base‘𝐺)∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
13123ad2ant1 1151 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ∀𝑦 ∈ (Base‘𝐺)∃𝑖 ∈ ℤ 𝑦 = (𝑖(.g𝐺)𝑥))
14 simpll 779 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → 𝐺 ∈ Grp)
15 simpr 490 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) → 𝑥 ∈ (Base‘𝐺))
1615anim1ci 628 . . . . . . . . . 10 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝑥 ∈ (Base‘𝐺)))
17 df-3an 1105 . . . . . . . . . 10 ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ (Base‘𝐺)) ↔ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝑥 ∈ (Base‘𝐺)))
1816, 17sylibr 237 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ (Base‘𝐺)))
19 eqid 2760 . . . . . . . . . 10 (+g𝐺) = (+g𝐺)
201, 2, 19mulgdir 19232 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ (Base‘𝐺))) → ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
2114, 18, 20syl2anc 596 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
2221ralrimivva 3205 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) → ∀𝑚 ∈ ℤ ∀𝑛 ∈ ℤ ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
2322adantr 486 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → ∀𝑚 ∈ ℤ ∀𝑛 ∈ ℤ ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
24233ad2ant1 1151 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ∀𝑚 ∈ ℤ ∀𝑛 ∈ ℤ ((𝑚 + 𝑛)(.g𝐺)𝑥) = ((𝑚(.g𝐺)𝑥)(+g𝐺)(𝑛(.g𝐺)𝑥)))
25 simp2 1155 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝑎 ∈ (Base‘𝐺))
26 simp3 1156 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝑏 ∈ (Base‘𝐺))
27 zsscn 12626 . . . . . 6 ℤ ⊆ ℂ
2827a1i 11 . . . . 5 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ℤ ⊆ ℂ)
2913, 24, 25, 26, 28cyccom 19334 . . . 4 ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → (𝑎(+g𝐺)𝑏) = (𝑏(+g𝐺)𝑎))
304, 5, 6, 29isabld 19925 . . 3 (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → 𝐺 ∈ Abel)
3130r19.29an 3166 . 2 ((𝐺 ∈ Grp ∧ ∃𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g𝐺)𝑥)) → 𝐺 ∈ Abel)
323, 31sylbi 220 1 (𝐺 ∈ CycGrp → 𝐺 ∈ Abel)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3076  wrex 3086  wss 3899  cfv 6533  (class class class)co 7414  cc 11125   + caddc 11130  cz 12618  Basecbs 17304  +gcplusg 17345  Grpcgrp 19060  .gcmg 19193  Abelcabl 19911  CycGrpccyg 20007
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-nn 12261  df-n0 12532  df-z 12619  df-uz 12891  df-fz 13565  df-seq 14069  df-0g 17529  df-mgm 18733  df-sgrp 18824  df-mnd 18840  df-grp 19063  df-minusg 19064  df-mulg 19194  df-cmn 19912  df-abl 19913  df-cyg 20008
This theorem is used by:  lt6abl  20025  frgpcyg  21789
  Copyright terms: Public domain W3C validator