primrootspoweq0 - Mathbox for metakunt

	Mathbox for metakunt		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > primrootspoweq0		Structured version Visualization version GIF version

Theorem primrootspoweq0 42272

Description: The power of a 𝑅-th primitive root is zero if and only if it divides 𝑅. (Contributed by metakunt, 15-May-2025.)

**Hypotheses**
Ref	Expression
primrootspoweq0.1	⊢ (𝜑 → 𝑅 ∈ CMnd)
primrootspoweq0.2	⊢ (𝜑 → 𝐾 ∈ ℕ)
primrootspoweq0.3	⊢ (𝜑 → 𝑀 ∈ (𝑅 PrimRoots 𝐾))
primrootspoweq0.4	⊢ 𝑈 = {𝑎 ∈ (Base‘𝑅) ∣ ∃𝑖 ∈ (Base‘𝑅)(𝑖(+_g‘𝑅)𝑎) = (0_g‘𝑅)}
primrootspoweq0.5	⊢ (𝜑 → 𝑁 ∈ ℤ)

**Assertion**
Ref	Expression
primrootspoweq0	⊢ (𝜑 → ((𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) ↔ 𝐾 ∥ 𝑁))

Distinct variable group: 𝑅,𝑎,𝑖 Allowed substitution hints: 𝜑(𝑖,𝑎) 𝑈(𝑖,𝑎) 𝐾(𝑖,𝑎) 𝑀(𝑖,𝑎) 𝑁(𝑖,𝑎)

