| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lgsprme0 | Structured version Visualization version GIF version | ||
| Description: The Legendre symbol at any prime (even at 2) is 0 iff the prime does not divide the first argument. See definition in [ApostolNT] p. 179. (Contributed by AV, 20-Jul-2021.) |
| Ref | Expression |
|---|---|
| lgsprme0 | ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → ((𝐴 /L 𝑃) = 0 ↔ (𝐴 mod 𝑃) = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prmz 16891 | . . . 4 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
| 2 | lgsne0 27708 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℤ) → ((𝐴 /L 𝑃) ≠ 0 ↔ (𝐴 gcd 𝑃) = 1)) | |
| 3 | 1, 2 | sylan2 605 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → ((𝐴 /L 𝑃) ≠ 0 ↔ (𝐴 gcd 𝑃) = 1)) |
| 4 | coprm 16928 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (¬ 𝑃 ∥ 𝐴 ↔ (𝑃 gcd 𝐴) = 1)) | |
| 5 | 4 | ancoms 464 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → (¬ 𝑃 ∥ 𝐴 ↔ (𝑃 gcd 𝐴) = 1)) |
| 6 | 1 | anim1i 627 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∈ ℤ ∧ 𝐴 ∈ ℤ)) |
| 7 | 6 | ancoms 464 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → (𝑃 ∈ ℤ ∧ 𝐴 ∈ ℤ)) |
| 8 | gcdcom 16726 | . . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝑃 gcd 𝐴) = (𝐴 gcd 𝑃)) | |
| 9 | 7, 8 | syl 18 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → (𝑃 gcd 𝐴) = (𝐴 gcd 𝑃)) |
| 10 | 9 | eqeq1d 2765 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → ((𝑃 gcd 𝐴) = 1 ↔ (𝐴 gcd 𝑃) = 1)) |
| 11 | 5, 10 | bitr2d 283 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → ((𝐴 gcd 𝑃) = 1 ↔ ¬ 𝑃 ∥ 𝐴)) |
| 12 | prmnn 16890 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 13 | dvdsval3 16467 | . . . . . 6 ⊢ ((𝑃 ∈ ℕ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ 𝐴 ↔ (𝐴 mod 𝑃) = 0)) | |
| 14 | 12, 13 | sylan 592 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ 𝐴 ↔ (𝐴 mod 𝑃) = 0)) |
| 15 | 14 | ancoms 464 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → (𝑃 ∥ 𝐴 ↔ (𝐴 mod 𝑃) = 0)) |
| 16 | 15 | notbid 321 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → (¬ 𝑃 ∥ 𝐴 ↔ ¬ (𝐴 mod 𝑃) = 0)) |
| 17 | 3, 11, 16 | 3bitrd 308 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → ((𝐴 /L 𝑃) ≠ 0 ↔ ¬ (𝐴 mod 𝑃) = 0)) |
| 18 | 17 | necon4abid 2999 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ ℙ) → ((𝐴 /L 𝑃) = 0 ↔ (𝐴 mod 𝑃) = 0)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5106 (class class class)co 7449 0cc0 11237 1c1 11238 ℕcn 12373 ℤcz 12731 mod cmo 14047 ∥ cdvds 16463 gcd cgcd 16705 ℙcprime 16887 /L clgs 27667 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7781 ax-cnex 11293 ax-resscn 11294 ax-1cn 11295 ax-icn 11296 ax-addcl 11297 ax-addrcl 11298 ax-mulcl 11299 ax-mulrcl 11300 ax-mulcom 11301 ax-addass 11302 ax-mulass 11303 ax-distr 11304 ax-i2m1 11305 ax-1ne0 11306 ax-1rid 11307 ax-rnegex 11308 ax-rrecex 11309 ax-cnre 11310 ax-pre-lttri 11311 ax-pre-lttrn 11312 ax-pre-ltadd 11313 ax-pre-mulgt0 11314 ax-pre-sup 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6328 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6518 df-fun 6566 df-fn 6567 df-f 6568 df-f1 6569 df-fo 6570 df-f1o 6571 df-fv 6572 df-riota 7406 df-ov 7452 df-oprab 7453 df-mpo 7454 df-om 7910 df-1st 8033 df-2nd 8034 df-frecs 8335 df-wrecs 8366 df-recs 8415 df-rdg 8454 df-1o 8512 df-2o 8513 df-oadd 8516 df-er 8753 df-en 9010 df-dom 9011 df-sdom 9012 df-fin 9013 df-sup 9469 df-inf 9470 df-dju 10017 df-card 10055 df-pnf 11382 df-mnf 11383 df-xr 11384 df-ltxr 11385 df-le 11386 df-sub 11580 df-neg 11581 df-div 12012 df-nn 12374 df-2 12443 df-3 12444 df-n0 12645 df-xnn0 12718 df-z 12732 df-uz 13004 df-q 13114 df-rp 13159 df-fz 13678 df-fzo 13827 df-fl 13970 df-mod 14048 df-seq 14183 df-exp 14243 df-hash 14514 df-cj 15307 df-re 15308 df-im 15309 df-sqrt 15443 df-abs 15444 df-dvds 16464 df-gcd 16706 df-prm 16888 df-phi 16984 df-pc 17056 df-lgs 27668 |
| This theorem is used by: lgsqrmodndvds 27726 |
| Copyright terms: Public domain | W3C validator |