Theorem cygabl 18115

Description: A cyclic group is abelian. (Contributed by Mario Carneiro, 21-Apr-2016.)

Assertion

Ref	Expression
cygabl	⊢ (𝐺 ∈ CycGrp → 𝐺 ∈ Abel)

Proof of Theorem cygabl

Dummy variables 𝑚 𝑛 𝑥 𝑦 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2610	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
2		eqid 2610	. . 3 ⊢ (.g‘𝐺) = (.g‘𝐺)
3	1, 2	iscyg3 18111	. 2 ⊢ (𝐺 ∈ CycGrp ↔ (𝐺 ∈ Grp ∧ ∃𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)))
4		eqidd 2611	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) → (Base‘𝐺) = (Base‘𝐺))
5		eqidd 2611	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) → (+g‘𝐺) = (+g‘𝐺))
6		simpll 786	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) → 𝐺 ∈ Grp)
7		eqeq1 2614	. . . . . . . . . 10 ⊢ (𝑦 = 𝑎 → (𝑦 = (𝑛(.g‘𝐺)𝑥) ↔ 𝑎 = (𝑛(.g‘𝐺)𝑥)))
8	7	rexbidv 3034	. . . . . . . . 9 ⊢ (𝑦 = 𝑎 → (∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥) ↔ ∃𝑛 ∈ ℤ 𝑎 = (𝑛(.g‘𝐺)𝑥)))
9		oveq1 6556	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑚 → (𝑛(.g‘𝐺)𝑥) = (𝑚(.g‘𝐺)𝑥))
10	9	eqeq2d 2620	. . . . . . . . . 10 ⊢ (𝑛 = 𝑚 → (𝑎 = (𝑛(.g‘𝐺)𝑥) ↔ 𝑎 = (𝑚(.g‘𝐺)𝑥)))
11	10	cbvrexv 3148	. . . . . . . . 9 ⊢ (∃𝑛 ∈ ℤ 𝑎 = (𝑛(.g‘𝐺)𝑥) ↔ ∃𝑚 ∈ ℤ 𝑎 = (𝑚(.g‘𝐺)𝑥))
12	8, 11	syl6bb 275	. . . . . . . 8 ⊢ (𝑦 = 𝑎 → (∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥) ↔ ∃𝑚 ∈ ℤ 𝑎 = (𝑚(.g‘𝐺)𝑥)))
13	12	rspccv 3279	. . . . . . 7 ⊢ (∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥) → (𝑎 ∈ (Base‘𝐺) → ∃𝑚 ∈ ℤ 𝑎 = (𝑚(.g‘𝐺)𝑥)))
14	13	adantl 481	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) → (𝑎 ∈ (Base‘𝐺) → ∃𝑚 ∈ ℤ 𝑎 = (𝑚(.g‘𝐺)𝑥)))
15		eqeq1 2614	. . . . . . . . 9 ⊢ (𝑦 = 𝑏 → (𝑦 = (𝑛(.g‘𝐺)𝑥) ↔ 𝑏 = (𝑛(.g‘𝐺)𝑥)))
16	15	rexbidv 3034	. . . . . . . 8 ⊢ (𝑦 = 𝑏 → (∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥) ↔ ∃𝑛 ∈ ℤ 𝑏 = (𝑛(.g‘𝐺)𝑥)))
17	16	rspccv 3279	. . . . . . 7 ⊢ (∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥) → (𝑏 ∈ (Base‘𝐺) → ∃𝑛 ∈ ℤ 𝑏 = (𝑛(.g‘𝐺)𝑥)))
18	17	adantl 481	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) → (𝑏 ∈ (Base‘𝐺) → ∃𝑛 ∈ ℤ 𝑏 = (𝑛(.g‘𝐺)𝑥)))
19		reeanv 3086	. . . . . . . 8 ⊢ (∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ (𝑎 = (𝑚(.g‘𝐺)𝑥) ∧ 𝑏 = (𝑛(.g‘𝐺)𝑥)) ↔ (∃𝑚 ∈ ℤ 𝑎 = (𝑚(.g‘𝐺)𝑥) ∧ ∃𝑛 ∈ ℤ 𝑏 = (𝑛(.g‘𝐺)𝑥)))
20		zcn 11259	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℂ)
21	20	ad2antrl 760	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → 𝑚 ∈ ℂ)
22		zcn 11259	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ ℂ)
23	22	ad2antll 761	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → 𝑛 ∈ ℂ)
24	21, 23	addcomd 10117	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝑚 + 𝑛) = (𝑛 + 𝑚))
25	24	oveq1d 6564	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚 + 𝑛)(.g‘𝐺)𝑥) = ((𝑛 + 𝑚)(.g‘𝐺)𝑥))
26		simpll 786	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → 𝐺 ∈ Grp)
27		simprl 790	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → 𝑚 ∈ ℤ)
28		simprr 792	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → 𝑛 ∈ ℤ)
29		simplr 788	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → 𝑥 ∈ (Base‘𝐺))
30		eqid 2610	. . . . . . . . . . . . 13 ⊢ (+g‘𝐺) = (+g‘𝐺)
31	1, 2, 30	mulgdir 17396	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑥 ∈ (Base‘𝐺))) → ((𝑚 + 𝑛)(.g‘𝐺)𝑥) = ((𝑚(.g‘𝐺)𝑥)(+g‘𝐺)(𝑛(.g‘𝐺)𝑥)))
32	26, 27, 28, 29, 31	syl13anc 1320	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚 + 𝑛)(.g‘𝐺)𝑥) = ((𝑚(.g‘𝐺)𝑥)(+g‘𝐺)(𝑛(.g‘𝐺)𝑥)))
33	1, 2, 30	mulgdir 17396	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ (𝑛 ∈ ℤ ∧ 𝑚 ∈ ℤ ∧ 𝑥 ∈ (Base‘𝐺))) → ((𝑛 + 𝑚)(.g‘𝐺)𝑥) = ((𝑛(.g‘𝐺)𝑥)(+g‘𝐺)(𝑚(.g‘𝐺)𝑥)))
34	26, 28, 27, 29, 33	syl13anc 1320	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑛 + 𝑚)(.g‘𝐺)𝑥) = ((𝑛(.g‘𝐺)𝑥)(+g‘𝐺)(𝑚(.g‘𝐺)𝑥)))
35	25, 32, 34	3eqtr3d 2652	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚(.g‘𝐺)𝑥)(+g‘𝐺)(𝑛(.g‘𝐺)𝑥)) = ((𝑛(.g‘𝐺)𝑥)(+g‘𝐺)(𝑚(.g‘𝐺)𝑥)))
36		oveq12 6558	. . . . . . . . . . 11 ⊢ ((𝑎 = (𝑚(.g‘𝐺)𝑥) ∧ 𝑏 = (𝑛(.g‘𝐺)𝑥)) → (𝑎(+g‘𝐺)𝑏) = ((𝑚(.g‘𝐺)𝑥)(+g‘𝐺)(𝑛(.g‘𝐺)𝑥)))
37		oveq12 6558	. . . . . . . . . . . 12 ⊢ ((𝑏 = (𝑛(.g‘𝐺)𝑥) ∧ 𝑎 = (𝑚(.g‘𝐺)𝑥)) → (𝑏(+g‘𝐺)𝑎) = ((𝑛(.g‘𝐺)𝑥)(+g‘𝐺)(𝑚(.g‘𝐺)𝑥)))
38	37	ancoms 468	. . . . . . . . . . 11 ⊢ ((𝑎 = (𝑚(.g‘𝐺)𝑥) ∧ 𝑏 = (𝑛(.g‘𝐺)𝑥)) → (𝑏(+g‘𝐺)𝑎) = ((𝑛(.g‘𝐺)𝑥)(+g‘𝐺)(𝑚(.g‘𝐺)𝑥)))
39	36, 38	eqeq12d 2625	. . . . . . . . . 10 ⊢ ((𝑎 = (𝑚(.g‘𝐺)𝑥) ∧ 𝑏 = (𝑛(.g‘𝐺)𝑥)) → ((𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎) ↔ ((𝑚(.g‘𝐺)𝑥)(+g‘𝐺)(𝑛(.g‘𝐺)𝑥)) = ((𝑛(.g‘𝐺)𝑥)(+g‘𝐺)(𝑚(.g‘𝐺)𝑥))))
40	35, 39	syl5ibrcom 236	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑎 = (𝑚(.g‘𝐺)𝑥) ∧ 𝑏 = (𝑛(.g‘𝐺)𝑥)) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎)))
41	40	rexlimdvva 3020	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) → (∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ (𝑎 = (𝑚(.g‘𝐺)𝑥) ∧ 𝑏 = (𝑛(.g‘𝐺)𝑥)) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎)))
42	19, 41	syl5bir 232	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) → ((∃𝑚 ∈ ℤ 𝑎 = (𝑚(.g‘𝐺)𝑥) ∧ ∃𝑛 ∈ ℤ 𝑏 = (𝑛(.g‘𝐺)𝑥)) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎)))
43	42	adantr 480	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) → ((∃𝑚 ∈ ℤ 𝑎 = (𝑚(.g‘𝐺)𝑥) ∧ ∃𝑛 ∈ ℤ 𝑏 = (𝑛(.g‘𝐺)𝑥)) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎)))
44	14, 18, 43	syl2and 499	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) → ((𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎)))
45	44	3impib 1254	. . . 4 ⊢ ((((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → (𝑎(+g‘𝐺)𝑏) = (𝑏(+g‘𝐺)𝑎))
46	4, 5, 6, 45	isabld 18029	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) ∧ ∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) → 𝐺 ∈ Abel)
47	46	r19.29an 3059	. 2 ⊢ ((𝐺 ∈ Grp ∧ ∃𝑥 ∈ (Base‘𝐺)∀𝑦 ∈ (Base‘𝐺)∃𝑛 ∈ ℤ 𝑦 = (𝑛(.g‘𝐺)𝑥)) → 𝐺 ∈ Abel)
48	3, 47	sylbi 206	1 ⊢ (𝐺 ∈ CycGrp → 𝐺 ∈ Abel)

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896  ∃wrex 2897  ‘cfv 5804  (class class class)co 6549  ℂcc 9813   + caddc 9818  ℤcz 11254  Basecbs 15695  +_gcplusg 15768  Grpcgrp 17245  ._gcmg 17363  Abelcabl 18017  CycGrpccyg 18102

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-seq 12664  df-0g 15925  df-mgm 17065  df-sgrp 17107  df-mnd 17118  df-grp 17248  df-minusg 17249  df-mulg 17364  df-cmn 18018  df-abl 18019  df-cyg 18103

This theorem is referenced by:  lt6abl  18119  frgpcyg  19741