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

Theorem cycsubgcl 19473
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 19353 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥 ∈ ℤ ∧ 𝐴 ∈ 𝑋) → (𝑥 · 𝐴) ∈ 𝑋)
433expa 1137 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝑥 ∈ ℤ) ∧ 𝐴 ∈ 𝑋) → (𝑥 · 𝐴) ∈ 𝑋)
54an32s 665 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ ℤ) → (𝑥 · 𝐴) ∈ 𝑋)
6 cycsubg.f . . . . 5 𝐹 = (𝑥 ∈ ℤ ↦ (𝑥 · 𝐴))
75, 6fmptd 7145 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → 𝐹:ℤ⟶𝑋)
87frnd 6747 . . 3 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ran 𝐹 ⊆ 𝑋)
97ffnd 6739 . . . . 5 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → 𝐹 Fn ℤ)
10 1z 12765 . . . . 5 1 ∈ ℤ
11 fnfvelrn 7111 . . . . 5 ((𝐹 Fn ℤ ∧ 1 ∈ ℤ) → (𝐹‘1) ∈ ran 𝐹)
129, 10, 11sylancl 598 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐹‘1) ∈ ran 𝐹)
1312ne0d 4290 . . 3 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ran 𝐹 ≠ ∅)
14 df-3an 1106 . . . . . . . . . . . . 13 ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝐴 ∈ 𝑋) ↔ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝐴 ∈ 𝑋))
15 eqid 2766 . . . . . . . . . . . . . 14 (+g‘𝐺) = (+g‘𝐺)
161, 2, 15mulgdir 19368 . . . . . . . . . . . . 13 ((𝐺 ∈ Grp ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝐴 ∈ 𝑋)) → ((𝑚 + 𝑛) · 𝐴) = ((𝑚 · 𝐴)(+g‘𝐺)(𝑛 · 𝐴)))
1714, 16sylan2br 607 . . . . . . . . . . . 12 ((𝐺 ∈ Grp ∧ ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝐴 ∈ 𝑋)) → ((𝑚 + 𝑛) · 𝐴) = ((𝑚 · 𝐴)(+g‘𝐺)(𝑛 · 𝐴)))
1817anass1rs 668 . . . . . . . . . . 11 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝑚 + 𝑛) · 𝐴) = ((𝑚 · 𝐴)(+g‘𝐺)(𝑛 · 𝐴)))
19 zaddcl 12775 . . . . . . . . . . . . 13 ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) → (𝑚 + 𝑛) ∈ ℤ)
2019adantl 487 . . . . . . . . . . . 12 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝑚 + 𝑛) ∈ ℤ)
21 oveq1 7457 . . . . . . . . . . . . 13 (𝑥 = (𝑚 + 𝑛) → (𝑥 · 𝐴) = ((𝑚 + 𝑛) · 𝐴))
22 ovex 7483 . . . . . . . . . . . . 13 ((𝑚 + 𝑛) · 𝐴) ∈ V
2321, 6, 22fvmpt 7023 . . . . . . . . . . . 12 ((𝑚 + 𝑛) ∈ ℤ → (𝐹‘(𝑚 + 𝑛)) = ((𝑚 + 𝑛) · 𝐴))
2420, 23syl 18 . . . . . . . . . . 11 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘(𝑚 + 𝑛)) = ((𝑚 + 𝑛) · 𝐴))
25 oveq1 7457 . . . . . . . . . . . . . 14 (𝑥 = 𝑚 → (𝑥 · 𝐴) = (𝑚 · 𝐴))
26 ovex 7483 . . . . . . . . . . . . . 14 (𝑚 · 𝐴) ∈ V
2725, 6, 26fvmpt 7023 . . . . . . . . . . . . 13 (𝑚 ∈ ℤ → (𝐹‘𝑚) = (𝑚 · 𝐴))
2827ad2antrl 741 . . . . . . . . . . . 12 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘𝑚) = (𝑚 · 𝐴))
29 oveq1 7457 . . . . . . . . . . . . . 14 (𝑥 = 𝑛 → (𝑥 · 𝐴) = (𝑛 · 𝐴))
30 ovex 7483 . . . . . . . . . . . . . 14 (𝑛 · 𝐴) ∈ V
3129, 6, 30fvmpt 7023 . . . . . . . . . . . . 13 (𝑛 ∈ ℤ → (𝐹‘𝑛) = (𝑛 · 𝐴))
3231ad2antll 742 . . . . . . . . . . . 12 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘𝑛) = (𝑛 · 𝐴))
3328, 32oveq12d 7468 . . . . . . . . . . 11 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) = ((𝑚 · 𝐴)(+g‘𝐺)(𝑛 · 𝐴)))
3418, 24, 333eqtr4d 2811 . . . . . . . . . 10 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘(𝑚 + 𝑛)) = ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)))
35 fnfvelrn 7111 . . . . . . . . . . 11 ((𝐹 Fn ℤ ∧ (𝑚 + 𝑛) ∈ ℤ) → (𝐹‘(𝑚 + 𝑛)) ∈ ran 𝐹)
369, 19, 35syl2an 608 . . . . . . . . . 10 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → (𝐹‘(𝑚 + 𝑛)) ∈ ran 𝐹)
3734, 36eqeltrrd 2868 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ)) → ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹)
3837anassrs 473 . . . . . . . 8 ((((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) ∧ 𝑛 ∈ ℤ) → ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹)
3938ralrimiva 3161 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → ∀𝑛 ∈ ℤ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹)
40 oveq2 7458 . . . . . . . . . . 11 (𝑣 = (𝐹‘𝑛) → ((𝐹‘𝑚)(+g‘𝐺)𝑣) = ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)))
4140eleq1d 2852 . . . . . . . . . 10 (𝑣 = (𝐹‘𝑛) → (((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹))
4241ralrn 7119 . . . . . . . . 9 (𝐹 Fn ℤ → (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑛 ∈ ℤ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹))
439, 42syl 18 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑛 ∈ ℤ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹))
4443adantr 486 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑛 ∈ ℤ ((𝐹‘𝑚)(+g‘𝐺)(𝐹‘𝑛)) ∈ ran 𝐹))
4539, 44mpbird 260 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → ∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹)
46 eqid 2766 . . . . . . . . . . 11 (invg‘𝐺) = (invg‘𝐺)
471, 2, 46mulgneg 19354 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑚 ∈ ℤ ∧ 𝐴 ∈ 𝑋) → ( -𝑚 · 𝐴) = ((invg‘𝐺)‘(𝑚 · 𝐴)))
48473expa 1137 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝑚 ∈ ℤ) ∧ 𝐴 ∈ 𝑋) → ( -𝑚 · 𝐴) = ((invg‘𝐺)‘(𝑚 · 𝐴)))
4948an32s 665 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → ( -𝑚 · 𝐴) = ((invg‘𝐺)‘(𝑚 · 𝐴)))
50 znegcl 12770 . . . . . . . . . 10 (𝑚 ∈ ℤ → -𝑚 ∈ ℤ)
5150adantl 487 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → -𝑚 ∈ ℤ)
52 oveq1 7457 . . . . . . . . . 10 (𝑥 = -𝑚 → (𝑥 · 𝐴) = ( -𝑚 · 𝐴))
53 ovex 7483 . . . . . . . . . 10 ( -𝑚 · 𝐴) ∈ V
5452, 6, 53fvmpt 7023 . . . . . . . . 9 ( -𝑚 ∈ ℤ → (𝐹‘ -𝑚) = ( -𝑚 · 𝐴))
5551, 54syl 18 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘ -𝑚) = ( -𝑚 · 𝐴))
5627adantl 487 . . . . . . . . 9 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘𝑚) = (𝑚 · 𝐴))
5756fveq2d 6919 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → ((invg‘𝐺)‘(𝐹‘𝑚)) = ((invg‘𝐺)‘(𝑚 · 𝐴)))
5849, 55, 573eqtr4d 2811 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘ -𝑚) = ((invg‘𝐺)‘(𝐹‘𝑚)))
59 fnfvelrn 7111 . . . . . . . 8 ((𝐹 Fn ℤ ∧ -𝑚 ∈ ℤ) → (𝐹‘ -𝑚) ∈ ran 𝐹)
609, 50, 59syl2an 608 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (𝐹‘ -𝑚) ∈ ran 𝐹)
6158, 60eqeltrrd 2868 . . . . . 6 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹)
6245, 61jca 521 . . . . 5 (((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) ∧ 𝑚 ∈ ℤ) → (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹))
6362ralrimiva 3161 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ∀𝑚 ∈ ℤ (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹))
64 oveq1 7457 . . . . . . . . 9 (𝑢 = (𝐹‘𝑚) → (𝑢(+g‘𝐺)𝑣) = ((𝐹‘𝑚)(+g‘𝐺)𝑣))
6564eleq1d 2852 . . . . . . . 8 (𝑢 = (𝐹‘𝑚) → ((𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹))
6665ralbidv 3192 . . . . . . 7 (𝑢 = (𝐹‘𝑚) → (∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ↔ ∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹))
67 fveq2 6915 . . . . . . . 8 (𝑢 = (𝐹‘𝑚) → ((invg‘𝐺)‘𝑢) = ((invg‘𝐺)‘(𝐹‘𝑚)))
6867eleq1d 2852 . . . . . . 7 (𝑢 = (𝐹‘𝑚) → (((invg‘𝐺)‘𝑢) ∈ ran 𝐹 ↔ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹))
6966, 68anbi12d 644 . . . . . 6 (𝑢 = (𝐹‘𝑚) → ((∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹) ↔ (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹)))
7069ralrn 7119 . . . . 5 (𝐹 Fn ℤ → (∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹) ↔ ∀𝑚 ∈ ℤ (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹)))
719, 70syl 18 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹) ↔ ∀𝑚 ∈ ℤ (∀𝑣 ∈ ran 𝐹((𝐹‘𝑚)(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘(𝐹‘𝑚)) ∈ ran 𝐹)))
7263, 71mpbird 260 . . 3 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹))
731, 15, 46issubg2 19404 . . . 4 (𝐺 ∈ Grp → (ran 𝐹 ∈ (SubGrp‘𝐺) ↔ (ran 𝐹 ⊆ 𝑋 ∧ ran 𝐹 ≠ ∅ ∧ ∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹))))
7473adantr 486 . . 3 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (ran 𝐹 ∈ (SubGrp‘𝐺) ↔ (ran 𝐹 ⊆ 𝑋 ∧ ran 𝐹 ≠ ∅ ∧ ∀𝑢 ∈ ran 𝐹(∀𝑣 ∈ ran 𝐹(𝑢(+g‘𝐺)𝑣) ∈ ran 𝐹 ∧ ((invg‘𝐺)‘𝑢) ∈ ran 𝐹))))
758, 13, 72, 74mpbir3and 1363 . 2 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ran 𝐹 ∈ (SubGrp‘𝐺))
76 oveq1 7457 . . . . . 6 (𝑥 = 1 → (𝑥 · 𝐴) = (1 · 𝐴))
77 ovex 7483 . . . . . 6 (1 · 𝐴) ∈ V
7876, 6, 77fvmpt 7023 . . . . 5 (1 ∈ ℤ → (𝐹‘1) = (1 · 𝐴))
7910, 78ax-mp 5 . . . 4 (𝐹‘1) = (1 · 𝐴)
801, 2mulg1 19343 . . . . 5 (𝐴 ∈ 𝑋 → (1 · 𝐴) = 𝐴)
8180adantl 487 . . . 4 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (1 · 𝐴) = 𝐴)
8279, 81eqtrid 2813 . . 3 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐹‘1) = 𝐴)
8382, 12eqeltrrd 2868 . 2 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ ran 𝐹)
8475, 83jca 521 1 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (ran 𝐹 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ ran 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  ∀wral 3083   ⊆ wss 3899  ∅c0 4280   ↦ cmpt 5191  ran crn 5658   Fn wfn 6560  ‘cfv 6565  (class class class)co 7450  1c1 11239   + caddc 11241   -cneg 11580  ℤcz 12732  Basecbs 17433  +gcplusg 17474  Grpcgrp 19196  invgcminusg 19197  .gcmg 19329  SubGrpcsubg 19382
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-n0 12646  df-z 12733  df-uz 13005  df-fz 13679  df-seq 14184  df-sets 17388  df-slot 17406  df-ndx 17418  df-base 17434  df-ress 17455  df-plusg 17488  df-0g 17664  df-mgm 18868  df-sgrp 18960  df-mnd 18976  df-grp 19199  df-minusg 19200  df-mulg 19330  df-subg 19385
This theorem is used by:  cycsubg  19475  cycsubgcld  19476  oddvds2  19833  cycsubgcyg  20168
  Copyright terms: Public domain W3C validator