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

Theorem cycsubgcl 18999
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.
StepHypRef Expression
1 cycsubg.x . . . . . . . 8 𝑋 = (Base‘𝐺)
2 cycsubg.t . . . . . . . 8 · = (.g𝐺)
31, 2mulgcl 18893 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥 ∈ ℤ ∧ 𝐴𝑋) → (𝑥 · 𝐴) ∈ 𝑋)
433expa 1118 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑥 ∈ ℤ) ∧ 𝐴𝑋) → (𝑥 · 𝐴) ∈ 𝑋)
54an32s 650 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑥 ∈ ℤ) → (𝑥 · 𝐴) ∈ 𝑋)
6 cycsubg.f . . . . 5 𝐹 = (𝑥 ∈ ℤ ↦ (𝑥 · 𝐴))
75, 6fmptd 7062 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → 𝐹:ℤ⟶𝑋)
87frnd 6676 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ran 𝐹𝑋)
97ffnd 6669 . . . . 5 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → 𝐹 Fn ℤ)
10 1z 12533 . . . . 5 1 ∈ ℤ
11 fnfvelrn 7031 . . . . 5 ((𝐹 Fn ℤ ∧ 1 ∈ ℤ) → (𝐹‘1) ∈ ran 𝐹)
129, 10, 11sylancl 586 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐹‘1) ∈ ran 𝐹)
1312ne0d 4295 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ran 𝐹 ≠ ∅)
14 df-3an 1089 . . . . . . . . . . . . 13 ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝐴𝑋) ↔ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝐴𝑋))
15 eqid 2736 . . . . . . . . . . . . . 14 (+g𝐺) = (+g𝐺)
161, 2, 15mulgdir 18908 . . . . . . . . . . . . 13 ((𝐺 ∈ Grp ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝐴𝑋)) → ((𝑚 + 𝑛) · 𝐴) = ((𝑚 · 𝐴)(+g𝐺)(𝑛 · 𝐴)))
1714, 16sylan2br 595 . . . . . . . . . . . 12 ((𝐺 ∈ Grp ∧ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝐴𝑋)) → ((𝑚 + 𝑛) · 𝐴) = ((𝑚 · 𝐴)(+g𝐺)(𝑛 · 𝐴)))
1817anass1rs 653 . . . . . . . . . . 11 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚 + 𝑛) · 𝐴) = ((𝑚 · 𝐴)(+g𝐺)(𝑛 · 𝐴)))
19 zaddcl 12543 . . . . . . . . . . . . 13 ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) → (𝑚 + 𝑛) ∈ ℤ)
2019adantl 482 . . . . . . . . . . . 12 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝑚 + 𝑛) ∈ ℤ)
21 oveq1 7364 . . . . . . . . . . . . 13 (𝑥 = (𝑚 + 𝑛) → (𝑥 · 𝐴) = ((𝑚 + 𝑛) · 𝐴))
22 ovex 7390 . . . . . . . . . . . . 13 ((𝑚 + 𝑛) · 𝐴) ∈ V
2321, 6, 22fvmpt 6948 . . . . . . . . . . . 12 ((𝑚 + 𝑛) ∈ ℤ → (𝐹‘(𝑚 + 𝑛)) = ((𝑚 + 𝑛) · 𝐴))
2420, 23syl 17 . . . . . . . . . . 11 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘(𝑚 + 𝑛)) = ((𝑚 + 𝑛) · 𝐴))
25 oveq1 7364 . . . . . . . . . . . . . 14 (𝑥 = 𝑚 → (𝑥 · 𝐴) = (𝑚 · 𝐴))
26 ovex 7390 . . . . . . . . . . . . . 14 (𝑚 · 𝐴) ∈ V
2725, 6, 26fvmpt 6948 . . . . . . . . . . . . 13 (𝑚 ∈ ℤ → (𝐹𝑚) = (𝑚 · 𝐴))
2827ad2antrl 726 . . . . . . . . . . . 12 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹𝑚) = (𝑚 · 𝐴))
29 oveq1 7364 . . . . . . . . . . . . . 14 (𝑥 = 𝑛 → (𝑥 · 𝐴) = (𝑛 · 𝐴))
30 ovex 7390 . . . . . . . . . . . . . 14 (𝑛 · 𝐴) ∈ V
3129, 6, 30fvmpt 6948 . . . . . . . . . . . . 13 (𝑛 ∈ ℤ → (𝐹𝑛) = (𝑛 · 𝐴))
3231ad2antll 727 . . . . . . . . . . . 12 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹𝑛) = (𝑛 · 𝐴))
3328, 32oveq12d 7375 . . . . . . . . . . 11 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝐹𝑚)(+g𝐺)(𝐹𝑛)) = ((𝑚 · 𝐴)(+g𝐺)(𝑛 · 𝐴)))
3418, 24, 333eqtr4d 2786 . . . . . . . . . 10 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘(𝑚 + 𝑛)) = ((𝐹𝑚)(+g𝐺)(𝐹𝑛)))
35 fnfvelrn 7031 . . . . . . . . . . 11 ((𝐹 Fn ℤ ∧ (𝑚 + 𝑛) ∈ ℤ) → (𝐹‘(𝑚 + 𝑛)) ∈ ran 𝐹)
369, 19, 35syl2an 596 . . . . . . . . . 10 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘(𝑚 + 𝑛)) ∈ ran 𝐹)
3734, 36eqeltrrd 2839 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝐹𝑚)(+g𝐺)(𝐹𝑛)) ∈ ran 𝐹)
3837anassrs 468 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → ((𝐹𝑚)(+g𝐺)(𝐹𝑛)) ∈ ran 𝐹)
3938ralrimiva 3143 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → ∀𝑛 ∈ ℤ ((𝐹𝑚)(+g𝐺)(𝐹𝑛)) ∈ ran 𝐹)
40 oveq2 7365 . . . . . . . . . . 11 (𝑣 = (𝐹𝑛) → ((𝐹𝑚)(+g𝐺)𝑣) = ((𝐹𝑚)(+g𝐺)(𝐹𝑛)))
4140eleq1d 2822 . . . . . . . . . 10 (𝑣 = (𝐹𝑛) → (((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹 ↔ ((𝐹𝑚)(+g𝐺)(𝐹𝑛)) ∈ ran 𝐹))
4241ralrn 7038 . . . . . . . . 9 (𝐹 Fn ℤ → (∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑛 ∈ ℤ ((𝐹𝑚)(+g𝐺)(𝐹𝑛)) ∈ ran 𝐹))
439, 42syl 17 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑛 ∈ ℤ ((𝐹𝑚)(+g𝐺)(𝐹𝑛)) ∈ ran 𝐹))
4443adantr 481 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → (∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑛 ∈ ℤ ((𝐹𝑚)(+g𝐺)(𝐹𝑛)) ∈ ran 𝐹))
4539, 44mpbird 256 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → ∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹)
46 eqid 2736 . . . . . . . . . . 11 (invg𝐺) = (invg𝐺)
471, 2, 46mulgneg 18894 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑚 ∈ ℤ ∧ 𝐴𝑋) → (-𝑚 · 𝐴) = ((invg𝐺)‘(𝑚 · 𝐴)))
48473expa 1118 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝑚 ∈ ℤ) ∧ 𝐴𝑋) → (-𝑚 · 𝐴) = ((invg𝐺)‘(𝑚 · 𝐴)))
4948an32s 650 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → (-𝑚 · 𝐴) = ((invg𝐺)‘(𝑚 · 𝐴)))
50 znegcl 12538 . . . . . . . . . 10 (𝑚 ∈ ℤ → -𝑚 ∈ ℤ)
5150adantl 482 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → -𝑚 ∈ ℤ)
52 oveq1 7364 . . . . . . . . . 10 (𝑥 = -𝑚 → (𝑥 · 𝐴) = (-𝑚 · 𝐴))
53 ovex 7390 . . . . . . . . . 10 (-𝑚 · 𝐴) ∈ V
5452, 6, 53fvmpt 6948 . . . . . . . . 9 (-𝑚 ∈ ℤ → (𝐹‘-𝑚) = (-𝑚 · 𝐴))
5551, 54syl 17 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘-𝑚) = (-𝑚 · 𝐴))
5627adantl 482 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹𝑚) = (𝑚 · 𝐴))
5756fveq2d 6846 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → ((invg𝐺)‘(𝐹𝑚)) = ((invg𝐺)‘(𝑚 · 𝐴)))
5849, 55, 573eqtr4d 2786 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘-𝑚) = ((invg𝐺)‘(𝐹𝑚)))
59 fnfvelrn 7031 . . . . . . . 8 ((𝐹 Fn ℤ ∧ -𝑚 ∈ ℤ) → (𝐹‘-𝑚) ∈ ran 𝐹)
609, 50, 59syl2an 596 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘-𝑚) ∈ ran 𝐹)
6158, 60eqeltrrd 2839 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → ((invg𝐺)‘(𝐹𝑚)) ∈ ran 𝐹)
6245, 61jca 512 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴𝑋) ∧ 𝑚 ∈ ℤ) → (∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘(𝐹𝑚)) ∈ ran 𝐹))
6362ralrimiva 3143 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ∀𝑚 ∈ ℤ (∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘(𝐹𝑚)) ∈ ran 𝐹))
64 oveq1 7364 . . . . . . . . 9 (𝑢 = (𝐹𝑚) → (𝑢(+g𝐺)𝑣) = ((𝐹𝑚)(+g𝐺)𝑣))
6564eleq1d 2822 . . . . . . . 8 (𝑢 = (𝐹𝑚) → ((𝑢(+g𝐺)𝑣) ∈ ran 𝐹 ↔ ((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹))
6665ralbidv 3174 . . . . . . 7 (𝑢 = (𝐹𝑚) → (∀𝑣 ∈ ran 𝐹(𝑢(+g𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹))
67 fveq2 6842 . . . . . . . 8 (𝑢 = (𝐹𝑚) → ((invg𝐺)‘𝑢) = ((invg𝐺)‘(𝐹𝑚)))
6867eleq1d 2822 . . . . . . 7 (𝑢 = (𝐹𝑚) → (((invg𝐺)‘𝑢) ∈ ran 𝐹 ↔ ((invg𝐺)‘(𝐹𝑚)) ∈ ran 𝐹))
6966, 68anbi12d 631 . . . . . 6 (𝑢 = (𝐹𝑚) → ((∀𝑣 ∈ ran 𝐹(𝑢(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘𝑢) ∈ ran 𝐹) ↔ (∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘(𝐹𝑚)) ∈ ran 𝐹)))
7069ralrn 7038 . . . . 5 (𝐹 Fn ℤ → (∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘𝑢) ∈ ran 𝐹) ↔ ∀𝑚 ∈ ℤ (∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘(𝐹𝑚)) ∈ ran 𝐹)))
719, 70syl 17 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘𝑢) ∈ ran 𝐹) ↔ ∀𝑚 ∈ ℤ (∀𝑣 ∈ ran 𝐹((𝐹𝑚)(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘(𝐹𝑚)) ∈ ran 𝐹)))
7263, 71mpbird 256 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘𝑢) ∈ ran 𝐹))
731, 15, 46issubg2 18943 . . . 4 (𝐺 ∈ Grp → (ran 𝐹 ∈ (SubGrp‘𝐺) ↔ (ran 𝐹𝑋 ∧ ran 𝐹 ≠ ∅ ∧ ∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘𝑢) ∈ ran 𝐹))))
7473adantr 481 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (ran 𝐹 ∈ (SubGrp‘𝐺) ↔ (ran 𝐹𝑋 ∧ ran 𝐹 ≠ ∅ ∧ ∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg𝐺)‘𝑢) ∈ ran 𝐹))))
758, 13, 72, 74mpbir3and 1342 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → ran 𝐹 ∈ (SubGrp‘𝐺))
76 oveq1 7364 . . . . . 6 (𝑥 = 1 → (𝑥 · 𝐴) = (1 · 𝐴))
77 ovex 7390 . . . . . 6 (1 · 𝐴) ∈ V
7876, 6, 77fvmpt 6948 . . . . 5 (1 ∈ ℤ → (𝐹‘1) = (1 · 𝐴))
7910, 78ax-mp 5 . . . 4 (𝐹‘1) = (1 · 𝐴)
801, 2mulg1 18883 . . . . 5 (𝐴𝑋 → (1 · 𝐴) = 𝐴)
8180adantl 482 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (1 · 𝐴) = 𝐴)
8279, 81eqtrid 2788 . . 3 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐹‘1) = 𝐴)
8382, 12eqeltrrd 2839 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → 𝐴 ∈ ran 𝐹)
8475, 83jca 512 1 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (ran 𝐹 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ran 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wne 2943  wral 3064  wss 3910  c0 4282  cmpt 5188  ran crn 5634   Fn wfn 6491  cfv 6496  (class class class)co 7357  1c1 11052   + caddc 11054  -cneg 11386  cz 12499  Basecbs 17083  +gcplusg 17133  Grpcgrp 18748  invgcminusg 18749  .gcmg 18872  SubGrpcsubg 18922
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-er 8648  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-n0 12414  df-z 12500  df-uz 12764  df-fz 13425  df-seq 13907  df-sets 17036  df-slot 17054  df-ndx 17066  df-base 17084  df-ress 17113  df-plusg 17146  df-0g 17323  df-mgm 18497  df-sgrp 18546  df-mnd 18557  df-grp 18751  df-minusg 18752  df-mulg 18873  df-subg 18925
This theorem is referenced by:  cycsubg  19001  cycsubgcld  19002  oddvds2  19348  cycsubgcyg  19678
  Copyright terms: Public domain W3C validator