Theorem cycsubgcl 19137

Description: The set of integer powers of an element 𝐴 of a group forms a subgroup containing 𝐴, called the cyclic group generated by the element 𝐴. (Contributed by Mario Carneiro, 13-Jan-2015.)

Hypotheses

Ref	Expression
cycsubg.x	⊢ 𝑋 = (Base‘𝐺)
cycsubg.t	⊢ · = (.g‘𝐺)
cycsubg.f	⊢ 𝐹 = (𝑥 ∈ ℤ ↦ (𝑥 · 𝐴))

Assertion

Ref	Expression
cycsubgcl	⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (ran 𝐹 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ran 𝐹))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐺   𝑥, ·   𝑥,𝑋

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem cycsubgcl

Dummy variables 𝑚 𝑛 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cycsubg.x	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
2		cycsubg.t	. . . . . . . 8 ⊢ · = (.g‘𝐺)
3	1, 2	mulgcl 19023	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ ℤ ∧ 𝐴 ∈ 𝑋) → (𝑥 · 𝐴) ∈ 𝑋)
4	3	3expa 1119	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑥 ∈ ℤ) ∧ 𝐴 ∈ 𝑋) → (𝑥 · 𝐴) ∈ 𝑋)
5	4	an32s 653	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ ℤ) → (𝑥 · 𝐴) ∈ 𝑋)
6		cycsubg.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ ℤ ↦ (𝑥 · 𝐴))
7	5, 6	fmptd 7059	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → 𝐹:ℤ⟶𝑋)
8	7	frnd 6669	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ran 𝐹 ⊆ 𝑋)
9	7	ffnd 6662	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → 𝐹 Fn ℤ)
10		1z 12523	. . . . 5 ⊢ 1 ∈ ℤ
11		fnfvelrn 7025	. . . . 5 ⊢ ((𝐹 Fn ℤ ∧ 1 ∈ ℤ) → (𝐹‘1) ∈ ran 𝐹)
12	9, 10, 11	sylancl 587	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐹‘1) ∈ ran 𝐹)
13	12	ne0d 4293	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ran 𝐹 ≠ ∅)
14		df-3an 1089	. . . . . . . . . . . . 13 ⊢ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝐴 ∈ 𝑋) ↔ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝐴 ∈ 𝑋))
15		eqid 2735	. . . . . . . . . . . . . 14 ⊢ (+g‘𝐺) = (+g‘𝐺)
16	1, 2, 15	mulgdir 19038	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Grp ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝐴 ∈ 𝑋)) → ((𝑚 + 𝑛) · 𝐴) = ((𝑚 · 𝐴)(+g‘𝐺)(𝑛 · 𝐴)))
17	14, 16	sylan2br 596	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝐴 ∈ 𝑋)) → ((𝑚 + 𝑛) · 𝐴) = ((𝑚 · 𝐴)(+g‘𝐺)(𝑛 · 𝐴)))
18	17	anass1rs 656	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚 + 𝑛) · 𝐴) = ((𝑚 · 𝐴)(+g‘𝐺)(𝑛 · 𝐴)))
19		zaddcl 12533	. . . . . . . . . . . . 13 ⊢ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) → (𝑚 + 𝑛) ∈ ℤ)
20	19	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝑚 + 𝑛) ∈ ℤ)
21		oveq1 7365	. . . . . . . . . . . . 13 ⊢ (𝑥 = (𝑚 + 𝑛) → (𝑥 · 𝐴) = ((𝑚 + 𝑛) · 𝐴))
22		ovex 7391	. . . . . . . . . . . . 13 ⊢ ((𝑚 + 𝑛) · 𝐴) ∈ V
23	21, 6, 22	fvmpt 6940	. . . . . . . . . . . 12 ⊢ ((𝑚 + 𝑛) ∈ ℤ → (𝐹‘(𝑚 + 𝑛)) = ((𝑚 + 𝑛) · 𝐴))
24	20, 23	syl 17	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘(𝑚 + 𝑛)) = ((𝑚 + 𝑛) · 𝐴))
25		oveq1 7365	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑚 → (𝑥 · 𝐴) = (𝑚 · 𝐴))
26		ovex 7391	. . . . . . . . . . . . . 14 ⊢ (𝑚 · 𝐴) ∈ V
27	25, 6, 26	fvmpt 6940	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ ℤ → (𝐹‘𝑚) = (𝑚 · 𝐴))
28	27	ad2antrl 729	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘𝑚) = (𝑚 · 𝐴))
29		oveq1 7365	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑛 → (𝑥 · 𝐴) = (𝑛 · 𝐴))
30		ovex 7391	. . . . . . . . . . . . . 14 ⊢ (𝑛 · 𝐴) ∈ V
31	29, 6, 30	fvmpt 6940	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℤ → (𝐹‘𝑛) = (𝑛 · 𝐴))
32	31	ad2antll 730	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘𝑛) = (𝑛 · 𝐴))
33	28, 32	oveq12d 7376	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) = ((𝑚 · 𝐴)(+g‘𝐺)(𝑛 · 𝐴)))
34	18, 24, 33	3eqtr4d 2780	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘(𝑚 + 𝑛)) = ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)))
35		fnfvelrn 7025	. . . . . . . . . . 11 ⊢ ((𝐹 Fn ℤ ∧ (𝑚 + 𝑛) ∈ ℤ) → (𝐹‘(𝑚 + 𝑛)) ∈ ran 𝐹)
36	9, 19, 35	syl2an 597	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘(𝑚 + 𝑛)) ∈ ran 𝐹)
37	34, 36	eqeltrrd 2836	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹)
38	37	anassrs 467	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹)
39	38	ralrimiva 3127	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → ∀𝑛 ∈ ℤ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹)
40		oveq2 7366	. . . . . . . . . . 11 ⊢ (𝑣 = (𝐹‘𝑛) → ((𝐹‘𝑚)(+g‘𝐺)𝑣) = ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)))
41	40	eleq1d 2820	. . . . . . . . . 10 ⊢ (𝑣 = (𝐹‘𝑛) → (((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹))
42	41	ralrn 7033	. . . . . . . . 9 ⊢ (𝐹 Fn ℤ → (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑛 ∈ ℤ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹))
43	9, 42	syl 17	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑛 ∈ ℤ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹))
44	43	adantr 480	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑛 ∈ ℤ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹))
45	39, 44	mpbird 257	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → ∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹)
46		eqid 2735	. . . . . . . . . . 11 ⊢ (invg‘𝐺) = (invg‘𝐺)
47	1, 2, 46	mulgneg 19024	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑚 ∈ ℤ ∧ 𝐴 ∈ 𝑋) → (-𝑚 · 𝐴) = ((invg‘𝐺)‘(𝑚 · 𝐴)))
48	47	3expa 1119	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑚 ∈ ℤ) ∧ 𝐴 ∈ 𝑋) → (-𝑚 · 𝐴) = ((invg‘𝐺)‘(𝑚 · 𝐴)))
49	48	an32s 653	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (-𝑚 · 𝐴) = ((invg‘𝐺)‘(𝑚 · 𝐴)))
50		znegcl 12528	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℤ → -𝑚 ∈ ℤ)
51	50	adantl 481	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → -𝑚 ∈ ℤ)
52		oveq1 7365	. . . . . . . . . 10 ⊢ (𝑥 = -𝑚 → (𝑥 · 𝐴) = (-𝑚 · 𝐴))
53		ovex 7391	. . . . . . . . . 10 ⊢ (-𝑚 · 𝐴) ∈ V
54	52, 6, 53	fvmpt 6940	. . . . . . . . 9 ⊢ (-𝑚 ∈ ℤ → (𝐹‘-𝑚) = (-𝑚 · 𝐴))
55	51, 54	syl 17	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘-𝑚) = (-𝑚 · 𝐴))
56	27	adantl 481	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘𝑚) = (𝑚 · 𝐴))
57	56	fveq2d 6837	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → ((invg‘𝐺)‘(𝐹‘𝑚)) = ((invg‘𝐺)‘(𝑚 · 𝐴)))
58	49, 55, 57	3eqtr4d 2780	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘-𝑚) = ((invg‘𝐺)‘(𝐹‘𝑚)))
59		fnfvelrn 7025	. . . . . . . 8 ⊢ ((𝐹 Fn ℤ ∧ -𝑚 ∈ ℤ) → (𝐹‘-𝑚) ∈ ran 𝐹)
60	9, 50, 59	syl2an 597	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘-𝑚) ∈ ran 𝐹)
61	58, 60	eqeltrrd 2836	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹)
62	45, 61	jca 511	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹))
63	62	ralrimiva 3127	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ∀𝑚 ∈ ℤ (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹))
64		oveq1 7365	. . . . . . . . 9 ⊢ (𝑢 = (𝐹‘𝑚) → (𝑢(+g‘𝐺)𝑣) = ((𝐹‘𝑚)(+g‘𝐺)𝑣))
65	64	eleq1d 2820	. . . . . . . 8 ⊢ (𝑢 = (𝐹‘𝑚) → ((𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹))
66	65	ralbidv 3158	. . . . . . 7 ⊢ (𝑢 = (𝐹‘𝑚) → (∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹))
67		fveq2 6833	. . . . . . . 8 ⊢ (𝑢 = (𝐹‘𝑚) → ((invg‘𝐺)‘𝑢) = ((invg‘𝐺)‘(𝐹‘𝑚)))
68	67	eleq1d 2820	. . . . . . 7 ⊢ (𝑢 = (𝐹‘𝑚) → (((invg‘𝐺)‘𝑢) ∈ ran 𝐹 ↔ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹))
69	66, 68	anbi12d 633	. . . . . 6 ⊢ (𝑢 = (𝐹‘𝑚) → ((∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹) ↔ (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹)))
70	69	ralrn 7033	. . . . 5 ⊢ (𝐹 Fn ℤ → (∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹) ↔ ∀𝑚 ∈ ℤ (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹)))
71	9, 70	syl 17	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹) ↔ ∀𝑚 ∈ ℤ (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹)))
72	63, 71	mpbird 257	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹))
73	1, 15, 46	issubg2 19073	. . . 4 ⊢ (𝐺 ∈ Grp → (ran 𝐹 ∈ (SubGrp‘𝐺) ↔ (ran 𝐹 ⊆ 𝑋 ∧ ran 𝐹 ≠ ∅ ∧ ∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹))))
74	73	adantr 480	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (ran 𝐹 ∈ (SubGrp‘𝐺) ↔ (ran 𝐹 ⊆ 𝑋 ∧ ran 𝐹 ≠ ∅ ∧ ∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹))))
75	8, 13, 72, 74	mpbir3and 1344	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ran 𝐹 ∈ (SubGrp‘𝐺))
76		oveq1 7365	. . . . . 6 ⊢ (𝑥 = 1 → (𝑥 · 𝐴) = (1 · 𝐴))
77		ovex 7391	. . . . . 6 ⊢ (1 · 𝐴) ∈ V
78	76, 6, 77	fvmpt 6940	. . . . 5 ⊢ (1 ∈ ℤ → (𝐹‘1) = (1 · 𝐴))
79	10, 78	ax-mp 5	. . . 4 ⊢ (𝐹‘1) = (1 · 𝐴)
80	1, 2	mulg1 19013	. . . . 5 ⊢ (𝐴 ∈ 𝑋 → (1 · 𝐴) = 𝐴)
81	80	adantl 481	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (1 · 𝐴) = 𝐴)
82	79, 81	eqtrid 2782	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐹‘1) = 𝐴)
83	82, 12	eqeltrrd 2836	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ ran 𝐹)
84	75, 83	jca 511	1 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (ran 𝐹 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ran 𝐹))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2931  ∀wral 3050   ⊆ wss 3900  ∅c0 4284   ↦ cmpt 5178  ran crn 5624   Fn wfn 6486  ‘cfv 6491  (class class class)co 7358  1c1 11029   + caddc 11031  -cneg 11367  ℤcz 12490  Basecbs 17138  +_gcplusg 17179  Grpcgrp 18865  inv_gcminusg 18866  ._gcmg 18999  SubGrpcsubg 19052

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104  ax-pre-mulgt0 11105

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-nel 3036  df-ral 3051  df-rex 3060  df-rmo 3349  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6258  df-ord 6319  df-on 6320  df-lim 6321  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-er 8635  df-en 8886  df-dom 8887  df-sdom 8888  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-sub 11368  df-neg 11369  df-nn 12148  df-2 12210  df-n0 12404  df-z 12491  df-uz 12754  df-fz 13426  df-seq 13927  df-sets 17093  df-slot 17111  df-ndx 17123  df-base 17139  df-ress 17160  df-plusg 17192  df-0g 17363  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-grp 18868  df-minusg 18869  df-mulg 19000  df-subg 19055

This theorem is referenced by:  cycsubg  19139  cycsubgcld  19140  oddvds2  19497  cycsubgcyg  19832