| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lgslem4 | GIF version | ||
| Description: Lemma for lgsfcl2 15725. (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 3327 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 2 | 1 | adantl 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝑃 ∈ ℙ) |
| 3 | simpl 109 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝐴 ∈ ℤ) | |
| 4 | oddprm 12822 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → ((𝑃 − 1) / 2) ∈ ℕ) | |
| 5 | 4 | adantl 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((𝑃 − 1) / 2) ∈ ℕ) |
| 6 | prmdvdsexp 12710 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℕ) → (𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ↔ 𝑃 ∥ 𝐴)) | |
| 7 | 2, 3, 5, 6 | syl3anc 1271 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → (𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ↔ 𝑃 ∥ 𝐴)) |
| 8 | 7 | biimpar 297 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → 𝑃 ∥ (𝐴↑((𝑃 − 1) / 2))) |
| 9 | prmgt1 12694 | . . . . . . 7 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃) | |
| 10 | 1, 9 | syl 14 | . . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 1 < 𝑃) |
| 11 | 10 | ad2antlr 489 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → 1 < 𝑃) |
| 12 | p1modz1 12345 | . . . . 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 6028 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (1 − 1)) |
| 15 | 1m1e0 9202 | . . . 4 ⊢ (1 − 1) = 0 | |
| 16 | lgslem2.z | . . . . . 6 ⊢ 𝑍 = {𝑥 ∈ ℤ ∣ (abs‘𝑥) ≤ 1} | |
| 17 | 16 | lgslem2 15720 | . . . . 5 ⊢ (-1 ∈ 𝑍 ∧ 0 ∈ 𝑍 ∧ 1 ∈ 𝑍) |
| 18 | 17 | simp2i 1031 | . . . 4 ⊢ 0 ∈ 𝑍 |
| 19 | 15, 18 | eqeltri 2302 | . . 3 ⊢ (1 − 1) ∈ 𝑍 |
| 20 | 14, 19 | eqeltrdi 2320 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 21 | lgslem1 15719 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2}) ∧ ¬ 𝑃 ∥ 𝐴) → (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2}) | |
| 22 | elpri 3690 | . . . 4 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2} → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 ∨ (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2)) | |
| 23 | oveq1 6020 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (0 − 1)) | |
| 24 | df-neg 8343 | . . . . . . 7 ⊢ -1 = (0 − 1) | |
| 25 | 17 | simp1i 1030 | . . . . . . 7 ⊢ -1 ∈ 𝑍 |
| 26 | 24, 25 | eqeltrri 2303 | . . . . . 6 ⊢ (0 − 1) ∈ 𝑍 |
| 27 | 23, 26 | eqeltrdi 2320 | . . . . 5 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 28 | oveq1 6020 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (2 − 1)) | |
| 29 | 2m1e1 9251 | . . . . . . 7 ⊢ (2 − 1) = 1 | |
| 30 | 17 | simp3i 1032 | . . . . . . 7 ⊢ 1 ∈ 𝑍 |
| 31 | 29, 30 | eqeltri 2302 | . . . . . 6 ⊢ (2 − 1) ∈ 𝑍 |
| 32 | 28, 31 | eqeltrdi 2320 | . . . . 5 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 33 | 27, 32 | jaoi 721 | . . . 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 1227 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ ¬ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 36 | prmnn 12672 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 37 | 1, 36 | syl 14 | . . . . 5 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℕ) |
| 38 | 37 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝑃 ∈ ℕ) |
| 39 | dvdsdc 12349 | . . . 4 ⊢ ((𝑃 ∈ ℕ ∧ 𝐴 ∈ ℤ) → DECID 𝑃 ∥ 𝐴) | |
| 40 | 38, 3, 39 | syl2anc 411 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → DECID 𝑃 ∥ 𝐴) |
| 41 | exmiddc 841 | . . 3 ⊢ (DECID 𝑃 ∥ 𝐴 → (𝑃 ∥ 𝐴 ∨ ¬ 𝑃 ∥ 𝐴)) | |
| 42 | 40, 41 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → (𝑃 ∥ 𝐴 ∨ ¬ 𝑃 ∥ 𝐴)) |
| 43 | 20, 35, 42 | mpjaodan 803 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 713 DECID wdc 839 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 {crab 2512 ∖ cdif 3195 {csn 3667 {cpr 3668 class class class wbr 4086 ‘cfv 5324 (class class class)co 6013 0cc0 8022 1c1 8023 + caddc 8025 < clt 8204 ≤ cle 8205 − cmin 8340 -cneg 8341 / cdiv 8842 ℕcn 9133 2c2 9184 ℤcz 9469 mod cmo 10574 ↑cexp 10790 abscabs 11548 ∥ cdvds 12338 ℙcprime 12669 |
| 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 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-mulrcl 8121 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-precex 8132 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 ax-pre-mulgt0 8139 ax-pre-mulext 8140 ax-arch 8141 ax-caucvg 8142 |
| 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 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-isom 5333 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-irdg 6531 df-frec 6552 df-1o 6577 df-2o 6578 df-oadd 6581 df-er 6697 df-en 6905 df-dom 6906 df-fin 6907 df-sup 7174 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-reap 8745 df-ap 8752 df-div 8843 df-inn 9134 df-2 9192 df-3 9193 df-4 9194 df-n0 9393 df-z 9470 df-uz 9746 df-q 9844 df-rp 9879 df-fz 10234 df-fzo 10368 df-fl 10520 df-mod 10575 df-seqfrec 10700 df-exp 10791 df-ihash 11028 df-cj 11393 df-re 11394 df-im 11395 df-rsqrt 11549 df-abs 11550 df-clim 11830 df-proddc 12102 df-dvds 12339 df-gcd 12515 df-prm 12670 df-phi 12773 |
| This theorem is referenced by: lgsfcl2 15725 |
| Copyright terms: Public domain | W3C validator |