gausslemma2dlem4 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > gausslemma2dlem4		GIF version

Theorem gausslemma2dlem4 16195

Description: Lemma 4 for gausslemma2d 16200. (Contributed by AV, 16-Jun-2021.)

**Hypotheses**
Ref	Expression
gausslemma2d.p	⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2}))
gausslemma2d.h	⊢ 𝐻 = ((𝑃 − 1) / 2)
gausslemma2d.r	⊢ 𝑅 = (𝑥 ∈ (1...𝐻) ↦ if((𝑥 · 2) < (𝑃 / 2), (𝑥 · 2), (𝑃 − (𝑥 · 2))))
gausslemma2d.m	⊢ 𝑀 = (⌊‘(𝑃 / 4))

**Assertion**
Ref	Expression
gausslemma2dlem4	⊢ (𝜑 → (!‘𝐻) = (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘)))

Distinct variable groups: 𝑥,𝐻 𝑥,𝑃 𝜑,𝑥 𝑘,𝐻 𝑅,𝑘 𝜑,𝑘 𝑥,𝑀,𝑘 𝑃,𝑘 Allowed substitution hint: 𝑅(𝑥)

**Proof of Theorem gausslemma2dlem4**
Step	Hyp	Ref	Expression
1		gausslemma2d.p	. . 3 ⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2}))
2		gausslemma2d.h	. . 3 ⊢ 𝐻 = ((𝑃 − 1) / 2)
3		gausslemma2d.r	. . 3 ⊢ 𝑅 = (𝑥 ∈ (1...𝐻) ↦ if((𝑥 · 2) < (𝑃 / 2), (𝑥 · 2), (𝑃 − (𝑥 · 2))))
4	1, 2, 3	gausslemma2dlem1 16192	. 2 ⊢ (𝜑 → (!‘𝐻) = ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘))
5		gausslemma2d.m	. . . . . 6 ⊢ 𝑀 = (⌊‘(𝑃 / 4))
6		3lt4 9479	. . . . . . . 8 ⊢ 3 < 4
7		breq1 4133	. . . . . . . 8 ⊢ (𝑃 = 3 → (𝑃 < 4 ↔ 3 < 4))
8	6, 7	mpbiri 168	. . . . . . 7 ⊢ (𝑃 = 3 → 𝑃 < 4)
9		3nn0 9583	. . . . . . . . 9 ⊢ 3 ∈ ℕ₀
10		eleq1 2301	. . . . . . . . 9 ⊢ (𝑃 = 3 → (𝑃 ∈ ℕ₀ ↔ 3 ∈ ℕ₀))
11	9, 10	mpbiri 168	. . . . . . . 8 ⊢ (𝑃 = 3 → 𝑃 ∈ ℕ₀)
12		4nn 9470	. . . . . . . 8 ⊢ 4 ∈ ℕ
13		divfl0 10733	. . . . . . . 8 ⊢ ((𝑃 ∈ ℕ₀ ∧ 4 ∈ ℕ) → (𝑃 < 4 ↔ (⌊‘(𝑃 / 4)) = 0))
14	11, 12, 13	sylancl 417	. . . . . . 7 ⊢ (𝑃 = 3 → (𝑃 < 4 ↔ (⌊‘(𝑃 / 4)) = 0))
15	8, 14	mpbid 147	. . . . . 6 ⊢ (𝑃 = 3 → (⌊‘(𝑃 / 4)) = 0)
16	5, 15	eqtrid 2283	. . . . 5 ⊢ (𝑃 = 3 → 𝑀 = 0)
17		oveq2 6093	. . . . . . . . . . . 12 ⊢ (𝑀 = 0 → (1...𝑀) = (1...0))
18	17	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑀 = 0 ∧ 𝜑) → (1...𝑀) = (1...0))
19		fz10 10452	. . . . . . . . . . 11 ⊢ (1...0) = ∅
20	18, 19	eqtrdi 2287	. . . . . . . . . 10 ⊢ ((𝑀 = 0 ∧ 𝜑) → (1...𝑀) = ∅)
21	20	prodeq1d 12333	. . . . . . . . 9 ⊢ ((𝑀 = 0 ∧ 𝜑) → ∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) = ∏𝑘 ∈ ∅ (𝑅‘𝑘))
22		prod0 12354	. . . . . . . . 9 ⊢ ∏𝑘 ∈ ∅ (𝑅‘𝑘) = 1
23	21, 22	eqtrdi 2287	. . . . . . . 8 ⊢ ((𝑀 = 0 ∧ 𝜑) → ∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) = 1)
24		oveq1 6092	. . . . . . . . . . . 12 ⊢ (𝑀 = 0 → (𝑀 + 1) = (0 + 1))
25	24	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑀 = 0 ∧ 𝜑) → (𝑀 + 1) = (0 + 1))
26		0p1e1 9419	. . . . . . . . . . 11 ⊢ (0 + 1) = 1
27	25, 26	eqtrdi 2287	. . . . . . . . . 10 ⊢ ((𝑀 = 0 ∧ 𝜑) → (𝑀 + 1) = 1)
28	27	oveq1d 6100	. . . . . . . . 9 ⊢ ((𝑀 = 0 ∧ 𝜑) → ((𝑀 + 1)...𝐻) = (1...𝐻))
29	28	prodeq1d 12333	. . . . . . . 8 ⊢ ((𝑀 = 0 ∧ 𝜑) → ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘) = ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘))
30	23, 29	oveq12d 6103	. . . . . . 7 ⊢ ((𝑀 = 0 ∧ 𝜑) → (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘)) = (1 · ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘)))
31		1zzd 9673	. . . . . . . . . . 11 ⊢ (𝜑 → 1 ∈ ℤ)
32	1, 2	gausslemma2dlem0b 16181	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐻 ∈ ℕ)
33	32	nnzd 9769	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐻 ∈ ℤ)
34	31, 33	fzfigd 10870	. . . . . . . . . 10 ⊢ (𝜑 → (1...𝐻) ∈ Fin)
35	34	adantl 277	. . . . . . . . 9 ⊢ ((𝑀 = 0 ∧ 𝜑) → (1...𝐻) ∈ Fin)
36		oveq1 6092	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑘 → (𝑥 · 2) = (𝑘 · 2))
37	36	breq1d 4140	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑘 → ((𝑥 · 2) < (𝑃 / 2) ↔ (𝑘 · 2) < (𝑃 / 2)))
38	36	oveq2d 6101	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑘 → (𝑃 − (𝑥 · 2)) = (𝑃 − (𝑘 · 2)))
39	37, 36, 38	ifbieq12d 3667	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑘 → if((𝑥 · 2) < (𝑃 / 2), (𝑥 · 2), (𝑃 − (𝑥 · 2))) = if((𝑘 · 2) < (𝑃 / 2), (𝑘 · 2), (𝑃 − (𝑘 · 2))))
40		simpr 110	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → 𝑘 ∈ (1...𝐻))
41	40	elfzelzd 10431	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → 𝑘 ∈ ℤ)
42		2z 9674	. . . . . . . . . . . . . . . 16 ⊢ 2 ∈ ℤ
43	42	a1i 9	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → 2 ∈ ℤ)
44	41, 43	zmulcld 9776	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → (𝑘 · 2) ∈ ℤ)
45	1	eldifad 3231	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑃 ∈ ℙ)
46		prmz 12891	. . . . . . . . . . . . . . . . 17 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
47	45, 46	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑃 ∈ ℤ)
48	47	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → 𝑃 ∈ ℤ)
49	48, 44	zsubcld 9775	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → (𝑃 − (𝑘 · 2)) ∈ ℤ)
50		zq 10028	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 · 2) ∈ ℤ → (𝑘 · 2) ∈ ℚ)
51	44, 50	syl 14	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → (𝑘 · 2) ∈ ℚ)
52		2nn 9468	. . . . . . . . . . . . . . . . 17 ⊢ 2 ∈ ℕ
53		znq 10026	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑃 ∈ ℤ ∧ 2 ∈ ℕ) → (𝑃 / 2) ∈ ℚ)
54	47, 52, 53	sylancl 417	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑃 / 2) ∈ ℚ)
55	54	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → (𝑃 / 2) ∈ ℚ)
56		qdclt 10682	. . . . . . . . . . . . . . 15 ⊢ (((𝑘 · 2) ∈ ℚ ∧ (𝑃 / 2) ∈ ℚ) → DECID (𝑘 · 2) < (𝑃 / 2))
57	51, 55, 56	syl2anc 415	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → DECID (𝑘 · 2) < (𝑃 / 2))
58	44, 49, 57	ifcldcd 3678	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → if((𝑘 · 2) < (𝑃 / 2), (𝑘 · 2), (𝑃 − (𝑘 · 2))) ∈ ℤ)
59	3, 39, 40, 58	fvmptd3 5799	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → (𝑅‘𝑘) = if((𝑘 · 2) < (𝑃 / 2), (𝑘 · 2), (𝑃 − (𝑘 · 2))))
60	59, 58	eqeltrd 2315	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → (𝑅‘𝑘) ∈ ℤ)
61	60	zcnd 9771	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝐻)) → (𝑅‘𝑘) ∈ ℂ)
62	61	adantll 480	. . . . . . . . 9 ⊢ (((𝑀 = 0 ∧ 𝜑) ∧ 𝑘 ∈ (1...𝐻)) → (𝑅‘𝑘) ∈ ℂ)
63	35, 62	fprodcl 12376	. . . . . . . 8 ⊢ ((𝑀 = 0 ∧ 𝜑) → ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘) ∈ ℂ)
64	63	mullidd 8344	. . . . . . 7 ⊢ ((𝑀 = 0 ∧ 𝜑) → (1 · ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘)) = ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘))
65	30, 64	eqtr2d 2272	. . . . . 6 ⊢ ((𝑀 = 0 ∧ 𝜑) → ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘) = (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘)))
66	65	ex 115	. . . . 5 ⊢ (𝑀 = 0 → (𝜑 → ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘) = (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘))))
67	16, 66	syl 14	. . . 4 ⊢ (𝑃 = 3 → (𝜑 → ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘) = (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘))))
68	67	impcom 125	. . 3 ⊢ ((𝜑 ∧ 𝑃 = 3) → ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘) = (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘)))
69	1, 5	gausslemma2dlem0d 16183	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
70	69	nn0red 9623	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℝ)
71	70	ltp1d 9261	. . . . . . 7 ⊢ (𝜑 → 𝑀 < (𝑀 + 1))
72		fzdisj 10459	. . . . . . 7 ⊢ (𝑀 < (𝑀 + 1) → ((1...𝑀) ∩ ((𝑀 + 1)...𝐻)) = ∅)
73	71, 72	syl 14	. . . . . 6 ⊢ (𝜑 → ((1...𝑀) ∩ ((𝑀 + 1)...𝐻)) = ∅)
74	73	adantl 277	. . . . 5 ⊢ ((𝑃 ∈ (ℤ_≥‘5) ∧ 𝜑) → ((1...𝑀) ∩ ((𝑀 + 1)...𝐻)) = ∅)
75		eluzelz 9933	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ (ℤ_≥‘5) → 𝑃 ∈ ℤ)
76		znq 10026	. . . . . . . . . . . . . . 15 ⊢ ((𝑃 ∈ ℤ ∧ 4 ∈ ℕ) → (𝑃 / 4) ∈ ℚ)
77	75, 12, 76	sylancl 417	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℤ_≥‘5) → (𝑃 / 4) ∈ ℚ)
78	77	flqcld 10714	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ (ℤ_≥‘5) → (⌊‘(𝑃 / 4)) ∈ ℤ)
79		nnrp 10066	. . . . . . . . . . . . . . . 16 ⊢ (4 ∈ ℕ → 4 ∈ ℝ⁺)
80	12, 79	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ 4 ∈ ℝ⁺
81		eluzelre 9934	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ (ℤ_≥‘5) → 𝑃 ∈ ℝ)
82		eluz2 9929	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ (ℤ_≥‘5) ↔ (5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃))
83		4lt5 9482	. . . . . . . . . . . . . . . . . 18 ⊢ 4 < 5
84		4re 9382	. . . . . . . . . . . . . . . . . . 19 ⊢ 4 ∈ ℝ
85		5re 9384	. . . . . . . . . . . . . . . . . . . 20 ⊢ 5 ∈ ℝ
86	85	a1i 9	. . . . . . . . . . . . . . . . . . 19 ⊢ ((5 ∈ ℤ ∧ 𝑃 ∈ ℤ) → 5 ∈ ℝ)
87		zre 9650	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑃 ∈ ℤ → 𝑃 ∈ ℝ)
88	87	adantl 277	. . . . . . . . . . . . . . . . . . 19 ⊢ ((5 ∈ ℤ ∧ 𝑃 ∈ ℤ) → 𝑃 ∈ ℝ)
89		ltleletr 8407	. . . . . . . . . . . . . . . . . . 19 ⊢ ((4 ∈ ℝ ∧ 5 ∈ ℝ ∧ 𝑃 ∈ ℝ) → ((4 < 5 ∧ 5 ≤ 𝑃) → 4 ≤ 𝑃))
90	84, 86, 88, 89	mp3an2i 1383	. . . . . . . . . . . . . . . . . 18 ⊢ ((5 ∈ ℤ ∧ 𝑃 ∈ ℤ) → ((4 < 5 ∧ 5 ≤ 𝑃) → 4 ≤ 𝑃))
91	83, 90	mpani 434	. . . . . . . . . . . . . . . . 17 ⊢ ((5 ∈ ℤ ∧ 𝑃 ∈ ℤ) → (5 ≤ 𝑃 → 4 ≤ 𝑃))
92	91	3impia 1231	. . . . . . . . . . . . . . . 16 ⊢ ((5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃) → 4 ≤ 𝑃)
93	82, 92	sylbi 121	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ (ℤ_≥‘5) → 4 ≤ 𝑃)
94		divge1 10126	. . . . . . . . . . . . . . 15 ⊢ ((4 ∈ ℝ⁺ ∧ 𝑃 ∈ ℝ ∧ 4 ≤ 𝑃) → 1 ≤ (𝑃 / 4))
95	80, 81, 93, 94	mp3an2i 1383	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℤ_≥‘5) → 1 ≤ (𝑃 / 4))
96		1zzd 9673	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ (ℤ_≥‘5) → 1 ∈ ℤ)
97		flqge 10719	. . . . . . . . . . . . . . 15 ⊢ (((𝑃 / 4) ∈ ℚ ∧ 1 ∈ ℤ) → (1 ≤ (𝑃 / 4) ↔ 1 ≤ (⌊‘(𝑃 / 4))))
98	77, 96, 97	syl2anc 415	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℤ_≥‘5) → (1 ≤ (𝑃 / 4) ↔ 1 ≤ (⌊‘(𝑃 / 4))))
99	95, 98	mpbid 147	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ (ℤ_≥‘5) → 1 ≤ (⌊‘(𝑃 / 4)))
100		elnnz1 9669	. . . . . . . . . . . . 13 ⊢ ((⌊‘(𝑃 / 4)) ∈ ℕ ↔ ((⌊‘(𝑃 / 4)) ∈ ℤ ∧ 1 ≤ (⌊‘(𝑃 / 4))))
101	78, 99, 100	sylanbrc 421	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ (ℤ_≥‘5) → (⌊‘(𝑃 / 4)) ∈ ℕ)
102	101	adantl 277	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℙ ∖ {2}) ∧ 𝑃 ∈ (ℤ_≥‘5)) → (⌊‘(𝑃 / 4)) ∈ ℕ)
103		oddprm 13040	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → ((𝑃 − 1) / 2) ∈ ℕ)
104	103	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℙ ∖ {2}) ∧ 𝑃 ∈ (ℤ_≥‘5)) → ((𝑃 − 1) / 2) ∈ ℕ)
105		eldifi 3351	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ)
106		prmuz2 12911	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ_≥‘2))
107	105, 106	syl 14	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ (ℤ_≥‘2))
108	107	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℙ ∖ {2}) ∧ 𝑃 ∈ (ℤ_≥‘5)) → 𝑃 ∈ (ℤ_≥‘2))
109		fldiv4lem1div2uz2 10743	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ (ℤ_≥‘2) → (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2))
110	108, 109	syl 14	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℙ ∖ {2}) ∧ 𝑃 ∈ (ℤ_≥‘5)) → (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2))
111	102, 104, 110	3jca 1208	. . . . . . . . . 10 ⊢ ((𝑃 ∈ (ℙ ∖ {2}) ∧ 𝑃 ∈ (ℤ_≥‘5)) → ((⌊‘(𝑃 / 4)) ∈ ℕ ∧ ((𝑃 − 1) / 2) ∈ ℕ ∧ (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2)))
112	111	ex 115	. . . . . . . . 9 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → (𝑃 ∈ (ℤ_≥‘5) → ((⌊‘(𝑃 / 4)) ∈ ℕ ∧ ((𝑃 − 1) / 2) ∈ ℕ ∧ (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2))))
113	1, 112	syl 14	. . . . . . . 8 ⊢ (𝜑 → (𝑃 ∈ (ℤ_≥‘5) → ((⌊‘(𝑃 / 4)) ∈ ℕ ∧ ((𝑃 − 1) / 2) ∈ ℕ ∧ (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2))))
114	113	impcom 125	. . . . . . 7 ⊢ ((𝑃 ∈ (ℤ_≥‘5) ∧ 𝜑) → ((⌊‘(𝑃 / 4)) ∈ ℕ ∧ ((𝑃 − 1) / 2) ∈ ℕ ∧ (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2)))
115	2	oveq2i 6096	. . . . . . . . 9 ⊢ (1...𝐻) = (1...((𝑃 − 1) / 2))
116	5, 115	eleq12i 2306	. . . . . . . 8 ⊢ (𝑀 ∈ (1...𝐻) ↔ (⌊‘(𝑃 / 4)) ∈ (1...((𝑃 − 1) / 2)))
117		elfz1b 10499	. . . . . . . 8 ⊢ ((⌊‘(𝑃 / 4)) ∈ (1...((𝑃 − 1) / 2)) ↔ ((⌊‘(𝑃 / 4)) ∈ ℕ ∧ ((𝑃 − 1) / 2) ∈ ℕ ∧ (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2)))
118	116, 117	bitri 184	. . . . . . 7 ⊢ (𝑀 ∈ (1...𝐻) ↔ ((⌊‘(𝑃 / 4)) ∈ ℕ ∧ ((𝑃 − 1) / 2) ∈ ℕ ∧ (⌊‘(𝑃 / 4)) ≤ ((𝑃 − 1) / 2)))
119	114, 118	sylibr 134	. . . . . 6 ⊢ ((𝑃 ∈ (ℤ_≥‘5) ∧ 𝜑) → 𝑀 ∈ (1...𝐻))
120		fzsplit 10458	. . . . . 6 ⊢ (𝑀 ∈ (1...𝐻) → (1...𝐻) = ((1...𝑀) ∪ ((𝑀 + 1)...𝐻)))
121	119, 120	syl 14	. . . . 5 ⊢ ((𝑃 ∈ (ℤ_≥‘5) ∧ 𝜑) → (1...𝐻) = ((1...𝑀) ∪ ((𝑀 + 1)...𝐻)))
122	34	adantl 277	. . . . 5 ⊢ ((𝑃 ∈ (ℤ_≥‘5) ∧ 𝜑) → (1...𝐻) ∈ Fin)
123	61	adantll 480	. . . . 5 ⊢ (((𝑃 ∈ (ℤ_≥‘5) ∧ 𝜑) ∧ 𝑘 ∈ (1...𝐻)) → (𝑅‘𝑘) ∈ ℂ)
124	74, 121, 122, 123	fprodsplit 12366	. . . 4 ⊢ ((𝑃 ∈ (ℤ_≥‘5) ∧ 𝜑) → ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘) = (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘)))
125	124	ancoms 268	. . 3 ⊢ ((𝜑 ∧ 𝑃 ∈ (ℤ_≥‘5)) → ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘) = (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘)))
126		2re 9375	. . . . . . 7 ⊢ 2 ∈ ℝ
127	126	a1i 9	. . . . . 6 ⊢ (𝜑 → 2 ∈ ℝ)
128		oddprmgt2 12914	. . . . . . 7 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 2 < 𝑃)
129	1, 128	syl 14	. . . . . 6 ⊢ (𝜑 → 2 < 𝑃)
130	127, 129	gtned 8438	. . . . 5 ⊢ (𝜑 → 𝑃 ≠ 2)
131	130	neneqd 2441	. . . 4 ⊢ (𝜑 → ¬ 𝑃 = 2)
132		prm23ge5 13045	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ_≥‘5)))
133	45, 132	syl 14	. . . . . 6 ⊢ (𝜑 → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ_≥‘5)))
134		3orass 1012	. . . . . 6 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ_≥‘5)) ↔ (𝑃 = 2 ∨ (𝑃 = 3 ∨ 𝑃 ∈ (ℤ_≥‘5))))
135	133, 134	sylib 122	. . . . 5 ⊢ (𝜑 → (𝑃 = 2 ∨ (𝑃 = 3 ∨ 𝑃 ∈ (ℤ_≥‘5))))
136	135	ord 736	. . . 4 ⊢ (𝜑 → (¬ 𝑃 = 2 → (𝑃 = 3 ∨ 𝑃 ∈ (ℤ_≥‘5))))
137	131, 136	mpd 13	. . 3 ⊢ (𝜑 → (𝑃 = 3 ∨ 𝑃 ∈ (ℤ_≥‘5)))
138	68, 125, 137	mpjaodan 810	. 2 ⊢ (𝜑 → ∏𝑘 ∈ (1...𝐻)(𝑅‘𝑘) = (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘)))
139	4, 138	eqtrd 2271	1 ⊢ (𝜑 → (!‘𝐻) = (∏𝑘 ∈ (1...𝑀)(𝑅‘𝑘) · ∏𝑘 ∈ ((𝑀 + 1)...𝐻)(𝑅‘𝑘)))

