pockthlem - Metamath Proof Explorer

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

Theorem pockthlem 16835

Description: Lemma for pockthg 16836. (Contributed by Mario Carneiro, 2-Mar-2014.)

**Hypotheses**
Ref	Expression
pockthg.1	⊢ (𝜑 → 𝐴 ∈ ℕ)
pockthg.2	⊢ (𝜑 → 𝐵 ∈ ℕ)
pockthg.3	⊢ (𝜑 → 𝐵 < 𝐴)
pockthg.4	⊢ (𝜑 → 𝑁 = ((𝐴 · 𝐵) + 1))
pockthlem.5	⊢ (𝜑 → 𝑃 ∈ ℙ)
pockthlem.6	⊢ (𝜑 → 𝑃 ∥ 𝑁)
pockthlem.7	⊢ (𝜑 → 𝑄 ∈ ℙ)
pockthlem.8	⊢ (𝜑 → (𝑄 pCnt 𝐴) ∈ ℕ)
pockthlem.9	⊢ (𝜑 → 𝐶 ∈ ℤ)
pockthlem.10	⊢ (𝜑 → ((𝐶↑(𝑁 − 1)) mod 𝑁) = 1)
pockthlem.11	⊢ (𝜑 → (((𝐶↑((𝑁 − 1) / 𝑄)) − 1) gcd 𝑁) = 1)

**Assertion**
Ref	Expression
pockthlem	⊢ (𝜑 → (𝑄 pCnt 𝐴) ≤ (𝑄 pCnt (𝑃 − 1)))

