| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lgssq | GIF version | ||
| Description: The Legendre symbol at a square is equal to 1. Together with lgsmod 15726 this implies that the Legendre symbol takes value 1 at every quadratic residue. (Contributed by Mario Carneiro, 5-Feb-2015.) (Revised by AV, 20-Jul-2021.) |
| Ref | Expression |
|---|---|
| lgssq | ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((𝐴↑2) /L 𝑁) = 1) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1l 1045 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝐴 ∈ ℤ) | |
| 2 | simp2 1022 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝑁 ∈ ℤ) | |
| 3 | simp1r 1046 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝐴 ≠ 0) | |
| 4 | lgsdir 15735 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝐴 ≠ 0 ∧ 𝐴 ≠ 0)) → ((𝐴 · 𝐴) /L 𝑁) = ((𝐴 /L 𝑁) · (𝐴 /L 𝑁))) | |
| 5 | 1, 1, 2, 3, 3, 4 | syl32anc 1279 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((𝐴 · 𝐴) /L 𝑁) = ((𝐴 /L 𝑁) · (𝐴 /L 𝑁))) |
| 6 | zcn 9467 | . . . . . 6 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ) | |
| 7 | 6 | adantr 276 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ) |
| 8 | 7 | 3ad2ant1 1042 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 𝐴 ∈ ℂ) |
| 9 | 8 | sqvald 10909 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (𝐴↑2) = (𝐴 · 𝐴)) |
| 10 | 9 | oveq1d 6025 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((𝐴↑2) /L 𝑁) = ((𝐴 · 𝐴) /L 𝑁)) |
| 11 | lgscl 15714 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐴 /L 𝑁) ∈ ℤ) | |
| 12 | 1, 2, 11 | syl2anc 411 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (𝐴 /L 𝑁) ∈ ℤ) |
| 13 | 12 | zred 9585 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (𝐴 /L 𝑁) ∈ ℝ) |
| 14 | absresq 11610 | . . . 4 ⊢ ((𝐴 /L 𝑁) ∈ ℝ → ((abs‘(𝐴 /L 𝑁))↑2) = ((𝐴 /L 𝑁)↑2)) | |
| 15 | 13, 14 | syl 14 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((abs‘(𝐴 /L 𝑁))↑2) = ((𝐴 /L 𝑁)↑2)) |
| 16 | lgsabs1 15739 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) = 1 ↔ (𝐴 gcd 𝑁) = 1)) | |
| 17 | 16 | adantlr 477 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) = 1 ↔ (𝐴 gcd 𝑁) = 1)) |
| 18 | 17 | biimp3ar 1380 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (abs‘(𝐴 /L 𝑁)) = 1) |
| 19 | 18 | oveq1d 6025 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((abs‘(𝐴 /L 𝑁))↑2) = (1↑2)) |
| 20 | sq1 10872 | . . . 4 ⊢ (1↑2) = 1 | |
| 21 | 19, 20 | eqtrdi 2278 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((abs‘(𝐴 /L 𝑁))↑2) = 1) |
| 22 | 12 | zcnd 9586 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → (𝐴 /L 𝑁) ∈ ℂ) |
| 23 | 22 | sqvald 10909 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((𝐴 /L 𝑁)↑2) = ((𝐴 /L 𝑁) · (𝐴 /L 𝑁))) |
| 24 | 15, 21, 23 | 3eqtr3d 2270 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → 1 = ((𝐴 /L 𝑁) · (𝐴 /L 𝑁))) |
| 25 | 5, 10, 24 | 3eqtr4d 2272 | 1 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ ∧ (𝐴 gcd 𝑁) = 1) → ((𝐴↑2) /L 𝑁) = 1) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ≠ wne 2400 ‘cfv 5321 (class class class)co 6010 ℂcc 8013 ℝcr 8014 0cc0 8015 1c1 8016 · cmul 8020 2c2 9177 ℤcz 9462 ↑cexp 10777 abscabs 11529 gcd cgcd 12495 /L clgs 15697 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-iinf 4681 ax-cnex 8106 ax-resscn 8107 ax-1cn 8108 ax-1re 8109 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-mulrcl 8114 ax-addcom 8115 ax-mulcom 8116 ax-addass 8117 ax-mulass 8118 ax-distr 8119 ax-i2m1 8120 ax-0lt1 8121 ax-1rid 8122 ax-0id 8123 ax-rnegex 8124 ax-precex 8125 ax-cnre 8126 ax-pre-ltirr 8127 ax-pre-ltwlin 8128 ax-pre-lttrn 8129 ax-pre-apti 8130 ax-pre-ltadd 8131 ax-pre-mulgt0 8132 ax-pre-mulext 8133 ax-arch 8134 ax-caucvg 8135 |
| This theorem depends on definitions: df-bi 117 df-stab 836 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-xor 1418 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4385 df-po 4388 df-iso 4389 df-iord 4458 df-on 4460 df-ilim 4461 df-suc 4463 df-iom 4684 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-f1 5326 df-fo 5327 df-f1o 5328 df-fv 5329 df-isom 5330 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-1st 6295 df-2nd 6296 df-recs 6462 df-irdg 6527 df-frec 6548 df-1o 6573 df-2o 6574 df-oadd 6577 df-er 6693 df-en 6901 df-dom 6902 df-fin 6903 df-sup 7167 df-inf 7168 df-pnf 8199 df-mnf 8200 df-xr 8201 df-ltxr 8202 df-le 8203 df-sub 8335 df-neg 8336 df-reap 8738 df-ap 8745 df-div 8836 df-inn 9127 df-2 9185 df-3 9186 df-4 9187 df-5 9188 df-6 9189 df-7 9190 df-8 9191 df-9 9192 df-n0 9386 df-z 9463 df-uz 9739 df-q 9832 df-rp 9867 df-fz 10222 df-fzo 10356 df-fl 10507 df-mod 10562 df-seqfrec 10687 df-exp 10778 df-ihash 11015 df-cj 11374 df-re 11375 df-im 11376 df-rsqrt 11530 df-abs 11531 df-clim 11811 df-proddc 12083 df-dvds 12320 df-gcd 12496 df-prm 12651 df-phi 12754 df-pc 12829 df-lgs 15698 |
| This theorem is referenced by: 1lgs 15743 lgsmulsqcoprm 15746 lgsquad2lem2 15782 |
| Copyright terms: Public domain | W3C validator |