Metamath Proof Explorer


Theorem lgsvalmod

Description: The Legendre symbol is equivalent to a ^ ( ( p - 1 ) / 2 ) , mod p . This theorem is also called "Euler's criterion", see theorem 9.2 in ApostolNT p. 180, or a representation of Euler's criterion using the Legendre symbol, see also lgsqr . (Contributed by Mario Carneiro, 4-Feb-2015)

Ref Expression
Assertion lgsvalmod ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P mod P = A P − 1 2 mod P

Proof

Step Hyp Ref Expression
1 eldifi ⊢ P ∈ ℙ ∖ 2 → P ∈ ℙ
2 1 adantl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → P ∈ ℙ
3 prmz ⊢ P ∈ ℙ → P ∈ ℤ
4 2 3 syl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → P ∈ ℤ
5 lgscl ⊢ A ∈ ℤ ∧ P ∈ ℤ → A / L P ∈ ℤ
6 4 5 syldan ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P ∈ ℤ
7 6 zred ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P ∈ ℝ
8 peano2re ⊢ A / L P ∈ ℝ → A / L P + 1 ∈ ℝ
9 7 8 syl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 ∈ ℝ
10 oddprm ⊢ P ∈ ℙ ∖ 2 → P − 1 2 ∈ ℕ
11 10 adantl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → P − 1 2 ∈ ℕ
12 11 nnnn0d ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → P − 1 2 ∈ ℕ 0
13 zexpcl ⊢ A ∈ ℤ ∧ P − 1 2 ∈ ℕ 0 → A P − 1 2 ∈ ℤ
14 12 13 syldan ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 ∈ ℤ
15 14 zred ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 ∈ ℝ
16 peano2re ⊢ A P − 1 2 ∈ ℝ → A P − 1 2 + 1 ∈ ℝ
17 15 16 syl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 + 1 ∈ ℝ
18 neg1rr ⊢ − 1 ∈ ℝ
19 18 a1i ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → − 1 ∈ ℝ
20 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
21 2 20 syl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → P ∈ ℕ
22 21 nnrpd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → P ∈ ℝ +
23 17 22 modcld ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 + 1 mod P ∈ ℝ
24 23 recnd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 + 1 mod P ∈ ℂ
25 ax-1cn ⊢ 1 ∈ ℂ
26 25 a1i ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → 1 ∈ ℂ
27 lgsval3 ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P = A P − 1 2 + 1 mod P − 1
28 24 26 27 mvrrsubd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 = A P − 1 2 + 1 mod P
29 28 oveq1d ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 mod P = A P − 1 2 + 1 mod P mod P
30 modabs2 ⊢ A P − 1 2 + 1 ∈ ℝ ∧ P ∈ ℝ + → A P − 1 2 + 1 mod P mod P = A P − 1 2 + 1 mod P
31 17 22 30 syl2anc ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 + 1 mod P mod P = A P − 1 2 + 1 mod P
32 29 31 eqtrd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 mod P = A P − 1 2 + 1 mod P
33 modadd1 ⊢ A / L P + 1 ∈ ℝ ∧ A P − 1 2 + 1 ∈ ℝ ∧ − 1 ∈ ℝ ∧ P ∈ ℝ + ∧ A / L P + 1 mod P = A P − 1 2 + 1 mod P → A / L P + 1 + -1 mod P = A P − 1 2 + 1 + -1 mod P
34 9 17 19 22 32 33 syl221anc ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 + -1 mod P = A P − 1 2 + 1 + -1 mod P
35 9 recnd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 ∈ ℂ
36 negsub ⊢ A / L P + 1 ∈ ℂ ∧ 1 ∈ ℂ → A / L P + 1 + -1 = A / L P + 1 - 1
37 35 25 36 sylancl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 + -1 = A / L P + 1 - 1
38 7 recnd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P ∈ ℂ
39 pncan ⊢ A / L P ∈ ℂ ∧ 1 ∈ ℂ → A / L P + 1 - 1 = A / L P
40 38 25 39 sylancl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 - 1 = A / L P
41 37 40 eqtrd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 + -1 = A / L P
42 41 oveq1d ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P + 1 + -1 mod P = A / L P mod P
43 17 recnd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 + 1 ∈ ℂ
44 negsub ⊢ A P − 1 2 + 1 ∈ ℂ ∧ 1 ∈ ℂ → A P − 1 2 + 1 + -1 = A P − 1 2 + 1 - 1
45 43 25 44 sylancl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 + 1 + -1 = A P − 1 2 + 1 - 1
46 15 recnd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 ∈ ℂ
47 pncan ⊢ A P − 1 2 ∈ ℂ ∧ 1 ∈ ℂ → A P − 1 2 + 1 - 1 = A P − 1 2
48 46 25 47 sylancl ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 + 1 - 1 = A P − 1 2
49 45 48 eqtrd ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 + 1 + -1 = A P − 1 2
50 49 oveq1d ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A P − 1 2 + 1 + -1 mod P = A P − 1 2 mod P
51 34 42 50 3eqtr3d ⊢ A ∈ ℤ ∧ P ∈ ℙ ∖ 2 → A / L P mod P = A P − 1 2 mod P