Proof of Theorem primrootspoweq0 Dummy variables 𝑙 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 768	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑁 = ((𝑥 · 𝐾) + 𝑦))
2	1	oveq1d 7370	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (((𝑥 · 𝐾) + 𝑦)(._g‘(𝑅 ↾_s 𝑈))𝑀))
3		primrootspoweq0.1	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑅 ∈ CMnd)
4		primrootspoweq0.2	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐾 ∈ ℕ)
5		primrootspoweq0.4	. . . . . . . . . . . . . 14 ⊢ 𝑈 = {𝑎 ∈ (Base‘𝑅) ∣ ∃𝑖 ∈ (Base‘𝑅)(𝑖(+_g‘𝑅)𝑎) = (0_g‘𝑅)}
6	3, 4, 5	primrootsunit 42264	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑅 PrimRoots 𝐾) = ((𝑅 ↾_s 𝑈) PrimRoots 𝐾) ∧ (𝑅 ↾_s 𝑈) ∈ Abel))
7	6	simprd 495	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑅 ↾_s 𝑈) ∈ Abel)
8	7	ad4antr 732	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑅 ↾_s 𝑈) ∈ Abel)
9	8	ablgrpd 19706	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑅 ↾_s 𝑈) ∈ Grp)
10		simp-4r 783	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑥 ∈ ℤ)
11	4	nnzd 12505	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐾 ∈ ℤ)
12	11	ad4antr 732	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝐾 ∈ ℤ)
13	10, 12	zmulcld 12593	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥 · 𝐾) ∈ ℤ)
14		simpllr 775	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑦 ∈ (0...(𝐾 − 1)))
15	14	elfzelzd 13432	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑦 ∈ ℤ)
16		primrootspoweq0.3	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑀 ∈ (𝑅 PrimRoots 𝐾))
17	6	simpld 494	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑅 PrimRoots 𝐾) = ((𝑅 ↾_s 𝑈) PrimRoots 𝐾))
18	16, 17	eleqtrd 2835	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ ((𝑅 ↾_s 𝑈) PrimRoots 𝐾))
19		ablcmn 19707	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑅 ↾_s 𝑈) ∈ Abel → (𝑅 ↾_s 𝑈) ∈ CMnd)
20	7, 19	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑅 ↾_s 𝑈) ∈ CMnd)
21	4	nnnn0d 12453	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐾 ∈ ℕ₀)
22		eqid 2733	. . . . . . . . . . . . . . . 16 ⊢ (._g‘(𝑅 ↾_s 𝑈)) = (._g‘(𝑅 ↾_s 𝑈))
23	20, 21, 22	isprimroot 42259	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑀 ∈ ((𝑅 ↾_s 𝑈) PrimRoots 𝐾) ↔ (𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)) ∧ (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) ∧ ∀𝑙 ∈ ℕ₀ ((𝑙(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) → 𝐾 ∥ 𝑙))))
24	23	biimpd 229	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑀 ∈ ((𝑅 ↾_s 𝑈) PrimRoots 𝐾) → (𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)) ∧ (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) ∧ ∀𝑙 ∈ ℕ₀ ((𝑙(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) → 𝐾 ∥ 𝑙))))
25	18, 24	mpd 15	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)) ∧ (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) ∧ ∀𝑙 ∈ ℕ₀ ((𝑙(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) → 𝐾 ∥ 𝑙)))
26	25	simp1d 1142	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))
27	26	ad4antr 732	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))
28	13, 15, 27	3jca 1128	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((𝑥 · 𝐾) ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈))))
29		eqid 2733	. . . . . . . . . . 11 ⊢ (Base‘(𝑅 ↾_s 𝑈)) = (Base‘(𝑅 ↾_s 𝑈))
30		eqid 2733	. . . . . . . . . . 11 ⊢ (+_g‘(𝑅 ↾_s 𝑈)) = (+_g‘(𝑅 ↾_s 𝑈))
31	29, 22, 30	mulgdir 19027	. . . . . . . . . 10 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ ((𝑥 · 𝐾) ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))) → (((𝑥 · 𝐾) + 𝑦)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀)(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)))
32	9, 28, 31	syl2anc 584	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (((𝑥 · 𝐾) + 𝑦)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀)(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)))
33	10, 12, 27	3jca 1128	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈))))
34	29, 22	mulgass 19032	. . . . . . . . . . . . 13 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ (𝑥 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))) → ((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑥(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)))
35	9, 33, 34	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑥(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)))
36	25	simp2d 1143	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
37	36	ad4antr 732	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
38	37	oveq2d 7371	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (𝑥(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))))
39		eqid 2733	. . . . . . . . . . . . . . 15 ⊢ (0_g‘(𝑅 ↾_s 𝑈)) = (0_g‘(𝑅 ↾_s 𝑈))
40	29, 22, 39	mulgz 19023	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ 𝑥 ∈ ℤ) → (𝑥(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))) = (0_g‘(𝑅 ↾_s 𝑈)))
41	9, 10, 40	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))) = (0_g‘(𝑅 ↾_s 𝑈)))
42	38, 41	eqtrd 2768	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (0_g‘(𝑅 ↾_s 𝑈)))
43	35, 42	eqtrd 2768	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
44	43	oveq1d 7370	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀)(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)) = ((0_g‘(𝑅 ↾_s 𝑈))(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)))
45	29, 22, 9, 15, 27	mulgcld 19017	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀) ∈ (Base‘(𝑅 ↾_s 𝑈)))
46	29, 30, 39, 9, 45	grplidd 18890	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((0_g‘(𝑅 ↾_s 𝑈))(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀))
47	44, 46	eqtrd 2768	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀)(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀))
48	32, 47	eqtrd 2768	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (((𝑥 · 𝐾) + 𝑦)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀))
49	2, 48	eqtrd 2768	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀))
50	8, 19	syl 17	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑅 ↾_s 𝑈) ∈ CMnd)
51	4	ad4antr 732	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝐾 ∈ ℕ)
52	16	ad4antr 732	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑀 ∈ (𝑅 PrimRoots 𝐾))
53	17	ad4antr 732	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑅 PrimRoots 𝐾) = ((𝑅 ↾_s 𝑈) PrimRoots 𝐾))
54	52, 53	eleqtrd 2835	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑀 ∈ ((𝑅 ↾_s 𝑈) PrimRoots 𝐾))
55		1cnd 11118	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 1 ∈ ℂ)
56	55	addlidd 11325	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (0 + 1) = 1)
57	4	nnge1d 12184	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 1 ≤ 𝐾)
58	56, 57	eqbrtrd 5117	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (0 + 1) ≤ 𝐾)
59		0red 11126	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 0 ∈ ℝ)
60		1red 11124	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 1 ∈ ℝ)
61	4	nnred 12151	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐾 ∈ ℝ)
62		leaddsub 11604	. . . . . . . . . . . . . . . 16 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝐾 ∈ ℝ) → ((0 + 1) ≤ 𝐾 ↔ 0 ≤ (𝐾 − 1)))
63	59, 60, 61, 62	syl3anc 1373	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((0 + 1) ≤ 𝐾 ↔ 0 ≤ (𝐾 − 1)))
64	58, 63	mpbid 232	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 0 ≤ (𝐾 − 1))
65		0zd 12491	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0 ∈ ℤ)
66		1zzd 12513	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 1 ∈ ℤ)
67	11, 66	zsubcld 12592	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐾 − 1) ∈ ℤ)
68		eluz 12756	. . . . . . . . . . . . . . 15 ⊢ ((0 ∈ ℤ ∧ (𝐾 − 1) ∈ ℤ) → ((𝐾 − 1) ∈ (ℤ_≥‘0) ↔ 0 ≤ (𝐾 − 1)))
69	65, 67, 68	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝐾 − 1) ∈ (ℤ_≥‘0) ↔ 0 ≤ (𝐾 − 1)))
70	64, 69	mpbird 257	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐾 − 1) ∈ (ℤ_≥‘0))
71		elfzp12 13510	. . . . . . . . . . . . 13 ⊢ ((𝐾 − 1) ∈ (ℤ_≥‘0) → (𝑦 ∈ (0...(𝐾 − 1)) ↔ (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1)))))
72	70, 71	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑦 ∈ (0...(𝐾 − 1)) ↔ (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1)))))
73	72	ad4antr 732	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 ∈ (0...(𝐾 − 1)) ↔ (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1)))))
74	73	biimpd 229	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 ∈ (0...(𝐾 − 1)) → (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1)))))
75	14, 74	mpd 15	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1))))
76		simp-5r 785	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑥 ∈ ℤ)
77	51	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∈ ℕ)
78	77	nnzd 12505	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∈ ℤ)
79		dvdsmul2 16196	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℤ ∧ 𝐾 ∈ ℤ) → 𝐾 ∥ (𝑥 · 𝐾))
80	76, 78, 79	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∥ (𝑥 · 𝐾))
81	76	zcnd 12588	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑥 ∈ ℂ)
82	77	nncnd 12152	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∈ ℂ)
83	81, 82	mulcld 11143	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → (𝑥 · 𝐾) ∈ ℂ)
84	83	addridd 11324	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → ((𝑥 · 𝐾) + 0) = (𝑥 · 𝐾))
85	84	eqcomd 2739	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → (𝑥 · 𝐾) = ((𝑥 · 𝐾) + 0))
86		simpr 484	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑦 = 0)
87	86	eqcomd 2739	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 0 = 𝑦)
88	87	oveq2d 7371	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → ((𝑥 · 𝐾) + 0) = ((𝑥 · 𝐾) + 𝑦))
89	85, 88	eqtrd 2768	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → (𝑥 · 𝐾) = ((𝑥 · 𝐾) + 𝑦))
90	80, 89	breqtrd 5121	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∥ ((𝑥 · 𝐾) + 𝑦))
91	1	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑁 = ((𝑥 · 𝐾) + 𝑦))
92	91	eqcomd 2739	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → ((𝑥 · 𝐾) + 𝑦) = 𝑁)
93	90, 92	breqtrd 5121	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∥ 𝑁)
94		simplr 768	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → ¬ 𝐾 ∥ 𝑁)
95	93, 94	pm2.21dd 195	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑦 ∈ (1...(𝐾 − 1)))
96	95	ex 412	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 = 0 → 𝑦 ∈ (1...(𝐾 − 1))))
97		1cnd 11118	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 1 ∈ ℂ)
98	97	addlidd 11325	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (0 + 1) = 1)
99	98	oveq1d 7370	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((0 + 1)...(𝐾 − 1)) = (1...(𝐾 − 1)))
100		ssidd 3954	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (1...(𝐾 − 1)) ⊆ (1...(𝐾 − 1)))
101	99, 100	eqsstrd 3965	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((0 + 1)...(𝐾 − 1)) ⊆ (1...(𝐾 − 1)))
102	101	sseld 3929	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 ∈ ((0 + 1)...(𝐾 − 1)) → 𝑦 ∈ (1...(𝐾 − 1))))
103	96, 102	jaod 859	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1))) → 𝑦 ∈ (1...(𝐾 − 1))))
104	75, 103	mpd 15	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑦 ∈ (1...(𝐾 − 1)))
105	50, 51, 54, 104	primrootlekpowne0 42271	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀) ≠ (0_g‘(𝑅 ↾_s 𝑈)))
106	49, 105	eqnetrd 2996	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) ≠ (0_g‘(𝑅 ↾_s 𝑈)))
107	106	neneqd 2934	. . . . 5 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ¬ (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
108	107	ex 412	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) → (¬ 𝐾 ∥ 𝑁 → ¬ (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈))))
109	108	con4d 115	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) → ((𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) → 𝐾 ∥ 𝑁))
110		simp-4l 782	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ 𝐾 ∥ 𝑁) → 𝜑)
111		simpr 484	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ 𝐾 ∥ 𝑁) → 𝐾 ∥ 𝑁)
112	110, 111	jca 511	. . . . 5 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ 𝐾 ∥ 𝑁) → (𝜑 ∧ 𝐾 ∥ 𝑁))
113		primrootspoweq0.5	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℤ)
114		divides 16172	. . . . . . . . 9 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∥ 𝑁 ↔ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁))
115	11, 113, 114	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → (𝐾 ∥ 𝑁 ↔ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁))
116	115	biimpd 229	. . . . . . 7 ⊢ (𝜑 → (𝐾 ∥ 𝑁 → ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁))
117	116	imp 406	. . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∥ 𝑁) → ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁)
118		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦 · 𝐾) = 𝑁)
119	118	eqcomd 2739	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → 𝑁 = (𝑦 · 𝐾))
120	119	oveq1d 7370	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = ((𝑦 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀))
121	7	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑅 ↾_s 𝑈) ∈ Abel)
122		ablgrp 19705	. . . . . . . . . . . . 13 ⊢ ((𝑅 ↾_s 𝑈) ∈ Abel → (𝑅 ↾_s 𝑈) ∈ Grp)
123	121, 122	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑅 ↾_s 𝑈) ∈ Grp)
124		simplr 768	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → 𝑦 ∈ ℤ)
125	11	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → 𝐾 ∈ ℤ)
126	26	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))
127	124, 125, 126	3jca 1128	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈))))
128	29, 22	mulgass 19032	. . . . . . . . . . . 12 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ (𝑦 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))) → ((𝑦 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑦(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)))
129	123, 127, 128	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑦 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑦(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)))
130	36	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
131	130	oveq2d 7371	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (𝑦(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))))
132	29, 22, 39	mulgz 19023	. . . . . . . . . . . . 13 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ 𝑦 ∈ ℤ) → (𝑦(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))) = (0_g‘(𝑅 ↾_s 𝑈)))
133	123, 124, 132	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))) = (0_g‘(𝑅 ↾_s 𝑈)))
134	131, 133	eqtrd 2768	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (0_g‘(𝑅 ↾_s 𝑈)))
135	129, 134	eqtrd 2768	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑦 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
136	120, 135	eqtrd 2768	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
137		nfv 1915	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦(𝑥 · 𝐾) = 𝑁
138		nfv 1915	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥(𝑦 · 𝐾) = 𝑁
139		oveq1 7362	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (𝑥 · 𝐾) = (𝑦 · 𝐾))
140	139	eqeq1d 2735	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → ((𝑥 · 𝐾) = 𝑁 ↔ (𝑦 · 𝐾) = 𝑁))
141	137, 138, 140	cbvrexw 3276	. . . . . . . . . . 11 ⊢ (∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁 ↔ ∃𝑦 ∈ ℤ (𝑦 · 𝐾) = 𝑁)
142	141	biimpi 216	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁 → ∃𝑦 ∈ ℤ (𝑦 · 𝐾) = 𝑁)
143	142	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) → ∃𝑦 ∈ ℤ (𝑦 · 𝐾) = 𝑁)
144	136, 143	r19.29a 3141	. . . . . . . 8 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
145	144	ex 412	. . . . . . 7 ⊢ (𝜑 → (∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁 → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈))))
146	145	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∥ 𝑁) → (∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁 → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈))))
147	117, 146	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ 𝐾 ∥ 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
148	112, 147	syl 17	. . . 4 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ 𝐾 ∥ 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
149	148	ex 412	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) → (𝐾 ∥ 𝑁 → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈))))
150	109, 149	impbid 212	. 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) → ((𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) ↔ 𝐾 ∥ 𝑁))
151	113, 4	remexz 42270	. 2 ⊢ (𝜑 → ∃𝑥 ∈ ℤ ∃𝑦 ∈ (0...(𝐾 − 1))𝑁 = ((𝑥 · 𝐾) + 𝑦))
152	150, 151	r19.29vva 3193	1 ⊢ (𝜑 → ((𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) ↔ 𝐾 ∥ 𝑁))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∀wral 3048 ∃wrex 3057 {crab 3396 class class class wbr 5095 ‘cfv 6489 (class class class)co 7355 ℝcr 11016 0cc0 11017 1c1 11018 + caddc 11020 · cmul 11022 ≤ cle 11158 − cmin 11355 ℕcn 12136 ℕ₀cn0 12392 ℤcz 12479 ℤ_≥cuz 12742 ...cfz 13414 ∥ cdvds 16170 Basecbs 17127 ↾_s cress 17148 +_gcplusg 17168 0_gc0g 17350 Grpcgrp 18854 ._gcmg 18988 CMndccmn 19700 Abelcabl 19701 PrimRoots cprimroots 42257

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 ax-pre-mulgt0 11094 ax-pre-sup 11095

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-er 8631 df-en 8880 df-dom 8881 df-sdom 8882 df-sup 9337 df-inf 9338 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-sub 11357 df-neg 11358 df-div 11786 df-nn 12137 df-2 12199 df-n0 12393 df-z 12480 df-uz 12743 df-rp 12897 df-ico 13258 df-fz 13415 df-fzo 13562 df-fl 13703 df-mod 13781 df-seq 13916 df-dvds 16171 df-sets 17082 df-slot 17100 df-ndx 17112 df-base 17128 df-ress 17149 df-plusg 17181 df-0g 17352 df-mgm 18556 df-sgrp 18635 df-mnd 18651 df-submnd 18700 df-grp 18857 df-minusg 18858 df-mulg 18989 df-cmn 19702 df-abl 19703 df-primroots 42258

This theorem is referenced by: aks6d1c6isolem3 42342

W3C validator