**Proof of Theorem pockthlem**
Step	Hyp	Ref	Expression
1		pockthlem.7	. . . . . 6 ⊢ (𝜑 → 𝑄 ∈ ℙ)
2		prmnn 16603	. . . . . 6 ⊢ (𝑄 ∈ ℙ → 𝑄 ∈ ℕ)
3	1, 2	syl 17	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ ℕ)
4		pockthlem.8	. . . . . 6 ⊢ (𝜑 → (𝑄 pCnt 𝐴) ∈ ℕ)
5	4	nnnn0d 12463	. . . . 5 ⊢ (𝜑 → (𝑄 pCnt 𝐴) ∈ ℕ₀)
6	3, 5	nnexpcld 14170	. . . 4 ⊢ (𝜑 → (𝑄↑(𝑄 pCnt 𝐴)) ∈ ℕ)
7	6	nnzd 12516	. . 3 ⊢ (𝜑 → (𝑄↑(𝑄 pCnt 𝐴)) ∈ ℤ)
8		pockthlem.5	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ ℙ)
9		prmnn 16603	. . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
10	8, 9	syl 17	. . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℕ)
11		pockthlem.9	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℤ)
12	10	nnzd 12516	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ∈ ℤ)
13		gcddvds 16432	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℤ ∧ 𝑃 ∈ ℤ) → ((𝐶 gcd 𝑃) ∥ 𝐶 ∧ (𝐶 gcd 𝑃) ∥ 𝑃))
14	11, 12, 13	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → ((𝐶 gcd 𝑃) ∥ 𝐶 ∧ (𝐶 gcd 𝑃) ∥ 𝑃))
15	14	simpld 494	. . . . . . . 8 ⊢ (𝜑 → (𝐶 gcd 𝑃) ∥ 𝐶)
16	11, 12	gcdcld 16437	. . . . . . . . . 10 ⊢ (𝜑 → (𝐶 gcd 𝑃) ∈ ℕ₀)
17	16	nn0zd 12515	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 gcd 𝑃) ∈ ℤ)
18		pockthg.4	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑁 = ((𝐴 · 𝐵) + 1))
19		pockthg.1	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐴 ∈ ℕ)
20		pockthg.2	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐵 ∈ ℕ)
21	19, 20	nnmulcld 12199	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℕ)
22		nnuz 12796	. . . . . . . . . . . . . . . 16 ⊢ ℕ = (ℤ_≥‘1)
23	21, 22	eleqtrdi 2838	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ (ℤ_≥‘1))
24		eluzp1p1 12781	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 · 𝐵) ∈ (ℤ_≥‘1) → ((𝐴 · 𝐵) + 1) ∈ (ℤ_≥‘(1 + 1)))
25	23, 24	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝐴 · 𝐵) + 1) ∈ (ℤ_≥‘(1 + 1)))
26	18, 25	eqeltrd 2828	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘(1 + 1)))
27		df-2 12209	. . . . . . . . . . . . . 14 ⊢ 2 = (1 + 1)
28	27	fveq2i 6829	. . . . . . . . . . . . 13 ⊢ (ℤ_≥‘2) = (ℤ_≥‘(1 + 1))
29	26, 28	eleqtrrdi 2839	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘2))
30		eluz2b2 12840	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ (ℤ_≥‘2) ↔ (𝑁 ∈ ℕ ∧ 1 < 𝑁))
31	29, 30	sylib 218	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁 ∈ ℕ ∧ 1 < 𝑁))
32	31	simpld 494	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ)
33	32	nnzd 12516	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℤ)
34	14	simprd 495	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 gcd 𝑃) ∥ 𝑃)
35		pockthlem.6	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ∥ 𝑁)
36	17, 12, 33, 34, 35	dvdstrd 16224	. . . . . . . 8 ⊢ (𝜑 → (𝐶 gcd 𝑃) ∥ 𝑁)
37	32	nnne0d 12196	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ≠ 0)
38		simpr 484	. . . . . . . . . . 11 ⊢ ((𝐶 = 0 ∧ 𝑁 = 0) → 𝑁 = 0)
39	38	necon3ai 2950	. . . . . . . . . 10 ⊢ (𝑁 ≠ 0 → ¬ (𝐶 = 0 ∧ 𝑁 = 0))
40	37, 39	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ¬ (𝐶 = 0 ∧ 𝑁 = 0))
41		dvdslegcd 16433	. . . . . . . . 9 ⊢ ((((𝐶 gcd 𝑃) ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ ¬ (𝐶 = 0 ∧ 𝑁 = 0)) → (((𝐶 gcd 𝑃) ∥ 𝐶 ∧ (𝐶 gcd 𝑃) ∥ 𝑁) → (𝐶 gcd 𝑃) ≤ (𝐶 gcd 𝑁)))
42	17, 11, 33, 40, 41	syl31anc 1375	. . . . . . . 8 ⊢ (𝜑 → (((𝐶 gcd 𝑃) ∥ 𝐶 ∧ (𝐶 gcd 𝑃) ∥ 𝑁) → (𝐶 gcd 𝑃) ≤ (𝐶 gcd 𝑁)))
43	15, 36, 42	mp2and 699	. . . . . . 7 ⊢ (𝜑 → (𝐶 gcd 𝑃) ≤ (𝐶 gcd 𝑁))
44		pockthlem.10	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐶↑(𝑁 − 1)) mod 𝑁) = 1)
45	44	oveq1d 7368	. . . . . . . . 9 ⊢ (𝜑 → (((𝐶↑(𝑁 − 1)) mod 𝑁) gcd 𝑁) = (1 gcd 𝑁))
46		1z 12523	. . . . . . . . . . . . . 14 ⊢ 1 ∈ ℤ
47		eluzp1m1 12779	. . . . . . . . . . . . . 14 ⊢ ((1 ∈ ℤ ∧ 𝑁 ∈ (ℤ_≥‘(1 + 1))) → (𝑁 − 1) ∈ (ℤ_≥‘1))
48	46, 26, 47	sylancr 587	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑁 − 1) ∈ (ℤ_≥‘1))
49	48, 22	eleqtrrdi 2839	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑁 − 1) ∈ ℕ)
50	49	nnnn0d 12463	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑁 − 1) ∈ ℕ₀)
51		zexpcl 14001	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ ℤ ∧ (𝑁 − 1) ∈ ℕ₀) → (𝐶↑(𝑁 − 1)) ∈ ℤ)
52	11, 50, 51	syl2anc 584	. . . . . . . . . 10 ⊢ (𝜑 → (𝐶↑(𝑁 − 1)) ∈ ℤ)
53		modgcd 16461	. . . . . . . . . 10 ⊢ (((𝐶↑(𝑁 − 1)) ∈ ℤ ∧ 𝑁 ∈ ℕ) → (((𝐶↑(𝑁 − 1)) mod 𝑁) gcd 𝑁) = ((𝐶↑(𝑁 − 1)) gcd 𝑁))
54	52, 32, 53	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (((𝐶↑(𝑁 − 1)) mod 𝑁) gcd 𝑁) = ((𝐶↑(𝑁 − 1)) gcd 𝑁))
55		gcdcom 16442	. . . . . . . . . . 11 ⊢ ((1 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (1 gcd 𝑁) = (𝑁 gcd 1))
56	46, 33, 55	sylancr 587	. . . . . . . . . 10 ⊢ (𝜑 → (1 gcd 𝑁) = (𝑁 gcd 1))
57		gcd1 16457	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℤ → (𝑁 gcd 1) = 1)
58	33, 57	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑁 gcd 1) = 1)
59	56, 58	eqtrd 2764	. . . . . . . . 9 ⊢ (𝜑 → (1 gcd 𝑁) = 1)
60	45, 54, 59	3eqtr3d 2772	. . . . . . . 8 ⊢ (𝜑 → ((𝐶↑(𝑁 − 1)) gcd 𝑁) = 1)
61		rpexp 16651	. . . . . . . . 9 ⊢ ((𝐶 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑁 − 1) ∈ ℕ) → (((𝐶↑(𝑁 − 1)) gcd 𝑁) = 1 ↔ (𝐶 gcd 𝑁) = 1))
62	11, 33, 49, 61	syl3anc 1373	. . . . . . . 8 ⊢ (𝜑 → (((𝐶↑(𝑁 − 1)) gcd 𝑁) = 1 ↔ (𝐶 gcd 𝑁) = 1))
63	60, 62	mpbid 232	. . . . . . 7 ⊢ (𝜑 → (𝐶 gcd 𝑁) = 1)
64	43, 63	breqtrd 5121	. . . . . 6 ⊢ (𝜑 → (𝐶 gcd 𝑃) ≤ 1)
65	10	nnne0d 12196	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ≠ 0)
66		simpr 484	. . . . . . . . . 10 ⊢ ((𝐶 = 0 ∧ 𝑃 = 0) → 𝑃 = 0)
67	66	necon3ai 2950	. . . . . . . . 9 ⊢ (𝑃 ≠ 0 → ¬ (𝐶 = 0 ∧ 𝑃 = 0))
68	65, 67	syl 17	. . . . . . . 8 ⊢ (𝜑 → ¬ (𝐶 = 0 ∧ 𝑃 = 0))
69		gcdn0cl 16431	. . . . . . . 8 ⊢ (((𝐶 ∈ ℤ ∧ 𝑃 ∈ ℤ) ∧ ¬ (𝐶 = 0 ∧ 𝑃 = 0)) → (𝐶 gcd 𝑃) ∈ ℕ)
70	11, 12, 68, 69	syl21anc 837	. . . . . . 7 ⊢ (𝜑 → (𝐶 gcd 𝑃) ∈ ℕ)
71		nnle1eq1 12176	. . . . . . 7 ⊢ ((𝐶 gcd 𝑃) ∈ ℕ → ((𝐶 gcd 𝑃) ≤ 1 ↔ (𝐶 gcd 𝑃) = 1))
72	70, 71	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝐶 gcd 𝑃) ≤ 1 ↔ (𝐶 gcd 𝑃) = 1))
73	64, 72	mpbid 232	. . . . 5 ⊢ (𝜑 → (𝐶 gcd 𝑃) = 1)
74		odzcl 16723	. . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ 𝐶 ∈ ℤ ∧ (𝐶 gcd 𝑃) = 1) → ((od_ℤ‘𝑃)‘𝐶) ∈ ℕ)
75	10, 11, 73, 74	syl3anc 1373	. . . 4 ⊢ (𝜑 → ((od_ℤ‘𝑃)‘𝐶) ∈ ℕ)
76	75	nnzd 12516	. . 3 ⊢ (𝜑 → ((od_ℤ‘𝑃)‘𝐶) ∈ ℤ)
77		prmuz2 16625	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ_≥‘2))
78	8, 77	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ (ℤ_≥‘2))
79	78, 28	eleqtrdi 2838	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ (ℤ_≥‘(1 + 1)))
80		eluzp1m1 12779	. . . . . 6 ⊢ ((1 ∈ ℤ ∧ 𝑃 ∈ (ℤ_≥‘(1 + 1))) → (𝑃 − 1) ∈ (ℤ_≥‘1))
81	46, 79, 80	sylancr 587	. . . . 5 ⊢ (𝜑 → (𝑃 − 1) ∈ (ℤ_≥‘1))
82	81, 22	eleqtrrdi 2839	. . . 4 ⊢ (𝜑 → (𝑃 − 1) ∈ ℕ)
83	82	nnzd 12516	. . 3 ⊢ (𝜑 → (𝑃 − 1) ∈ ℤ)
84	19	nnzd 12516	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℤ)
85	49	nnzd 12516	. . . . . 6 ⊢ (𝜑 → (𝑁 − 1) ∈ ℤ)
86		pcdvds 16794	. . . . . . 7 ⊢ ((𝑄 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑄↑(𝑄 pCnt 𝐴)) ∥ 𝐴)
87	1, 19, 86	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (𝑄↑(𝑄 pCnt 𝐴)) ∥ 𝐴)
88	20	nnzd 12516	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℤ)
89		dvdsmul1 16206	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐴 ∥ (𝐴 · 𝐵))
90	84, 88, 89	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∥ (𝐴 · 𝐵))
91	18	oveq1d 7368	. . . . . . . 8 ⊢ (𝜑 → (𝑁 − 1) = (((𝐴 · 𝐵) + 1) − 1))
92	21	nncnd 12162	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℂ)
93		ax-1cn 11086	. . . . . . . . 9 ⊢ 1 ∈ ℂ
94		pncan 11387	. . . . . . . . 9 ⊢ (((𝐴 · 𝐵) ∈ ℂ ∧ 1 ∈ ℂ) → (((𝐴 · 𝐵) + 1) − 1) = (𝐴 · 𝐵))
95	92, 93, 94	sylancl 586	. . . . . . . 8 ⊢ (𝜑 → (((𝐴 · 𝐵) + 1) − 1) = (𝐴 · 𝐵))
96	91, 95	eqtrd 2764	. . . . . . 7 ⊢ (𝜑 → (𝑁 − 1) = (𝐴 · 𝐵))
97	90, 96	breqtrrd 5123	. . . . . 6 ⊢ (𝜑 → 𝐴 ∥ (𝑁 − 1))
98	7, 84, 85, 87, 97	dvdstrd 16224	. . . . 5 ⊢ (𝜑 → (𝑄↑(𝑄 pCnt 𝐴)) ∥ (𝑁 − 1))
99	6	nnne0d 12196	. . . . . 6 ⊢ (𝜑 → (𝑄↑(𝑄 pCnt 𝐴)) ≠ 0)
100		dvdsval2 16184	. . . . . 6 ⊢ (((𝑄↑(𝑄 pCnt 𝐴)) ∈ ℤ ∧ (𝑄↑(𝑄 pCnt 𝐴)) ≠ 0 ∧ (𝑁 − 1) ∈ ℤ) → ((𝑄↑(𝑄 pCnt 𝐴)) ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) ∈ ℤ))
101	7, 99, 85, 100	syl3anc 1373	. . . . 5 ⊢ (𝜑 → ((𝑄↑(𝑄 pCnt 𝐴)) ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) ∈ ℤ))
102	98, 101	mpbid 232	. . . 4 ⊢ (𝜑 → ((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) ∈ ℤ)
103		peano2zm 12536	. . . . . . . 8 ⊢ ((𝐶↑(𝑁 − 1)) ∈ ℤ → ((𝐶↑(𝑁 − 1)) − 1) ∈ ℤ)
104	52, 103	syl 17	. . . . . . 7 ⊢ (𝜑 → ((𝐶↑(𝑁 − 1)) − 1) ∈ ℤ)
105	32	nnred 12161	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℝ)
106	31	simprd 495	. . . . . . . . . 10 ⊢ (𝜑 → 1 < 𝑁)
107		1mod 13825	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → (1 mod 𝑁) = 1)
108	105, 106, 107	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (1 mod 𝑁) = 1)
109	44, 108	eqtr4d 2767	. . . . . . . 8 ⊢ (𝜑 → ((𝐶↑(𝑁 − 1)) mod 𝑁) = (1 mod 𝑁))
110		1zzd 12524	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℤ)
111		moddvds 16192	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ (𝐶↑(𝑁 − 1)) ∈ ℤ ∧ 1 ∈ ℤ) → (((𝐶↑(𝑁 − 1)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐶↑(𝑁 − 1)) − 1)))
112	32, 52, 110, 111	syl3anc 1373	. . . . . . . 8 ⊢ (𝜑 → (((𝐶↑(𝑁 − 1)) mod 𝑁) = (1 mod 𝑁) ↔ 𝑁 ∥ ((𝐶↑(𝑁 − 1)) − 1)))
113	109, 112	mpbid 232	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∥ ((𝐶↑(𝑁 − 1)) − 1))
114	12, 33, 104, 35, 113	dvdstrd 16224	. . . . . 6 ⊢ (𝜑 → 𝑃 ∥ ((𝐶↑(𝑁 − 1)) − 1))
115		odzdvds 16725	. . . . . . 7 ⊢ (((𝑃 ∈ ℕ ∧ 𝐶 ∈ ℤ ∧ (𝐶 gcd 𝑃) = 1) ∧ (𝑁 − 1) ∈ ℕ₀) → (𝑃 ∥ ((𝐶↑(𝑁 − 1)) − 1) ↔ ((od_ℤ‘𝑃)‘𝐶) ∥ (𝑁 − 1)))
116	10, 11, 73, 50, 115	syl31anc 1375	. . . . . 6 ⊢ (𝜑 → (𝑃 ∥ ((𝐶↑(𝑁 − 1)) − 1) ↔ ((od_ℤ‘𝑃)‘𝐶) ∥ (𝑁 − 1)))
117	114, 116	mpbid 232	. . . . 5 ⊢ (𝜑 → ((od_ℤ‘𝑃)‘𝐶) ∥ (𝑁 − 1))
118	49	nncnd 12162	. . . . . 6 ⊢ (𝜑 → (𝑁 − 1) ∈ ℂ)
119	6	nncnd 12162	. . . . . 6 ⊢ (𝜑 → (𝑄↑(𝑄 pCnt 𝐴)) ∈ ℂ)
120	118, 119, 99	divcan1d 11919	. . . . 5 ⊢ (𝜑 → (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑(𝑄 pCnt 𝐴))) = (𝑁 − 1))
121	117, 120	breqtrrd 5123	. . . 4 ⊢ (𝜑 → ((od_ℤ‘𝑃)‘𝐶) ∥ (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑(𝑄 pCnt 𝐴))))
122		nprmdvds1 16635	. . . . . 6 ⊢ (𝑃 ∈ ℙ → ¬ 𝑃 ∥ 1)
123	8, 122	syl 17	. . . . 5 ⊢ (𝜑 → ¬ 𝑃 ∥ 1)
124	3	nnzd 12516	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑄 ∈ ℤ)
125		iddvdsexp 16208	. . . . . . . . . . . . . 14 ⊢ ((𝑄 ∈ ℤ ∧ (𝑄 pCnt 𝐴) ∈ ℕ) → 𝑄 ∥ (𝑄↑(𝑄 pCnt 𝐴)))
126	124, 4, 125	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑄 ∥ (𝑄↑(𝑄 pCnt 𝐴)))
127	124, 7, 85, 126, 98	dvdstrd 16224	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑄 ∥ (𝑁 − 1))
128	3	nnne0d 12196	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑄 ≠ 0)
129		dvdsval2 16184	. . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ ℤ ∧ 𝑄 ≠ 0 ∧ (𝑁 − 1) ∈ ℤ) → (𝑄 ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / 𝑄) ∈ ℤ))
130	124, 128, 85, 129	syl3anc 1373	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑄 ∥ (𝑁 − 1) ↔ ((𝑁 − 1) / 𝑄) ∈ ℤ))
131	127, 130	mpbid 232	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑁 − 1) / 𝑄) ∈ ℤ)
132	50	nn0ge0d 12466	. . . . . . . . . . . 12 ⊢ (𝜑 → 0 ≤ (𝑁 − 1))
133	49	nnred 12161	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑁 − 1) ∈ ℝ)
134	3	nnred 12161	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑄 ∈ ℝ)
135	3	nngt0d 12195	. . . . . . . . . . . . 13 ⊢ (𝜑 → 0 < 𝑄)
136		ge0div 12010	. . . . . . . . . . . . 13 ⊢ (((𝑁 − 1) ∈ ℝ ∧ 𝑄 ∈ ℝ ∧ 0 < 𝑄) → (0 ≤ (𝑁 − 1) ↔ 0 ≤ ((𝑁 − 1) / 𝑄)))
137	133, 134, 135, 136	syl3anc 1373	. . . . . . . . . . . 12 ⊢ (𝜑 → (0 ≤ (𝑁 − 1) ↔ 0 ≤ ((𝑁 − 1) / 𝑄)))
138	132, 137	mpbid 232	. . . . . . . . . . 11 ⊢ (𝜑 → 0 ≤ ((𝑁 − 1) / 𝑄))
139		elnn0z 12502	. . . . . . . . . . 11 ⊢ (((𝑁 − 1) / 𝑄) ∈ ℕ₀ ↔ (((𝑁 − 1) / 𝑄) ∈ ℤ ∧ 0 ≤ ((𝑁 − 1) / 𝑄)))
140	131, 138, 139	sylanbrc 583	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑁 − 1) / 𝑄) ∈ ℕ₀)
141		zexpcl 14001	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℤ ∧ ((𝑁 − 1) / 𝑄) ∈ ℕ₀) → (𝐶↑((𝑁 − 1) / 𝑄)) ∈ ℤ)
142	11, 140, 141	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (𝐶↑((𝑁 − 1) / 𝑄)) ∈ ℤ)
143		peano2zm 12536	. . . . . . . . 9 ⊢ ((𝐶↑((𝑁 − 1) / 𝑄)) ∈ ℤ → ((𝐶↑((𝑁 − 1) / 𝑄)) − 1) ∈ ℤ)
144	142, 143	syl 17	. . . . . . . 8 ⊢ (𝜑 → ((𝐶↑((𝑁 − 1) / 𝑄)) − 1) ∈ ℤ)
145		dvdsgcd 16473	. . . . . . . 8 ⊢ ((𝑃 ∈ ℤ ∧ ((𝐶↑((𝑁 − 1) / 𝑄)) − 1) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ ((𝐶↑((𝑁 − 1) / 𝑄)) − 1) ∧ 𝑃 ∥ 𝑁) → 𝑃 ∥ (((𝐶↑((𝑁 − 1) / 𝑄)) − 1) gcd 𝑁)))
146	12, 144, 33, 145	syl3anc 1373	. . . . . . 7 ⊢ (𝜑 → ((𝑃 ∥ ((𝐶↑((𝑁 − 1) / 𝑄)) − 1) ∧ 𝑃 ∥ 𝑁) → 𝑃 ∥ (((𝐶↑((𝑁 − 1) / 𝑄)) − 1) gcd 𝑁)))
147	35, 146	mpan2d 694	. . . . . 6 ⊢ (𝜑 → (𝑃 ∥ ((𝐶↑((𝑁 − 1) / 𝑄)) − 1) → 𝑃 ∥ (((𝐶↑((𝑁 − 1) / 𝑄)) − 1) gcd 𝑁)))
148		odzdvds 16725	. . . . . . . 8 ⊢ (((𝑃 ∈ ℕ ∧ 𝐶 ∈ ℤ ∧ (𝐶 gcd 𝑃) = 1) ∧ ((𝑁 − 1) / 𝑄) ∈ ℕ₀) → (𝑃 ∥ ((𝐶↑((𝑁 − 1) / 𝑄)) − 1) ↔ ((od_ℤ‘𝑃)‘𝐶) ∥ ((𝑁 − 1) / 𝑄)))
149	10, 11, 73, 140, 148	syl31anc 1375	. . . . . . 7 ⊢ (𝜑 → (𝑃 ∥ ((𝐶↑((𝑁 − 1) / 𝑄)) − 1) ↔ ((od_ℤ‘𝑃)‘𝐶) ∥ ((𝑁 − 1) / 𝑄)))
150	3	nncnd 12162	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑄 ∈ ℂ)
151	4	nnzd 12516	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑄 pCnt 𝐴) ∈ ℤ)
152	150, 128, 151	expm1d 14081	. . . . . . . . . 10 ⊢ (𝜑 → (𝑄↑((𝑄 pCnt 𝐴) − 1)) = ((𝑄↑(𝑄 pCnt 𝐴)) / 𝑄))
153	152	oveq2d 7369	. . . . . . . . 9 ⊢ (𝜑 → (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑((𝑄 pCnt 𝐴) − 1))) = (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · ((𝑄↑(𝑄 pCnt 𝐴)) / 𝑄)))
154	133, 6	nndivred 12200	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) ∈ ℝ)
155	154	recnd 11162	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) ∈ ℂ)
156	155, 119, 150, 128	divassd 11953	. . . . . . . . 9 ⊢ (𝜑 → ((((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑(𝑄 pCnt 𝐴))) / 𝑄) = (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · ((𝑄↑(𝑄 pCnt 𝐴)) / 𝑄)))
157	120	oveq1d 7368	. . . . . . . . 9 ⊢ (𝜑 → ((((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑(𝑄 pCnt 𝐴))) / 𝑄) = ((𝑁 − 1) / 𝑄))
158	153, 156, 157	3eqtr2d 2770	. . . . . . . 8 ⊢ (𝜑 → (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑((𝑄 pCnt 𝐴) − 1))) = ((𝑁 − 1) / 𝑄))
159	158	breq2d 5107	. . . . . . 7 ⊢ (𝜑 → (((od_ℤ‘𝑃)‘𝐶) ∥ (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑((𝑄 pCnt 𝐴) − 1))) ↔ ((od_ℤ‘𝑃)‘𝐶) ∥ ((𝑁 − 1) / 𝑄)))
160	149, 159	bitr4d 282	. . . . . 6 ⊢ (𝜑 → (𝑃 ∥ ((𝐶↑((𝑁 − 1) / 𝑄)) − 1) ↔ ((od_ℤ‘𝑃)‘𝐶) ∥ (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑((𝑄 pCnt 𝐴) − 1)))))
161		pockthlem.11	. . . . . . 7 ⊢ (𝜑 → (((𝐶↑((𝑁 − 1) / 𝑄)) − 1) gcd 𝑁) = 1)
162	161	breq2d 5107	. . . . . 6 ⊢ (𝜑 → (𝑃 ∥ (((𝐶↑((𝑁 − 1) / 𝑄)) − 1) gcd 𝑁) ↔ 𝑃 ∥ 1))
163	147, 160, 162	3imtr3d 293	. . . . 5 ⊢ (𝜑 → (((od_ℤ‘𝑃)‘𝐶) ∥ (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑((𝑄 pCnt 𝐴) − 1))) → 𝑃 ∥ 1))
164	123, 163	mtod 198	. . . 4 ⊢ (𝜑 → ¬ ((od_ℤ‘𝑃)‘𝐶) ∥ (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑((𝑄 pCnt 𝐴) − 1))))
165		prmpwdvds 16834	. . . 4 ⊢ (((((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) ∈ ℤ ∧ ((od_ℤ‘𝑃)‘𝐶) ∈ ℤ) ∧ (𝑄 ∈ ℙ ∧ (𝑄 pCnt 𝐴) ∈ ℕ) ∧ (((od_ℤ‘𝑃)‘𝐶) ∥ (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑(𝑄 pCnt 𝐴))) ∧ ¬ ((od_ℤ‘𝑃)‘𝐶) ∥ (((𝑁 − 1) / (𝑄↑(𝑄 pCnt 𝐴))) · (𝑄↑((𝑄 pCnt 𝐴) − 1))))) → (𝑄↑(𝑄 pCnt 𝐴)) ∥ ((od_ℤ‘𝑃)‘𝐶))
166	102, 76, 1, 4, 121, 164, 165	syl222anc 1388	. . 3 ⊢ (𝜑 → (𝑄↑(𝑄 pCnt 𝐴)) ∥ ((od_ℤ‘𝑃)‘𝐶))
167		odzphi 16726	. . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ 𝐶 ∈ ℤ ∧ (𝐶 gcd 𝑃) = 1) → ((od_ℤ‘𝑃)‘𝐶) ∥ (ϕ‘𝑃))
168	10, 11, 73, 167	syl3anc 1373	. . . 4 ⊢ (𝜑 → ((od_ℤ‘𝑃)‘𝐶) ∥ (ϕ‘𝑃))
169		phiprm 16706	. . . . 5 ⊢ (𝑃 ∈ ℙ → (ϕ‘𝑃) = (𝑃 − 1))
170	8, 169	syl 17	. . . 4 ⊢ (𝜑 → (ϕ‘𝑃) = (𝑃 − 1))
171	168, 170	breqtrd 5121	. . 3 ⊢ (𝜑 → ((od_ℤ‘𝑃)‘𝐶) ∥ (𝑃 − 1))
172	7, 76, 83, 166, 171	dvdstrd 16224	. 2 ⊢ (𝜑 → (𝑄↑(𝑄 pCnt 𝐴)) ∥ (𝑃 − 1))
173		pcdvdsb 16799	. . 3 ⊢ ((𝑄 ∈ ℙ ∧ (𝑃 − 1) ∈ ℤ ∧ (𝑄 pCnt 𝐴) ∈ ℕ₀) → ((𝑄 pCnt 𝐴) ≤ (𝑄 pCnt (𝑃 − 1)) ↔ (𝑄↑(𝑄 pCnt 𝐴)) ∥ (𝑃 − 1)))
174	1, 83, 5, 173	syl3anc 1373	. 2 ⊢ (𝜑 → ((𝑄 pCnt 𝐴) ≤ (𝑄 pCnt (𝑃 − 1)) ↔ (𝑄↑(𝑄 pCnt 𝐴)) ∥ (𝑃 − 1)))
175	172, 174	mpbird 257	1 ⊢ (𝜑 → (𝑄 pCnt 𝐴) ≤ (𝑄 pCnt (𝑃 − 1)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 class class class wbr 5095 ‘cfv 6486 (class class class)co 7353 ℂcc 11026 ℝcr 11027 0cc0 11028 1c1 11029 + caddc 11031 · cmul 11033 < clt 11168 ≤ cle 11169 − cmin 11365 / cdiv 11795 ℕcn 12146 2c2 12201 ℕ₀cn0 12402 ℤcz 12489 ℤ_≥cuz 12753 mod cmo 13791 ↑cexp 13986 ∥ cdvds 16181 gcd cgcd 16423 ℙcprime 16600 od_ℤcodz 16692 ϕcphi 16693 pCnt cpc 16766

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 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 ax-pre-sup 11106

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-int 4900 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 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 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-oadd 8399 df-er 8632 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-sup 9351 df-inf 9352 df-dju 9816 df-card 9854 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-div 11796 df-nn 12147 df-2 12209 df-3 12210 df-n0 12403 df-xnn0 12476 df-z 12490 df-uz 12754 df-q 12868 df-rp 12912 df-fz 13429 df-fzo 13576 df-fl 13714 df-mod 13792 df-seq 13927 df-exp 13987 df-hash 14256 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-dvds 16182 df-gcd 16424 df-prm 16601 df-odz 16694 df-phi 16695 df-pc 16767

This theorem is referenced by: pockthg 16836

W3C validator