| 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 15606 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐴 /L 𝑁) ∈ ℤ) | |
| 2 | 1 | zcnd 9531 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐴 /L 𝑁) ∈ ℂ) |
| 3 | 2 | abscld 11607 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (abs‘(𝐴 /L 𝑁)) ∈ ℝ) |
| 4 | 1re 8106 | . . 3 ⊢ 1 ∈ ℝ | |
| 5 | letri3 8188 | . . 3 ⊢ (((abs‘(𝐴 /L 𝑁)) ∈ ℝ ∧ 1 ∈ ℝ) → ((abs‘(𝐴 /L 𝑁)) = 1 ↔ ((abs‘(𝐴 /L 𝑁)) ≤ 1 ∧ 1 ≤ (abs‘(𝐴 /L 𝑁))))) | |
| 6 | 3, 4, 5 | sylancl 413 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) = 1 ↔ ((abs‘(𝐴 /L 𝑁)) ≤ 1 ∧ 1 ≤ (abs‘(𝐴 /L 𝑁))))) |
| 7 | lgsle1 15607 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (abs‘(𝐴 /L 𝑁)) ≤ 1) | |
| 8 | 7 | biantrurd 305 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (1 ≤ (abs‘(𝐴 /L 𝑁)) ↔ ((abs‘(𝐴 /L 𝑁)) ≤ 1 ∧ 1 ≤ (abs‘(𝐴 /L 𝑁))))) |
| 9 | nnne0 9099 | . . . 4 ⊢ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ → (abs‘(𝐴 /L 𝑁)) ≠ 0) | |
| 10 | neneq 2400 | . . . . . . 7 ⊢ ((abs‘(𝐴 /L 𝑁)) ≠ 0 → ¬ (abs‘(𝐴 /L 𝑁)) = 0) | |
| 11 | 10 | adantl 277 | . . . . . 6 ⊢ (((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (abs‘(𝐴 /L 𝑁)) ≠ 0) → ¬ (abs‘(𝐴 /L 𝑁)) = 0) |
| 12 | nn0abscl 11511 | . . . . . . . . 9 ⊢ ((𝐴 /L 𝑁) ∈ ℤ → (abs‘(𝐴 /L 𝑁)) ∈ ℕ0) | |
| 13 | 1, 12 | syl 14 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (abs‘(𝐴 /L 𝑁)) ∈ ℕ0) |
| 14 | elnn0 9332 | . . . . . . . 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 1362 | . . . . 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 9375 | . . . . 5 ⊢ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ↔ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ0 ∧ 1 ≤ (abs‘(𝐴 /L 𝑁)))) | |
| 21 | 20 | baib 921 | . . . 4 ⊢ ((abs‘(𝐴 /L 𝑁)) ∈ ℕ0 → ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ↔ 1 ≤ (abs‘(𝐴 /L 𝑁)))) |
| 22 | 13, 21 | syl 14 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) ∈ ℕ ↔ 1 ≤ (abs‘(𝐴 /L 𝑁)))) |
| 23 | abs00 11490 | . . . . . 6 ⊢ ((𝐴 /L 𝑁) ∈ ℂ → ((abs‘(𝐴 /L 𝑁)) = 0 ↔ (𝐴 /L 𝑁) = 0)) | |
| 24 | 23 | necon3bid 2419 | . . . . 5 ⊢ ((𝐴 /L 𝑁) ∈ ℂ → ((abs‘(𝐴 /L 𝑁)) ≠ 0 ↔ (𝐴 /L 𝑁) ≠ 0)) |
| 25 | 2, 24 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((abs‘(𝐴 /L 𝑁)) ≠ 0 ↔ (𝐴 /L 𝑁) ≠ 0)) |
| 26 | lgsne0 15630 | . . . 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 |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 710 = wceq 1373 ∈ wcel 2178 ≠ wne 2378 class class class wbr 4059 ‘cfv 5290 (class class class)co 5967 ℂcc 7958 ℝcr 7959 0cc0 7960 1c1 7961 ≤ cle 8143 ℕcn 9071 ℕ0cn0 9330 ℤcz 9407 abscabs 11423 gcd cgcd 12389 /L clgs 15589 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-coll 4175 ax-sep 4178 ax-nul 4186 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-setind 4603 ax-iinf 4654 ax-cnex 8051 ax-resscn 8052 ax-1cn 8053 ax-1re 8054 ax-icn 8055 ax-addcl 8056 ax-addrcl 8057 ax-mulcl 8058 ax-mulrcl 8059 ax-addcom 8060 ax-mulcom 8061 ax-addass 8062 ax-mulass 8063 ax-distr 8064 ax-i2m1 8065 ax-0lt1 8066 ax-1rid 8067 ax-0id 8068 ax-rnegex 8069 ax-precex 8070 ax-cnre 8071 ax-pre-ltirr 8072 ax-pre-ltwlin 8073 ax-pre-lttrn 8074 ax-pre-apti 8075 ax-pre-ltadd 8076 ax-pre-mulgt0 8077 ax-pre-mulext 8078 ax-arch 8079 ax-caucvg 8080 |
| This theorem depends on definitions: df-bi 117 df-stab 833 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-xor 1396 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-reu 2493 df-rmo 2494 df-rab 2495 df-v 2778 df-sbc 3006 df-csb 3102 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-nul 3469 df-if 3580 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-int 3900 df-iun 3943 df-br 4060 df-opab 4122 df-mpt 4123 df-tr 4159 df-id 4358 df-po 4361 df-iso 4362 df-iord 4431 df-on 4433 df-ilim 4434 df-suc 4436 df-iom 4657 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-rn 4704 df-res 4705 df-ima 4706 df-iota 5251 df-fun 5292 df-fn 5293 df-f 5294 df-f1 5295 df-fo 5296 df-f1o 5297 df-fv 5298 df-isom 5299 df-riota 5922 df-ov 5970 df-oprab 5971 df-mpo 5972 df-1st 6249 df-2nd 6250 df-recs 6414 df-irdg 6479 df-frec 6500 df-1o 6525 df-2o 6526 df-oadd 6529 df-er 6643 df-en 6851 df-dom 6852 df-fin 6853 df-sup 7112 df-inf 7113 df-pnf 8144 df-mnf 8145 df-xr 8146 df-ltxr 8147 df-le 8148 df-sub 8280 df-neg 8281 df-reap 8683 df-ap 8690 df-div 8781 df-inn 9072 df-2 9130 df-3 9131 df-4 9132 df-5 9133 df-6 9134 df-7 9135 df-8 9136 df-n0 9331 df-z 9408 df-uz 9684 df-q 9776 df-rp 9811 df-fz 10166 df-fzo 10300 df-fl 10450 df-mod 10505 df-seqfrec 10630 df-exp 10721 df-ihash 10958 df-cj 11268 df-re 11269 df-im 11270 df-rsqrt 11424 df-abs 11425 df-clim 11705 df-proddc 11977 df-dvds 12214 df-gcd 12390 df-prm 12545 df-phi 12648 df-pc 12723 df-lgs 15590 |
| This theorem is referenced by: lgssq 15632 lgssq2 15633 lgsquad3 15676 |
| Copyright terms: Public domain | W3C validator |