lgseisen - Metamath Proof Explorer

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

Theorem lgseisen 27363

Description: Eisenstein's lemma, an expression for (𝑃 /_L 𝑄) when 𝑃, 𝑄 are distinct odd primes. (Contributed by Mario Carneiro, 18-Jun-2015.)

**Hypotheses**
Ref	Expression
lgseisen.1	⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2}))
lgseisen.2	⊢ (𝜑 → 𝑄 ∈ (ℙ ∖ {2}))
lgseisen.3	⊢ (𝜑 → 𝑃 ≠ 𝑄)

**Assertion**
Ref	Expression
lgseisen	⊢ (𝜑 → (𝑄 /_L 𝑃) = (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))))

Distinct variable groups: 𝑥,𝑃 𝜑,𝑥 𝑥,𝑄

Proof of Theorem lgseisen Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lgseisen.2	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ (ℙ ∖ {2}))
2	1	eldifad 3915	. . . 4 ⊢ (𝜑 → 𝑄 ∈ ℙ)
3		prmz 16616	. . . 4 ⊢ (𝑄 ∈ ℙ → 𝑄 ∈ ℤ)
4	2, 3	syl 17	. . 3 ⊢ (𝜑 → 𝑄 ∈ ℤ)
5		lgseisen.1	. . 3 ⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2}))
6		lgsval3 27299	. . 3 ⊢ ((𝑄 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → (𝑄 /_L 𝑃) = ((((𝑄↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1))
7	4, 5, 6	syl2anc 585	. 2 ⊢ (𝜑 → (𝑄 /_L 𝑃) = ((((𝑄↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1))
8	1	gausslemma2dlem0a 27340	. . . . . . . 8 ⊢ (𝜑 → 𝑄 ∈ ℕ)
9		oddprm 16752	. . . . . . . . . 10 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → ((𝑃 − 1) / 2) ∈ ℕ)
10	5, 9	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((𝑃 − 1) / 2) ∈ ℕ)
11	10	nnnn0d 12476	. . . . . . . 8 ⊢ (𝜑 → ((𝑃 − 1) / 2) ∈ ℕ₀)
12	8, 11	nnexpcld 14182	. . . . . . 7 ⊢ (𝜑 → (𝑄↑((𝑃 − 1) / 2)) ∈ ℕ)
13	12	nnred 12174	. . . . . 6 ⊢ (𝜑 → (𝑄↑((𝑃 − 1) / 2)) ∈ ℝ)
14		neg1rr 12145	. . . . . . . 8 ⊢ -1 ∈ ℝ
15	14	a1i 11	. . . . . . 7 ⊢ (𝜑 → -1 ∈ ℝ)
16		neg1ne0 12146	. . . . . . . 8 ⊢ -1 ≠ 0
17	16	a1i 11	. . . . . . 7 ⊢ (𝜑 → -1 ≠ 0)
18		fzfid 13910	. . . . . . . 8 ⊢ (𝜑 → (1...((𝑃 − 1) / 2)) ∈ Fin)
19	8	nnred 12174	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑄 ∈ ℝ)
20	5	gausslemma2dlem0a 27340	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃 ∈ ℕ)
21	19, 20	nndivred 12213	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑄 / 𝑃) ∈ ℝ)
22	21	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((𝑃 − 1) / 2))) → (𝑄 / 𝑃) ∈ ℝ)
23		2re 12233	. . . . . . . . . . 11 ⊢ 2 ∈ ℝ
24		elfznn 13483	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (1...((𝑃 − 1) / 2)) → 𝑥 ∈ ℕ)
25	24	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((𝑃 − 1) / 2))) → 𝑥 ∈ ℕ)
26	25	nnred 12174	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((𝑃 − 1) / 2))) → 𝑥 ∈ ℝ)
27		remulcl 11125	. . . . . . . . . . 11 ⊢ ((2 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (2 · 𝑥) ∈ ℝ)
28	23, 26, 27	sylancr 588	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((𝑃 − 1) / 2))) → (2 · 𝑥) ∈ ℝ)
29	22, 28	remulcld 11176	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((𝑃 − 1) / 2))) → ((𝑄 / 𝑃) · (2 · 𝑥)) ∈ ℝ)
30	29	flcld 13732	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...((𝑃 − 1) / 2))) → (⌊‘((𝑄 / 𝑃) · (2 · 𝑥))) ∈ ℤ)
31	18, 30	fsumzcl 15672	. . . . . . 7 ⊢ (𝜑 → Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))) ∈ ℤ)
32	15, 17, 31	reexpclzd 14186	. . . . . 6 ⊢ (𝜑 → (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ∈ ℝ)
33		1re 11146	. . . . . . 7 ⊢ 1 ∈ ℝ
34	33	a1i 11	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ)
35	20	nnrpd 12961	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ ℝ⁺)
36		lgseisen.3	. . . . . . 7 ⊢ (𝜑 → 𝑃 ≠ 𝑄)
37		eqid 2737	. . . . . . 7 ⊢ ((𝑄 · (2 · 𝑥)) mod 𝑃) = ((𝑄 · (2 · 𝑥)) mod 𝑃)
38		eqid 2737	. . . . . . 7 ⊢ (𝑥 ∈ (1...((𝑃 − 1) / 2)) ↦ ((((-1↑((𝑄 · (2 · 𝑥)) mod 𝑃)) · ((𝑄 · (2 · 𝑥)) mod 𝑃)) mod 𝑃) / 2)) = (𝑥 ∈ (1...((𝑃 − 1) / 2)) ↦ ((((-1↑((𝑄 · (2 · 𝑥)) mod 𝑃)) · ((𝑄 · (2 · 𝑥)) mod 𝑃)) mod 𝑃) / 2))
39		eqid 2737	. . . . . . 7 ⊢ ((𝑄 · (2 · 𝑦)) mod 𝑃) = ((𝑄 · (2 · 𝑦)) mod 𝑃)
40		eqid 2737	. . . . . . 7 ⊢ (ℤ/nℤ‘𝑃) = (ℤ/nℤ‘𝑃)
41		eqid 2737	. . . . . . 7 ⊢ (mulGrp‘(ℤ/nℤ‘𝑃)) = (mulGrp‘(ℤ/nℤ‘𝑃))
42		eqid 2737	. . . . . . 7 ⊢ (ℤRHom‘(ℤ/nℤ‘𝑃)) = (ℤRHom‘(ℤ/nℤ‘𝑃))
43	5, 1, 36, 37, 38, 39, 40, 41, 42	lgseisenlem4 27362	. . . . . 6 ⊢ (𝜑 → ((𝑄↑((𝑃 − 1) / 2)) mod 𝑃) = ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) mod 𝑃))
44		modadd1 13842	. . . . . 6 ⊢ ((((𝑄↑((𝑃 − 1) / 2)) ∈ ℝ ∧ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ∈ ℝ) ∧ (1 ∈ ℝ ∧ 𝑃 ∈ ℝ⁺) ∧ ((𝑄↑((𝑃 − 1) / 2)) mod 𝑃) = ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) mod 𝑃)) → (((𝑄↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) mod 𝑃))
45	13, 32, 34, 35, 43, 44	syl221anc 1384	. . . . 5 ⊢ (𝜑 → (((𝑄↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) mod 𝑃))
46		peano2re 11320	. . . . . . 7 ⊢ ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ∈ ℝ → ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) ∈ ℝ)
47	32, 46	syl 17	. . . . . 6 ⊢ (𝜑 → ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) ∈ ℝ)
48		df-neg 11381	. . . . . . . 8 ⊢ -1 = (0 − 1)
49		neg1cn 12144	. . . . . . . . . . . . 13 ⊢ -1 ∈ ℂ
50		absexpz 15242	. . . . . . . . . . . . 13 ⊢ ((-1 ∈ ℂ ∧ -1 ≠ 0 ∧ Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))) ∈ ℤ) → (abs‘(-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))))) = ((abs‘-1)↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))))
51	49, 16, 31, 50	mp3an12i 1468	. . . . . . . . . . . 12 ⊢ (𝜑 → (abs‘(-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))))) = ((abs‘-1)↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))))
52		ax-1cn 11098	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℂ
53	52	absnegi 15338	. . . . . . . . . . . . . . 15 ⊢ (abs‘-1) = (abs‘1)
54		abs1 15234	. . . . . . . . . . . . . . 15 ⊢ (abs‘1) = 1
55	53, 54	eqtri 2760	. . . . . . . . . . . . . 14 ⊢ (abs‘-1) = 1
56	55	oveq1i 7380	. . . . . . . . . . . . 13 ⊢ ((abs‘-1)↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) = (1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))))
57		1exp 14028	. . . . . . . . . . . . . 14 ⊢ (Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))) ∈ ℤ → (1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) = 1)
58	31, 57	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) = 1)
59	56, 58	eqtrid 2784	. . . . . . . . . . . 12 ⊢ (𝜑 → ((abs‘-1)↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) = 1)
60	51, 59	eqtrd 2772	. . . . . . . . . . 11 ⊢ (𝜑 → (abs‘(-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))))) = 1)
61		1le1 11779	. . . . . . . . . . 11 ⊢ 1 ≤ 1
62	60, 61	eqbrtrdi 5139	. . . . . . . . . 10 ⊢ (𝜑 → (abs‘(-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))))) ≤ 1)
63		absle 15253	. . . . . . . . . . 11 ⊢ (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ∈ ℝ ∧ 1 ∈ ℝ) → ((abs‘(-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))))) ≤ 1 ↔ (-1 ≤ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ∧ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ≤ 1)))
64	32, 33, 63	sylancl 587	. . . . . . . . . 10 ⊢ (𝜑 → ((abs‘(-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥))))) ≤ 1 ↔ (-1 ≤ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ∧ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ≤ 1)))
65	62, 64	mpbid 232	. . . . . . . . 9 ⊢ (𝜑 → (-1 ≤ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ∧ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ≤ 1))
66	65	simpld 494	. . . . . . . 8 ⊢ (𝜑 → -1 ≤ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))))
67	48, 66	eqbrtrrid 5136	. . . . . . 7 ⊢ (𝜑 → (0 − 1) ≤ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))))
68		0red 11149	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ ℝ)
69	68, 34, 32	lesubaddd 11748	. . . . . . 7 ⊢ (𝜑 → ((0 − 1) ≤ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ↔ 0 ≤ ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1)))
70	67, 69	mpbid 232	. . . . . 6 ⊢ (𝜑 → 0 ≤ ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1))
71	20	nnred 12174	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ∈ ℝ)
72		peano2rem 11462	. . . . . . . . 9 ⊢ (𝑃 ∈ ℝ → (𝑃 − 1) ∈ ℝ)
73	71, 72	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑃 − 1) ∈ ℝ)
74	65	simprd 495	. . . . . . . 8 ⊢ (𝜑 → (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ≤ 1)
75		df-2 12222	. . . . . . . . . 10 ⊢ 2 = (1 + 1)
76	23	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 2 ∈ ℝ)
77	5	eldifad 3915	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃 ∈ ℙ)
78		prmuz2 16637	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ_≥‘2))
79		eluzle 12778	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ (ℤ_≥‘2) → 2 ≤ 𝑃)
80	77, 78, 79	3syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 2 ≤ 𝑃)
81		eldifsni 4748	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ≠ 2)
82	5, 81	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑃 ≠ 2)
83	76, 71, 80, 82	leneltd 11301	. . . . . . . . . 10 ⊢ (𝜑 → 2 < 𝑃)
84	75, 83	eqbrtrrid 5136	. . . . . . . . 9 ⊢ (𝜑 → (1 + 1) < 𝑃)
85	34, 34, 71	ltaddsubd 11751	. . . . . . . . 9 ⊢ (𝜑 → ((1 + 1) < 𝑃 ↔ 1 < (𝑃 − 1)))
86	84, 85	mpbid 232	. . . . . . . 8 ⊢ (𝜑 → 1 < (𝑃 − 1))
87	32, 34, 73, 74, 86	lelttrd 11305	. . . . . . 7 ⊢ (𝜑 → (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) < (𝑃 − 1))
88	32, 34, 71	ltaddsubd 11751	. . . . . . 7 ⊢ (𝜑 → (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) < 𝑃 ↔ (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) < (𝑃 − 1)))
89	87, 88	mpbird 257	. . . . . 6 ⊢ (𝜑 → ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) < 𝑃)
90		modid 13830	. . . . . 6 ⊢ (((((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) ∈ ℝ ∧ 𝑃 ∈ ℝ⁺) ∧ (0 ≤ ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) ∧ ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) < 𝑃)) → (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) mod 𝑃) = ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1))
91	47, 35, 70, 89, 90	syl22anc 839	. . . . 5 ⊢ (𝜑 → (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) mod 𝑃) = ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1))
92	45, 91	eqtrd 2772	. . . 4 ⊢ (𝜑 → (((𝑄↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = ((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1))
93	92	oveq1d 7385	. . 3 ⊢ (𝜑 → ((((𝑄↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) − 1))
94	32	recnd 11174	. . . 4 ⊢ (𝜑 → (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ∈ ℂ)
95		pncan 11400	. . . 4 ⊢ (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) ∈ ℂ ∧ 1 ∈ ℂ) → (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) − 1) = (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))))
96	94, 52, 95	sylancl 587	. . 3 ⊢ (𝜑 → (((-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))) + 1) − 1) = (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))))
97	93, 96	eqtrd 2772	. 2 ⊢ (𝜑 → ((((𝑄↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))))
98	7, 97	eqtrd 2772	1 ⊢ (𝜑 → (𝑄 /_L 𝑃) = (-1↑Σ𝑥 ∈ (1...((𝑃 − 1) / 2))(⌊‘((𝑄 / 𝑃) · (2 · 𝑥)))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∖ cdif 3900 {csn 4582 class class class wbr 5100 ↦ cmpt 5181 ‘cfv 6502 (class class class)co 7370 ℂcc 11038 ℝcr 11039 0cc0 11040 1c1 11041 + caddc 11043 · cmul 11045 < clt 11180 ≤ cle 11181 − cmin 11378 -cneg 11379 / cdiv 11808 ℕcn 12159 2c2 12214 ℤcz 12502 ℤ_≥cuz 12765 ℝ⁺crp 12919 ...cfz 13437 ⌊cfl 13724 mod cmo 13803 ↑cexp 13998 abscabs 15171 Σcsu 15623 ℙcprime 16612 mulGrpcmgp 20092 ℤRHomczrh 21471 ℤ/nℤczn 21474 /_L clgs 27278

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-inf2 9564 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 ax-pre-sup 11118 ax-addf 11119 ax-mulf 11120

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-se 5588 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-isom 6511 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-of 7634 df-om 7821 df-1st 7945 df-2nd 7946 df-supp 8115 df-tpos 8180 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-oadd 8413 df-er 8647 df-ec 8649 df-qs 8653 df-map 8779 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-fsupp 9279 df-sup 9359 df-inf 9360 df-oi 9429 df-dju 9827 df-card 9865 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-div 11809 df-nn 12160 df-2 12222 df-3 12223 df-4 12224 df-5 12225 df-6 12226 df-7 12227 df-8 12228 df-9 12229 df-n0 12416 df-xnn0 12489 df-z 12503 df-dec 12622 df-uz 12766 df-q 12876 df-rp 12920 df-fz 13438 df-fzo 13585 df-fl 13726 df-mod 13804 df-seq 13939 df-exp 13999 df-hash 14268 df-cj 15036 df-re 15037 df-im 15038 df-sqrt 15172 df-abs 15173 df-clim 15425 df-sum 15624 df-dvds 16194 df-gcd 16436 df-prm 16613 df-phi 16707 df-pc 16779 df-struct 17088 df-sets 17105 df-slot 17123 df-ndx 17135 df-base 17151 df-ress 17172 df-plusg 17204 df-mulr 17205 df-starv 17206 df-sca 17207 df-vsca 17208 df-ip 17209 df-tset 17210 df-ple 17211 df-ds 17213 df-unif 17214 df-0g 17375 df-gsum 17376 df-imas 17443 df-qus 17444 df-mgm 18579 df-sgrp 18658 df-mnd 18674 df-mhm 18722 df-submnd 18723 df-grp 18883 df-minusg 18884 df-sbg 18885 df-mulg 19015 df-subg 19070 df-nsg 19071 df-eqg 19072 df-ghm 19159 df-cntz 19263 df-cmn 19728 df-abl 19729 df-mgp 20093 df-rng 20105 df-ur 20134 df-ring 20187 df-cring 20188 df-oppr 20290 df-dvdsr 20310 df-unit 20311 df-invr 20341 df-dvr 20354 df-rhm 20425 df-nzr 20463 df-subrng 20496 df-subrg 20520 df-rlreg 20644 df-domn 20645 df-idom 20646 df-drng 20681 df-field 20682 df-lmod 20830 df-lss 20900 df-lsp 20940 df-sra 21142 df-rgmod 21143 df-lidl 21180 df-rsp 21181 df-2idl 21222 df-cnfld 21327 df-zring 21419 df-zrh 21475 df-zn 21478 df-lgs 27279

This theorem is referenced by: lgsquadlem2 27365

W3C validator