| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lgslem4 | GIF version | ||
| Description: Lemma for lgsfcl2 15896. (Contributed by Mario Carneiro, 4-Feb-2015.) (Proof shortened by AV, 19-Mar-2022.) |
| Ref | Expression |
|---|---|
| lgslem2.z | ⊢ 𝑍 = {𝑥 ∈ ℤ ∣ (abs‘𝑥) ≤ 1} |
| Ref | Expression |
|---|---|
| lgslem4 | ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifi 3343 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 2 | 1 | adantl 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝑃 ∈ ℙ) |
| 3 | simpl 109 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝐴 ∈ ℤ) | |
| 4 | oddprm 12961 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → ((𝑃 − 1) / 2) ∈ ℕ) | |
| 5 | 4 | adantl 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((𝑃 − 1) / 2) ∈ ℕ) |
| 6 | prmdvdsexp 12849 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℕ) → (𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ↔ 𝑃 ∥ 𝐴)) | |
| 7 | 2, 3, 5, 6 | syl3anc 1274 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → (𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ↔ 𝑃 ∥ 𝐴)) |
| 8 | 7 | biimpar 297 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → 𝑃 ∥ (𝐴↑((𝑃 − 1) / 2))) |
| 9 | prmgt1 12833 | . . . . . . 7 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃) | |
| 10 | 1, 9 | syl 14 | . . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 1 < 𝑃) |
| 11 | 10 | ad2antlr 489 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → 1 < 𝑃) |
| 12 | p1modz1 12484 | . . . . 5 ⊢ ((𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ∧ 1 < 𝑃) → (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 1) | |
| 13 | 8, 11, 12 | syl2anc 411 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 1) |
| 14 | 13 | oveq1d 6067 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (1 − 1)) |
| 15 | 1m1e0 9308 | . . . 4 ⊢ (1 − 1) = 0 | |
| 16 | lgslem2.z | . . . . . 6 ⊢ 𝑍 = {𝑥 ∈ ℤ ∣ (abs‘𝑥) ≤ 1} | |
| 17 | 16 | lgslem2 15891 | . . . . 5 ⊢ (-1 ∈ 𝑍 ∧ 0 ∈ 𝑍 ∧ 1 ∈ 𝑍) |
| 18 | 17 | simp2i 1034 | . . . 4 ⊢ 0 ∈ 𝑍 |
| 19 | 15, 18 | eqeltri 2307 | . . 3 ⊢ (1 − 1) ∈ 𝑍 |
| 20 | 14, 19 | eqeltrdi 2325 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 21 | lgslem1 15890 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2}) ∧ ¬ 𝑃 ∥ 𝐴) → (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2}) | |
| 22 | elpri 3714 | . . . 4 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2} → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 ∨ (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2)) | |
| 23 | oveq1 6059 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (0 − 1)) | |
| 24 | df-neg 8449 | . . . . . . 7 ⊢ -1 = (0 − 1) | |
| 25 | 17 | simp1i 1033 | . . . . . . 7 ⊢ -1 ∈ 𝑍 |
| 26 | 24, 25 | eqeltrri 2308 | . . . . . 6 ⊢ (0 − 1) ∈ 𝑍 |
| 27 | 23, 26 | eqeltrdi 2325 | . . . . 5 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 28 | oveq1 6059 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (2 − 1)) | |
| 29 | 2m1e1 9357 | . . . . . . 7 ⊢ (2 − 1) = 1 | |
| 30 | 17 | simp3i 1035 | . . . . . . 7 ⊢ 1 ∈ 𝑍 |
| 31 | 29, 30 | eqeltri 2307 | . . . . . 6 ⊢ (2 − 1) ∈ 𝑍 |
| 32 | 28, 31 | eqeltrdi 2325 | . . . . 5 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 33 | 27, 32 | jaoi 724 | . . . 4 ⊢ (((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 ∨ (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 34 | 21, 22, 33 | 3syl 17 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2}) ∧ ¬ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 35 | 34 | 3expa 1230 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ ¬ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 36 | prmnn 12811 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 37 | 1, 36 | syl 14 | . . . . 5 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℕ) |
| 38 | 37 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝑃 ∈ ℕ) |
| 39 | dvdsdc 12488 | . . . 4 ⊢ ((𝑃 ∈ ℕ ∧ 𝐴 ∈ ℤ) → DECID 𝑃 ∥ 𝐴) | |
| 40 | 38, 3, 39 | syl2anc 411 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → DECID 𝑃 ∥ 𝐴) |
| 41 | exmiddc 844 | . . 3 ⊢ (DECID 𝑃 ∥ 𝐴 → (𝑃 ∥ 𝐴 ∨ ¬ 𝑃 ∥ 𝐴)) | |
| 42 | 40, 41 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → (𝑃 ∥ 𝐴 ∨ ¬ 𝑃 ∥ 𝐴)) |
| 43 | 20, 35, 42 | mpjaodan 806 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 DECID wdc 842 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 {crab 2526 ∖ cdif 3210 {csn 3691 {cpr 3692 class class class wbr 4111 ‘cfv 5354 (class class class)co 6052 0cc0 8129 1c1 8130 + caddc 8132 < clt 8310 ≤ cle 8311 − cmin 8446 -cneg 8447 / cdiv 8948 ℕcn 9239 2c2 9290 ℤcz 9579 mod cmo 10688 ↑cexp 10904 abscabs 11686 ∥ cdvds 12477 ℙcprime 12808 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8220 ax-resscn 8221 ax-1cn 8222 ax-1re 8223 ax-icn 8224 ax-addcl 8225 ax-addrcl 8226 ax-mulcl 8227 ax-mulrcl 8228 ax-addcom 8229 ax-mulcom 8230 ax-addass 8231 ax-mulass 8232 ax-distr 8233 ax-i2m1 8234 ax-0lt1 8235 ax-1rid 8236 ax-0id 8237 ax-rnegex 8238 ax-precex 8239 ax-cnre 8240 ax-pre-ltirr 8241 ax-pre-ltwlin 8242 ax-pre-lttrn 8243 ax-pre-apti 8244 ax-pre-ltadd 8245 ax-pre-mulgt0 8246 ax-pre-mulext 8247 ax-arch 8248 ax-caucvg 8249 |
| This theorem depends on definitions: df-bi 117 df-stab 839 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-xor 1421 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-po 4419 df-iso 4420 df-iord 4489 df-on 4491 df-ilim 4492 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-isom 5363 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-recs 6538 df-irdg 6603 df-frec 6624 df-1o 6649 df-2o 6650 df-oadd 6653 df-er 6769 df-en 6978 df-dom 6979 df-fin 6980 df-sup 7277 df-pnf 8312 df-mnf 8313 df-xr 8314 df-ltxr 8315 df-le 8316 df-sub 8448 df-neg 8449 df-reap 8851 df-ap 8858 df-div 8949 df-inn 9240 df-2 9298 df-3 9299 df-4 9300 df-n0 9499 df-z 9580 df-uz 9857 df-q 9955 df-rp 9990 df-fz 10346 df-fzo 10481 df-fl 10634 df-mod 10689 df-seqfrec 10814 df-exp 10905 df-ihash 11143 df-cj 11531 df-re 11532 df-im 11533 df-rsqrt 11687 df-abs 11688 df-clim 11968 df-proddc 12241 df-dvds 12478 df-gcd 12654 df-prm 12809 df-phi 12912 |
| This theorem is referenced by: lgsfcl2 15896 |
| Copyright terms: Public domain | W3C validator |