| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lgsabs1 | GIF version | ||
| Description: The Legendre symbol is nonzero (and hence equal to 1 or -1) precisely when the arguments are coprime. (Contributed by Mario Carneiro, 5-Feb-2015.) |
| Ref | Expression |
|---|---|
| lgsabs1 | ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) = 1 ↔ (𝐴 gcd 𝑁) = 1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lgscl 16338 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐴 /L 𝑁) ∈ ℤ) | |
| 2 | 1 | zcnd 9780 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐴 /L 𝑁) ∈ ℂ) |
| 3 | 2 | abscld 11970 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (abs‘(𝐴 /L 𝑁)) ∈ ℝ) |
| 4 | 1re 8331 | . . 3 ⊢ 1 ∈ ℝ | |
| 5 | letri3 8412 | . . 3 ⊢ (((abs‘(𝐴 /L 𝑁)) ∈ ℝ ∧ 1 ∈ ℝ) → ((abs‘(𝐴 /L 𝑁)) = 1 ↔ ((abs‘(𝐴 /L 𝑁)) ≤ 1 ∧ 1 ≤ (abs‘(𝐴 /L 𝑁))))) | |
| 6 | 3, 4, 5 | sylancl 417 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) = 1 ↔ ((abs‘(𝐴 /L 𝑁)) ≤ 1 ∧ 1 ≤ (abs‘(𝐴 /L 𝑁))))) |
| 7 | lgsle1 16339 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (abs‘(𝐴 /L 𝑁)) ≤ 1) | |
| 8 | 7 | biantrurd 305 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (1 ≤ (abs‘(𝐴 /L 𝑁)) ↔ ((abs‘(𝐴 /L 𝑁)) ≤ 1 ∧ 1 ≤ (abs‘(𝐴 /L 𝑁))))) |
| 9 | nnne0 9341 | . . . 4 ⊢ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ → (abs‘(𝐴 /L 𝑁)) ≠ 0) | |
| 10 | neneq 2442 | . . . . . . 7 ⊢ ((abs‘(𝐴 /L 𝑁)) ≠ 0 → ¬ (abs‘(𝐴 /L 𝑁)) = 0) | |
| 11 | 10 | adantl 277 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (abs‘(𝐴 /L 𝑁)) ≠ 0) → ¬ (abs‘(𝐴 /L 𝑁)) = 0) |
| 12 | nn0abscl 11874 | . . . . . . . . 9 ⊢ ((𝐴 /L 𝑁) ∈ ℤ → (abs‘(𝐴 /L 𝑁)) ∈ ℕ0) | |
| 13 | 1, 12 | syl 14 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (abs‘(𝐴 /L 𝑁)) ∈ ℕ0) |
| 14 | elnn0 9576 | . . . . . . . 8 ⊢ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ0 ↔ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ∨ (abs‘(𝐴 /L 𝑁)) = 0)) | |
| 15 | 13, 14 | sylib 122 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ∨ (abs‘(𝐴 /L 𝑁)) = 0)) |
| 16 | 15 | adantr 276 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (abs‘(𝐴 /L 𝑁)) ≠ 0) → ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ∨ (abs‘(𝐴 /L 𝑁)) = 0)) |
| 17 | 11, 16 | ecased 1390 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (abs‘(𝐴 /L 𝑁)) ≠ 0) → (abs‘(𝐴 /L 𝑁)) ∈ ℕ) |
| 18 | 17 | ex 115 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) ≠ 0 → (abs‘(𝐴 /L 𝑁)) ∈ ℕ)) |
| 19 | 9, 18 | impbid2 143 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ↔ (abs‘(𝐴 /L 𝑁)) ≠ 0)) |
| 20 | elnnnn0c 9619 | . . . . 5 ⊢ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ↔ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ0 ∧ 1 ≤ (abs‘(𝐴 /L 𝑁)))) | |
| 21 | 20 | baib 931 | . . . 4 ⊢ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ0 → ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ↔ 1 ≤ (abs‘(𝐴 /L 𝑁)))) |
| 22 | 13, 21 | syl 14 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ↔ 1 ≤ (abs‘(𝐴 /L 𝑁)))) |
| 23 | abs00 11852 | . . . . . 6 ⊢ ((𝐴 /L 𝑁) ∈ ℂ → ((abs‘(𝐴 /L 𝑁)) = 0 ↔ (𝐴 /L 𝑁) = 0)) | |
| 24 | 23 | necon3bid 2461 | . . . . 5 ⊢ ((𝐴 /L 𝑁) ∈ ℂ → ((abs‘(𝐴 /L 𝑁)) ≠ 0 ↔ (𝐴 /L 𝑁) ≠ 0)) |
| 25 | 2, 24 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) ≠ 0 ↔ (𝐴 /L 𝑁) ≠ 0)) |
| 26 | lgsne0 16362 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐴 /L 𝑁) ≠ 0 ↔ (𝐴 gcd 𝑁) = 1)) | |
| 27 | 25, 26 | bitrd 188 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) ≠ 0 ↔ (𝐴 gcd 𝑁) = 1)) |
| 28 | 19, 22, 27 | 3bitr3d 218 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (1 ≤ (abs‘(𝐴 /L 𝑁)) ↔ (𝐴 gcd 𝑁) = 1)) |
| 29 | 6, 8, 28 | 3bitr2d 216 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) = 1 ↔ (𝐴 gcd 𝑁) = 1)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 720 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 class class class wbr 4131 ‘cfv 5380 (class class class)co 6088 ℂcc 8183 ℝcr 8184 0cc0 8185 1c1 8186 ≤ cle 8367 ℕcn 9313 ℕ0cn0 9574 ℤcz 9655 abscabs 11785 gcd cgcd 12755 /L clgs 16321 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 ax-pre-mulext 8303 ax-arch 8304 ax-caucvg 8305 |
| This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-xor 1425 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-isom 5389 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-frec 6666 df-1o 6691 df-2o 6692 df-oadd 6695 df-er 6811 df-en 7027 df-dom 7028 df-fin 7029 df-sup 7330 df-inf 7331 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-reap 8911 df-ap 8918 df-div 9011 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-5 9375 df-6 9376 df-7 9377 df-8 9378 df-n0 9575 df-z 9656 df-uz 9938 df-q 10036 df-rp 10072 df-fz 10429 df-fzo 10567 df-fl 10722 df-mod 10781 df-seqfrec 10906 df-exp 10997 df-ihash 11237 df-cj 11629 df-re 11630 df-im 11631 df-rsqrt 11786 df-abs 11787 df-clim 12070 df-proddc 12343 df-dvds 12580 df-gcd 12756 df-prm 12911 df-phi 13018 df-pc 13093 df-lgs 16322 |
| This theorem is used by: lgssq 16364 lgssq2 16365 lgsquad3 16408 |
| Copyright terms: Public domain | W3C validator |