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 41709

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 767	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑁 = ((𝑥 · 𝐾) + 𝑦))
2	1	oveq1d 7434	. . . . . . . 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 41700	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑅 PrimRoots 𝐾) = ((𝑅 ↾_s 𝑈) PrimRoots 𝐾) ∧ (𝑅 ↾_s 𝑈) ∈ Abel))
7	6	simprd 494	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑅 ↾_s 𝑈) ∈ Abel)
8	7	ad4antr 730	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑅 ↾_s 𝑈) ∈ Abel)
9	8	ablgrpd 19753	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑅 ↾_s 𝑈) ∈ Grp)
10		simp-4r 782	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑥 ∈ ℤ)
11	4	nnzd 12618	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐾 ∈ ℤ)
12	11	ad4antr 730	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝐾 ∈ ℤ)
13	10, 12	zmulcld 12705	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥 · 𝐾) ∈ ℤ)
14		simpllr 774	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑦 ∈ (0...(𝐾 − 1)))
15	14	elfzelzd 13537	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑦 ∈ ℤ)
16		primrootspoweq0.3	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑀 ∈ (𝑅 PrimRoots 𝐾))
17	6	simpld 493	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑅 PrimRoots 𝐾) = ((𝑅 ↾_s 𝑈) PrimRoots 𝐾))
18	16, 17	eleqtrd 2827	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ ((𝑅 ↾_s 𝑈) PrimRoots 𝐾))
19		ablcmn 19754	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑅 ↾_s 𝑈) ∈ Abel → (𝑅 ↾_s 𝑈) ∈ CMnd)
20	7, 19	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑅 ↾_s 𝑈) ∈ CMnd)
21	4	nnnn0d 12565	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐾 ∈ ℕ₀)
22		eqid 2725	. . . . . . . . . . . . . . . 16 ⊢ (._g‘(𝑅 ↾_s 𝑈)) = (._g‘(𝑅 ↾_s 𝑈))
23	20, 21, 22	isprimroot 41696	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑀 ∈ ((𝑅 ↾_s 𝑈) PrimRoots 𝐾) ↔ (𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)) ∧ (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) ∧ ∀𝑙 ∈ ℕ₀ ((𝑙(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) → 𝐾 ∥ 𝑙))))
24	23	biimpd 228	. . . . . . . . . . . . . 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 1139	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))
27	26	ad4antr 730	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))
28	13, 15, 27	3jca 1125	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((𝑥 · 𝐾) ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈))))
29		eqid 2725	. . . . . . . . . . 11 ⊢ (Base‘(𝑅 ↾_s 𝑈)) = (Base‘(𝑅 ↾_s 𝑈))
30		eqid 2725	. . . . . . . . . . 11 ⊢ (+_g‘(𝑅 ↾_s 𝑈)) = (+_g‘(𝑅 ↾_s 𝑈))
31	29, 22, 30	mulgdir 19069	. . . . . . . . . 10 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ ((𝑥 · 𝐾) ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))) → (((𝑥 · 𝐾) + 𝑦)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀)(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)))
32	9, 28, 31	syl2anc 582	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (((𝑥 · 𝐾) + 𝑦)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀)(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)))
33	10, 12, 27	3jca 1125	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈))))
34	29, 22	mulgass 19074	. . . . . . . . . . . . 13 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ (𝑥 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))) → ((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑥(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)))
35	9, 33, 34	syl2anc 582	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑥(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)))
36	25	simp2d 1140	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
37	36	ad4antr 730	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
38	37	oveq2d 7435	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (𝑥(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))))
39		eqid 2725	. . . . . . . . . . . . . . 15 ⊢ (0_g‘(𝑅 ↾_s 𝑈)) = (0_g‘(𝑅 ↾_s 𝑈))
40	29, 22, 39	mulgz 19065	. . . . . . . . . . . . . 14 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ 𝑥 ∈ ℤ) → (𝑥(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))) = (0_g‘(𝑅 ↾_s 𝑈)))
41	9, 10, 40	syl2anc 582	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))) = (0_g‘(𝑅 ↾_s 𝑈)))
42	38, 41	eqtrd 2765	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑥(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (0_g‘(𝑅 ↾_s 𝑈)))
43	35, 42	eqtrd 2765	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
44	43	oveq1d 7434	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀)(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)) = ((0_g‘(𝑅 ↾_s 𝑈))(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)))
45	29, 22, 9, 15, 27	mulgcld 19059	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀) ∈ (Base‘(𝑅 ↾_s 𝑈)))
46	29, 30, 39, 9, 45	grplidd 18934	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((0_g‘(𝑅 ↾_s 𝑈))(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀))
47	44, 46	eqtrd 2765	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (((𝑥 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀)(+_g‘(𝑅 ↾_s 𝑈))(𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀))
48	32, 47	eqtrd 2765	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (((𝑥 · 𝐾) + 𝑦)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀))
49	2, 48	eqtrd 2765	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀))
50	8, 19	syl 17	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑅 ↾_s 𝑈) ∈ CMnd)
51	4	ad4antr 730	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝐾 ∈ ℕ)
52	16	ad4antr 730	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑀 ∈ (𝑅 PrimRoots 𝐾))
53	17	ad4antr 730	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑅 PrimRoots 𝐾) = ((𝑅 ↾_s 𝑈) PrimRoots 𝐾))
54	52, 53	eleqtrd 2827	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 𝑀 ∈ ((𝑅 ↾_s 𝑈) PrimRoots 𝐾))
55		1cnd 11241	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 1 ∈ ℂ)
56	55	addlidd 11447	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (0 + 1) = 1)
57	4	nnge1d 12293	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 1 ≤ 𝐾)
58	56, 57	eqbrtrd 5171	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (0 + 1) ≤ 𝐾)
59		0red 11249	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 0 ∈ ℝ)
60		1red 11247	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 1 ∈ ℝ)
61	4	nnred 12260	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐾 ∈ ℝ)
62		leaddsub 11722	. . . . . . . . . . . . . . . 16 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝐾 ∈ ℝ) → ((0 + 1) ≤ 𝐾 ↔ 0 ≤ (𝐾 − 1)))
63	59, 60, 61, 62	syl3anc 1368	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((0 + 1) ≤ 𝐾 ↔ 0 ≤ (𝐾 − 1)))
64	58, 63	mpbid 231	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 0 ≤ (𝐾 − 1))
65		0zd 12603	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0 ∈ ℤ)
66		1zzd 12626	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 1 ∈ ℤ)
67	11, 66	zsubcld 12704	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐾 − 1) ∈ ℤ)
68		eluz 12869	. . . . . . . . . . . . . . 15 ⊢ ((0 ∈ ℤ ∧ (𝐾 − 1) ∈ ℤ) → ((𝐾 − 1) ∈ (ℤ_≥‘0) ↔ 0 ≤ (𝐾 − 1)))
69	65, 67, 68	syl2anc 582	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝐾 − 1) ∈ (ℤ_≥‘0) ↔ 0 ≤ (𝐾 − 1)))
70	64, 69	mpbird 256	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐾 − 1) ∈ (ℤ_≥‘0))
71		elfzp12 13615	. . . . . . . . . . . . 13 ⊢ ((𝐾 − 1) ∈ (ℤ_≥‘0) → (𝑦 ∈ (0...(𝐾 − 1)) ↔ (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1)))))
72	70, 71	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑦 ∈ (0...(𝐾 − 1)) ↔ (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1)))))
73	72	ad4antr 730	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 ∈ (0...(𝐾 − 1)) ↔ (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1)))))
74	73	biimpd 228	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 ∈ (0...(𝐾 − 1)) → (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1)))))
75	14, 74	mpd 15	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 = 0 ∨ 𝑦 ∈ ((0 + 1)...(𝐾 − 1))))
76		simp-5r 784	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑥 ∈ ℤ)
77	51	adantr 479	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∈ ℕ)
78	77	nnzd 12618	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∈ ℤ)
79		dvdsmul2 16259	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ ℤ ∧ 𝐾 ∈ ℤ) → 𝐾 ∥ (𝑥 · 𝐾))
80	76, 78, 79	syl2anc 582	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∥ (𝑥 · 𝐾))
81	76	zcnd 12700	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑥 ∈ ℂ)
82	77	nncnd 12261	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∈ ℂ)
83	81, 82	mulcld 11266	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → (𝑥 · 𝐾) ∈ ℂ)
84	83	addridd 11446	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → ((𝑥 · 𝐾) + 0) = (𝑥 · 𝐾))
85	84	eqcomd 2731	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → (𝑥 · 𝐾) = ((𝑥 · 𝐾) + 0))
86		simpr 483	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑦 = 0)
87	86	eqcomd 2731	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 0 = 𝑦)
88	87	oveq2d 7435	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → ((𝑥 · 𝐾) + 0) = ((𝑥 · 𝐾) + 𝑦))
89	85, 88	eqtrd 2765	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → (𝑥 · 𝐾) = ((𝑥 · 𝐾) + 𝑦))
90	80, 89	breqtrd 5175	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∥ ((𝑥 · 𝐾) + 𝑦))
91	1	adantr 479	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑁 = ((𝑥 · 𝐾) + 𝑦))
92	91	eqcomd 2731	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → ((𝑥 · 𝐾) + 𝑦) = 𝑁)
93	90, 92	breqtrd 5175	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝐾 ∥ 𝑁)
94		simplr 767	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → ¬ 𝐾 ∥ 𝑁)
95	93, 94	pm2.21dd 194	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) ∧ 𝑦 = 0) → 𝑦 ∈ (1...(𝐾 − 1)))
96	95	ex 411	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 = 0 → 𝑦 ∈ (1...(𝐾 − 1))))
97		1cnd 11241	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → 1 ∈ ℂ)
98	97	addlidd 11447	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (0 + 1) = 1)
99	98	oveq1d 7434	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((0 + 1)...(𝐾 − 1)) = (1...(𝐾 − 1)))
100		ssidd 4000	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (1...(𝐾 − 1)) ⊆ (1...(𝐾 − 1)))
101	99, 100	eqsstrd 4015	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ((0 + 1)...(𝐾 − 1)) ⊆ (1...(𝐾 − 1)))
102	101	sseld 3975	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦 ∈ ((0 + 1)...(𝐾 − 1)) → 𝑦 ∈ (1...(𝐾 − 1))))
103	96, 102	jaod 857	. . . . . . . . 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 41708	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))𝑀) ≠ (0_g‘(𝑅 ↾_s 𝑈)))
106	49, 105	eqnetrd 2997	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) ≠ (0_g‘(𝑅 ↾_s 𝑈)))
107	106	neneqd 2934	. . . . 5 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ ¬ 𝐾 ∥ 𝑁) → ¬ (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
108	107	ex 411	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) → (¬ 𝐾 ∥ 𝑁 → ¬ (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈))))
109	108	con4d 115	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) → ((𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) → 𝐾 ∥ 𝑁))
110		simp-4l 781	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ 𝐾 ∥ 𝑁) → 𝜑)
111		simpr 483	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ 𝐾 ∥ 𝑁) → 𝐾 ∥ 𝑁)
112	110, 111	jca 510	. . . . 5 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) ∧ 𝐾 ∥ 𝑁) → (𝜑 ∧ 𝐾 ∥ 𝑁))
113		primrootspoweq0.5	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℤ)
114		divides 16236	. . . . . . . . 9 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∥ 𝑁 ↔ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁))
115	11, 113, 114	syl2anc 582	. . . . . . . 8 ⊢ (𝜑 → (𝐾 ∥ 𝑁 ↔ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁))
116	115	biimpd 228	. . . . . . 7 ⊢ (𝜑 → (𝐾 ∥ 𝑁 → ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁))
117	116	imp 405	. . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∥ 𝑁) → ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁)
118		simpr 483	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦 · 𝐾) = 𝑁)
119	118	eqcomd 2731	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → 𝑁 = (𝑦 · 𝐾))
120	119	oveq1d 7434	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = ((𝑦 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀))
121	7	ad3antrrr 728	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑅 ↾_s 𝑈) ∈ Abel)
122		ablgrp 19752	. . . . . . . . . . . . 13 ⊢ ((𝑅 ↾_s 𝑈) ∈ Abel → (𝑅 ↾_s 𝑈) ∈ Grp)
123	121, 122	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑅 ↾_s 𝑈) ∈ Grp)
124		simplr 767	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → 𝑦 ∈ ℤ)
125	11	ad3antrrr 728	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → 𝐾 ∈ ℤ)
126	26	ad3antrrr 728	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))
127	124, 125, 126	3jca 1125	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈))))
128	29, 22	mulgass 19074	. . . . . . . . . . . 12 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ (𝑦 ∈ ℤ ∧ 𝐾 ∈ ℤ ∧ 𝑀 ∈ (Base‘(𝑅 ↾_s 𝑈)))) → ((𝑦 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑦(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)))
129	123, 127, 128	syl2anc 582	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑦 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (𝑦(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)))
130	36	ad3antrrr 728	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
131	130	oveq2d 7435	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (𝑦(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))))
132	29, 22, 39	mulgz 19065	. . . . . . . . . . . . 13 ⊢ (((𝑅 ↾_s 𝑈) ∈ Grp ∧ 𝑦 ∈ ℤ) → (𝑦(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))) = (0_g‘(𝑅 ↾_s 𝑈)))
133	123, 124, 132	syl2anc 582	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))(0_g‘(𝑅 ↾_s 𝑈))) = (0_g‘(𝑅 ↾_s 𝑈)))
134	131, 133	eqtrd 2765	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑦(._g‘(𝑅 ↾_s 𝑈))(𝐾(._g‘(𝑅 ↾_s 𝑈))𝑀)) = (0_g‘(𝑅 ↾_s 𝑈)))
135	129, 134	eqtrd 2765	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → ((𝑦 · 𝐾)(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
136	120, 135	eqtrd 2765	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) ∧ 𝑦 ∈ ℤ) ∧ (𝑦 · 𝐾) = 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
137		nfv 1909	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦(𝑥 · 𝐾) = 𝑁
138		nfv 1909	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥(𝑦 · 𝐾) = 𝑁
139		oveq1 7426	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (𝑥 · 𝐾) = (𝑦 · 𝐾))
140	139	eqeq1d 2727	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → ((𝑥 · 𝐾) = 𝑁 ↔ (𝑦 · 𝐾) = 𝑁))
141	137, 138, 140	cbvrexw 3294	. . . . . . . . . . 11 ⊢ (∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁 ↔ ∃𝑦 ∈ ℤ (𝑦 · 𝐾) = 𝑁)
142	141	biimpi 215	. . . . . . . . . 10 ⊢ (∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁 → ∃𝑦 ∈ ℤ (𝑦 · 𝐾) = 𝑁)
143	142	adantl 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) → ∃𝑦 ∈ ℤ (𝑦 · 𝐾) = 𝑁)
144	136, 143	r19.29a 3151	. . . . . . . 8 ⊢ ((𝜑 ∧ ∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁) → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)))
145	144	ex 411	. . . . . . 7 ⊢ (𝜑 → (∃𝑥 ∈ ℤ (𝑥 · 𝐾) = 𝑁 → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈))))
146	145	adantr 479	. . . . . 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 411	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) → (𝐾 ∥ 𝑁 → (𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈))))
150	109, 149	impbid 211	. 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℤ) ∧ 𝑦 ∈ (0...(𝐾 − 1))) ∧ 𝑁 = ((𝑥 · 𝐾) + 𝑦)) → ((𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) ↔ 𝐾 ∥ 𝑁))
151	113, 4	remexz 41707	. 2 ⊢ (𝜑 → ∃𝑥 ∈ ℤ ∃𝑦 ∈ (0...(𝐾 − 1))𝑁 = ((𝑥 · 𝐾) + 𝑦))
152	150, 151	r19.29vva 3203	1 ⊢ (𝜑 → ((𝑁(._g‘(𝑅 ↾_s 𝑈))𝑀) = (0_g‘(𝑅 ↾_s 𝑈)) ↔ 𝐾 ∥ 𝑁))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 845 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∀wral 3050 ∃wrex 3059 {crab 3418 class class class wbr 5149 ‘cfv 6549 (class class class)co 7419 ℝcr 11139 0cc0 11140 1c1 11141 + caddc 11143 · cmul 11145 ≤ cle 11281 − cmin 11476 ℕcn 12245 ℕ₀cn0 12505 ℤcz 12591 ℤ_≥cuz 12855 ...cfz 13519 ∥ cdvds 16234 Basecbs 17183 ↾_s cress 17212 +_gcplusg 17236 0_gc0g 17424 Grpcgrp 18898 ._gcmg 19031 CMndccmn 19747 Abelcabl 19748 PrimRoots cprimroots 41694

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-cnex 11196 ax-resscn 11197 ax-1cn 11198 ax-icn 11199 ax-addcl 11200 ax-addrcl 11201 ax-mulcl 11202 ax-mulrcl 11203 ax-mulcom 11204 ax-addass 11205 ax-mulass 11206 ax-distr 11207 ax-i2m1 11208 ax-1ne0 11209 ax-1rid 11210 ax-rnegex 11211 ax-rrecex 11212 ax-cnre 11213 ax-pre-lttri 11214 ax-pre-lttrn 11215 ax-pre-ltadd 11216 ax-pre-mulgt0 11217 ax-pre-sup 11218

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7872 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-sup 9467 df-inf 9468 df-pnf 11282 df-mnf 11283 df-xr 11284 df-ltxr 11285 df-le 11286 df-sub 11478 df-neg 11479 df-div 11904 df-nn 12246 df-2 12308 df-n0 12506 df-z 12592 df-uz 12856 df-rp 13010 df-ico 13365 df-fz 13520 df-fzo 13663 df-fl 13793 df-mod 13871 df-seq 14003 df-dvds 16235 df-sets 17136 df-slot 17154 df-ndx 17166 df-base 17184 df-ress 17213 df-plusg 17249 df-0g 17426 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-submnd 18744 df-grp 18901 df-minusg 18902 df-mulg 19032 df-cmn 19749 df-abl 19750 df-primroots 41695

This theorem is referenced by: aks6d1c6isolem3 41779

W3C validator