Metamath Proof Explorer


Theorem lgsmod

Description: The Legendre (Jacobi) symbol is preserved under reduction mod n when n is odd. (Contributed by Mario Carneiro, 4-Feb-2015)

Ref Expression
Assertion lgsmod ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → A mod N / L N = A / L N

Proof

Step Hyp Ref Expression
1 zmodcl ⊢ A ∈ ℤ ∧ N ∈ ℕ → A mod N ∈ ℕ 0
2 1 3adant3 ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → A mod N ∈ ℕ 0
3 2 nn0zd ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → A mod N ∈ ℤ
4 3 ad2antrr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N ∈ ℤ
5 simpr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ → n ∈ ℙ
6 5 adantr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n ∈ ℙ
7 simpl3 ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ → ¬ 2 ∥ N
8 breq1 ⊢ n = 2 → n ∥ N ↔ 2 ∥ N
9 8 notbid ⊢ n = 2 → ¬ n ∥ N ↔ ¬ 2 ∥ N
10 7 9 syl5ibrcom ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ → n = 2 → ¬ n ∥ N
11 10 necon2ad ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ → n ∥ N → n ≠ 2
12 11 imp ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n ≠ 2
13 eldifsn ⊢ n ∈ ℙ ∖ 2 ↔ n ∈ ℙ ∧ n ≠ 2
14 6 12 13 sylanbrc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n ∈ ℙ ∖ 2
15 oddprm ⊢ n ∈ ℙ ∖ 2 → n − 1 2 ∈ ℕ
16 14 15 syl ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n − 1 2 ∈ ℕ
17 16 nnnn0d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n − 1 2 ∈ ℕ 0
18 zexpcl ⊢ A mod N ∈ ℤ ∧ n − 1 2 ∈ ℕ 0 → A mod N n − 1 2 ∈ ℤ
19 4 17 18 syl2anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N n − 1 2 ∈ ℤ
20 19 zred ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N n − 1 2 ∈ ℝ
21 simpll1 ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A ∈ ℤ
22 zexpcl ⊢ A ∈ ℤ ∧ n − 1 2 ∈ ℕ 0 → A n − 1 2 ∈ ℤ
23 21 17 22 syl2anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A n − 1 2 ∈ ℤ
24 23 zred ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A n − 1 2 ∈ ℝ
25 1red ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → 1 ∈ ℝ
26 prmnn ⊢ n ∈ ℙ → n ∈ ℕ
27 26 ad2antlr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n ∈ ℕ
28 27 nnrpd ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n ∈ ℝ +
29 prmz ⊢ n ∈ ℙ → n ∈ ℤ
30 29 ad2antlr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n ∈ ℤ
31 simp2 ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → N ∈ ℕ
32 31 ad2antrr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → N ∈ ℕ
33 32 nnzd ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → N ∈ ℤ
34 4 21 zsubcld ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N − A ∈ ℤ
35 simpr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n ∥ N
36 21 zred ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A ∈ ℝ
37 32 nnrpd ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → N ∈ ℝ +
38 modabs2 ⊢ A ∈ ℝ ∧ N ∈ ℝ + → A mod N mod N = A mod N
39 36 37 38 syl2anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N mod N = A mod N
40 moddvds ⊢ N ∈ ℕ ∧ A mod N ∈ ℤ ∧ A ∈ ℤ → A mod N mod N = A mod N ↔ N ∥ A mod N − A
41 32 4 21 40 syl3anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N mod N = A mod N ↔ N ∥ A mod N − A
42 39 41 mpbid ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → N ∥ A mod N − A
43 30 33 34 35 42 dvdstrd ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → n ∥ A mod N − A
44 moddvds ⊢ n ∈ ℕ ∧ A mod N ∈ ℤ ∧ A ∈ ℤ → A mod N mod n = A mod n ↔ n ∥ A mod N − A
45 27 4 21 44 syl3anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N mod n = A mod n ↔ n ∥ A mod N − A
46 43 45 mpbird ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N mod n = A mod n
47 modexp ⊢ A mod N ∈ ℤ ∧ A ∈ ℤ ∧ n − 1 2 ∈ ℕ 0 ∧ n ∈ ℝ + ∧ A mod N mod n = A mod n → A mod N n − 1 2 mod n = A n − 1 2 mod n
48 4 21 17 28 46 47 syl221anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N n − 1 2 mod n = A n − 1 2 mod n
49 modadd1 ⊢ A mod N n − 1 2 ∈ ℝ ∧ A n − 1 2 ∈ ℝ ∧ 1 ∈ ℝ ∧ n ∈ ℝ + ∧ A mod N n − 1 2 mod n = A n − 1 2 mod n → A mod N n − 1 2 + 1 mod n = A n − 1 2 + 1 mod n
50 20 24 25 28 48 49 syl221anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N n − 1 2 + 1 mod n = A n − 1 2 + 1 mod n
51 50 oveq1d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N n − 1 2 + 1 mod n − 1 = A n − 1 2 + 1 mod n − 1
52 lgsval3 ⊢ A mod N ∈ ℤ ∧ n ∈ ℙ ∖ 2 → A mod N / L n = A mod N n − 1 2 + 1 mod n − 1
53 4 14 52 syl2anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N / L n = A mod N n − 1 2 + 1 mod n − 1
54 lgsval3 ⊢ A ∈ ℤ ∧ n ∈ ℙ ∖ 2 → A / L n = A n − 1 2 + 1 mod n − 1
55 21 14 54 syl2anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A / L n = A n − 1 2 + 1 mod n − 1
56 51 53 55 3eqtr4d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N / L n = A / L n
57 56 oveq1d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ n ∥ N → A mod N / L n n pCnt N = A / L n n pCnt N
58 3 ad2antrr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A mod N ∈ ℤ
59 29 ad2antlr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → n ∈ ℤ
60 lgscl ⊢ A mod N ∈ ℤ ∧ n ∈ ℤ → A mod N / L n ∈ ℤ
61 58 59 60 syl2anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A mod N / L n ∈ ℤ
62 61 zcnd ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A mod N / L n ∈ ℂ
63 62 exp0d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A mod N / L n 0 = 1
64 simpll1 ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A ∈ ℤ
65 lgscl ⊢ A ∈ ℤ ∧ n ∈ ℤ → A / L n ∈ ℤ
66 64 59 65 syl2anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A / L n ∈ ℤ
67 66 zcnd ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A / L n ∈ ℂ
68 67 exp0d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A / L n 0 = 1
69 63 68 eqtr4d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A mod N / L n 0 = A / L n 0
70 31 adantr ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ → N ∈ ℕ
71 pceq0 ⊢ n ∈ ℙ ∧ N ∈ ℕ → n pCnt N = 0 ↔ ¬ n ∥ N
72 5 70 71 syl2anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ → n pCnt N = 0 ↔ ¬ n ∥ N
73 72 biimpar ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → n pCnt N = 0
74 73 oveq2d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A mod N / L n n pCnt N = A mod N / L n 0
75 73 oveq2d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A / L n n pCnt N = A / L n 0
76 69 74 75 3eqtr4d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ ∧ ¬ n ∥ N → A mod N / L n n pCnt N = A / L n n pCnt N
77 57 76 pm2.61dan ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N ∧ n ∈ ℙ → A mod N / L n n pCnt N = A / L n n pCnt N
78 77 ifeq1da ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → if n ∈ ℙ A mod N / L n n pCnt N 1 = if n ∈ ℙ A / L n n pCnt N 1
79 78 mpteq2dv ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → n ∈ ℕ ⟼ if n ∈ ℙ A mod N / L n n pCnt N 1 = n ∈ ℕ ⟼ if n ∈ ℙ A / L n n pCnt N 1
80 79 seqeq3d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ A mod N / L n n pCnt N 1 = seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ A / L n n pCnt N 1
81 80 fveq1d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ A mod N / L n n pCnt N 1 ⁡ N = seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ A / L n n pCnt N 1 ⁡ N
82 eqid ⊢ n ∈ ℕ ⟼ if n ∈ ℙ A mod N / L n n pCnt N 1 = n ∈ ℕ ⟼ if n ∈ ℙ A mod N / L n n pCnt N 1
83 82 lgsval4a ⊢ A mod N ∈ ℤ ∧ N ∈ ℕ → A mod N / L N = seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ A mod N / L n n pCnt N 1 ⁡ N
84 3 31 83 syl2anc ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → A mod N / L N = seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ A mod N / L n n pCnt N 1 ⁡ N
85 eqid ⊢ n ∈ ℕ ⟼ if n ∈ ℙ A / L n n pCnt N 1 = n ∈ ℕ ⟼ if n ∈ ℙ A / L n n pCnt N 1
86 85 lgsval4a ⊢ A ∈ ℤ ∧ N ∈ ℕ → A / L N = seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ A / L n n pCnt N 1 ⁡ N
87 86 3adant3 ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → A / L N = seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ A / L n n pCnt N 1 ⁡ N
88 81 84 87 3eqtr4d ⊢ A ∈ ℤ ∧ N ∈ ℕ ∧ ¬ 2 ∥ N → A mod N / L N = A / L N