Colors of variables: wff set class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 720 DECID wdc 846 ∨ w3o 1008 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ∖ cdif 3217 ∪ cun 3218 ∩ cin 3219 ∅c0 3520 ifcif 3638 {csn 3709 class class class wbr 4130 ↦ cmpt 4192 ‘cfv 5377 (class class class)co 6085 Fincfn 7022 ℂcc 8177 ℝcr 8178 0cc0 8179 1c1 8180 + caddc 8182 · cmul 8184 < clt 8360 ≤ cle 8361 − cmin 8497 / cdiv 9003 ℕcn 9305 2c2 9356 3c3 9357 4c4 9358 5c5 9359 ℕ₀cn0 9565 ℤcz 9646 ℤ_≥cuz 9923 ℚcq 10021 ℝ⁺crp 10056 ...cfz 10413 ⌊cfl 10705 !cfa 11165 ∏cprod 12319 ℙcprime 12887

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 ax-arch 8298 ax-caucvg 8299

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-xor 1425 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-tp 3717 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-isom 5386 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-frec 6662 df-1o 6687 df-2o 6688 df-oadd 6691 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8904 df-ap 8911 df-div 9004 df-inn 9306 df-2 9364 df-3 9365 df-4 9366 df-5 9367 df-n0 9566 df-z 9647 df-uz 9924 df-q 10022 df-rp 10057 df-ioo 10296 df-fz 10414 df-fzo 10552 df-fl 10707 df-mod 10762 df-seqfrec 10887 df-exp 10978 df-fac 11166 df-ihash 11217 df-cj 11609 df-re 11610 df-im 11611 df-rsqrt 11766 df-abs 11767 df-clim 12047 df-proddc 12320 df-dvds 12557 df-prm 12888

This theorem is used by: gausslemma2dlem6 16198

W3C validator