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

Theorem lgsfval 25248
 Description: Value of the function 𝐹 which defines the Legendre symbol at the primes. (Contributed by Mario Carneiro, 4-Feb-2015.)
Hypothesis
Ref Expression
lgsval.1 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (if(𝑛 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑛 − 1) / 2)) + 1) mod 𝑛) − 1))↑(𝑛 pCnt 𝑁)), 1))
Assertion
Ref Expression
lgsfval (𝑀 ∈ ℕ → (𝐹𝑀) = if(𝑀 ∈ ℙ, (if(𝑀 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑀 − 1) / 2)) + 1) mod 𝑀) − 1))↑(𝑀 pCnt 𝑁)), 1))
Distinct variable groups:   𝐴,𝑛   𝑛,𝑀   𝑛,𝑁
Allowed substitution hint:   𝐹(𝑛)

Proof of Theorem lgsfval
StepHypRef Expression
1 eleq1 2838 . . 3 (𝑛 = 𝑀 → (𝑛 ∈ ℙ ↔ 𝑀 ∈ ℙ))
2 eqeq1 2775 . . . . 5 (𝑛 = 𝑀 → (𝑛 = 2 ↔ 𝑀 = 2))
3 oveq1 6800 . . . . . . . . . 10 (𝑛 = 𝑀 → (𝑛 − 1) = (𝑀 − 1))
43oveq1d 6808 . . . . . . . . 9 (𝑛 = 𝑀 → ((𝑛 − 1) / 2) = ((𝑀 − 1) / 2))
54oveq2d 6809 . . . . . . . 8 (𝑛 = 𝑀 → (𝐴↑((𝑛 − 1) / 2)) = (𝐴↑((𝑀 − 1) / 2)))
65oveq1d 6808 . . . . . . 7 (𝑛 = 𝑀 → ((𝐴↑((𝑛 − 1) / 2)) + 1) = ((𝐴↑((𝑀 − 1) / 2)) + 1))
7 id 22 . . . . . . 7 (𝑛 = 𝑀𝑛 = 𝑀)
86, 7oveq12d 6811 . . . . . 6 (𝑛 = 𝑀 → (((𝐴↑((𝑛 − 1) / 2)) + 1) mod 𝑛) = (((𝐴↑((𝑀 − 1) / 2)) + 1) mod 𝑀))
98oveq1d 6808 . . . . 5 (𝑛 = 𝑀 → ((((𝐴↑((𝑛 − 1) / 2)) + 1) mod 𝑛) − 1) = ((((𝐴↑((𝑀 − 1) / 2)) + 1) mod 𝑀) − 1))
102, 9ifbieq2d 4250 . . . 4 (𝑛 = 𝑀 → if(𝑛 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑛 − 1) / 2)) + 1) mod 𝑛) − 1)) = if(𝑀 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑀 − 1) / 2)) + 1) mod 𝑀) − 1)))
11 oveq1 6800 . . . 4 (𝑛 = 𝑀 → (𝑛 pCnt 𝑁) = (𝑀 pCnt 𝑁))
1210, 11oveq12d 6811 . . 3 (𝑛 = 𝑀 → (if(𝑛 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑛 − 1) / 2)) + 1) mod 𝑛) − 1))↑(𝑛 pCnt 𝑁)) = (if(𝑀 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑀 − 1) / 2)) + 1) mod 𝑀) − 1))↑(𝑀 pCnt 𝑁)))
131, 12ifbieq1d 4248 . 2 (𝑛 = 𝑀 → if(𝑛 ∈ ℙ, (if(𝑛 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑛 − 1) / 2)) + 1) mod 𝑛) − 1))↑(𝑛 pCnt 𝑁)), 1) = if(𝑀 ∈ ℙ, (if(𝑀 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑀 − 1) / 2)) + 1) mod 𝑀) − 1))↑(𝑀 pCnt 𝑁)), 1))
14 lgsval.1 . 2 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (if(𝑛 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑛 − 1) / 2)) + 1) mod 𝑛) − 1))↑(𝑛 pCnt 𝑁)), 1))
15 ovex 6823 . . 3 (if(𝑀 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑀 − 1) / 2)) + 1) mod 𝑀) − 1))↑(𝑀 pCnt 𝑁)) ∈ V
16 1ex 10237 . . 3 1 ∈ V
1715, 16ifex 4295 . 2 if(𝑀 ∈ ℙ, (if(𝑀 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑀 − 1) / 2)) + 1) mod 𝑀) − 1))↑(𝑀 pCnt 𝑁)), 1) ∈ V
1813, 14, 17fvmpt 6424 1 (𝑀 ∈ ℕ → (𝐹𝑀) = if(𝑀 ∈ ℙ, (if(𝑀 = 2, if(2 ∥ 𝐴, 0, if((𝐴 mod 8) ∈ {1, 7}, 1, -1)), ((((𝐴↑((𝑀 − 1) / 2)) + 1) mod 𝑀) − 1))↑(𝑀 pCnt 𝑁)), 1))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1631   ∈ wcel 2145  ifcif 4225  {cpr 4318   class class class wbr 4786   ↦ cmpt 4863  ‘cfv 6031  (class class class)co 6793  0cc0 10138  1c1 10139   + caddc 10141   − cmin 10468  -cneg 10469   / cdiv 10886  ℕcn 11222  2c2 11272  7c7 11277  8c8 11278   mod cmo 12876  ↑cexp 13067   ∥ cdvds 15189  ℙcprime 15592   pCnt cpc 15748 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034  ax-1cn 10196 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 835  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-sbc 3588  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-uni 4575  df-br 4787  df-opab 4847  df-mpt 4864  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-iota 5994  df-fun 6033  df-fv 6039  df-ov 6796 This theorem is referenced by:  lgsval2lem  25253
 Copyright terms: Public domain W3C validator