| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lgslem4 | GIF version | ||
| Description: Lemma for lgsfcl2 15558. (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 3299 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 2 | 1 | adantl 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝑃 ∈ ℙ) |
| 3 | simpl 109 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝐴 ∈ ℤ) | |
| 4 | oddprm 12657 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → ((𝑃 − 1) / 2) ∈ ℕ) | |
| 5 | 4 | adantl 277 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((𝑃 − 1) / 2) ∈ ℕ) |
| 6 | prmdvdsexp 12545 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℕ) → (𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ↔ 𝑃 ∥ 𝐴)) | |
| 7 | 2, 3, 5, 6 | syl3anc 1250 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → (𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ↔ 𝑃 ∥ 𝐴)) |
| 8 | 7 | biimpar 297 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → 𝑃 ∥ (𝐴↑((𝑃 − 1) / 2))) |
| 9 | prmgt1 12529 | . . . . . . 7 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃) | |
| 10 | 1, 9 | syl 14 | . . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 1 < 𝑃) |
| 11 | 10 | ad2antlr 489 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → 1 < 𝑃) |
| 12 | p1modz1 12180 | . . . . 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 5972 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (1 − 1)) |
| 15 | 1m1e0 9125 | . . . 4 ⊢ (1 − 1) = 0 | |
| 16 | lgslem2.z | . . . . . 6 ⊢ 𝑍 = {𝑥 ∈ ℤ ∣ (abs‘𝑥) ≤ 1} | |
| 17 | 16 | lgslem2 15553 | . . . . 5 ⊢ (-1 ∈ 𝑍 ∧ 0 ∈ 𝑍 ∧ 1 ∈ 𝑍) |
| 18 | 17 | simp2i 1010 | . . . 4 ⊢ 0 ∈ 𝑍 |
| 19 | 15, 18 | eqeltri 2279 | . . 3 ⊢ (1 − 1) ∈ 𝑍 |
| 20 | 14, 19 | eqeltrdi 2297 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 21 | lgslem1 15552 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2}) ∧ ¬ 𝑃 ∥ 𝐴) → (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2}) | |
| 22 | elpri 3661 | . . . 4 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2} → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 ∨ (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2)) | |
| 23 | oveq1 5964 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (0 − 1)) | |
| 24 | df-neg 8266 | . . . . . . 7 ⊢ -1 = (0 − 1) | |
| 25 | 17 | simp1i 1009 | . . . . . . 7 ⊢ -1 ∈ 𝑍 |
| 26 | 24, 25 | eqeltrri 2280 | . . . . . 6 ⊢ (0 − 1) ∈ 𝑍 |
| 27 | 23, 26 | eqeltrdi 2297 | . . . . 5 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 28 | oveq1 5964 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (2 − 1)) | |
| 29 | 2m1e1 9174 | . . . . . . 7 ⊢ (2 − 1) = 1 | |
| 30 | 17 | simp3i 1011 | . . . . . . 7 ⊢ 1 ∈ 𝑍 |
| 31 | 29, 30 | eqeltri 2279 | . . . . . 6 ⊢ (2 − 1) ∈ 𝑍 |
| 32 | 28, 31 | eqeltrdi 2297 | . . . . 5 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 33 | 27, 32 | jaoi 718 | . . . 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 1206 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ ¬ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 36 | prmnn 12507 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 37 | 1, 36 | syl 14 | . . . . 5 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℕ) |
| 38 | 37 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝑃 ∈ ℕ) |
| 39 | dvdsdc 12184 | . . . 4 ⊢ ((𝑃 ∈ ℕ ∧ 𝐴 ∈ ℤ) → DECID 𝑃 ∥ 𝐴) | |
| 40 | 38, 3, 39 | syl2anc 411 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → DECID 𝑃 ∥ 𝐴) |
| 41 | exmiddc 838 | . . 3 ⊢ (DECID 𝑃 ∥ 𝐴 → (𝑃 ∥ 𝐴 ∨ ¬ 𝑃 ∥ 𝐴)) | |
| 42 | 40, 41 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → (𝑃 ∥ 𝐴 ∨ ¬ 𝑃 ∥ 𝐴)) |
| 43 | 20, 35, 42 | mpjaodan 800 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 710 DECID wdc 836 ∧ w3a 981 = wceq 1373 ∈ wcel 2177 {crab 2489 ∖ cdif 3167 {csn 3638 {cpr 3639 class class class wbr 4051 ‘cfv 5280 (class class class)co 5957 0cc0 7945 1c1 7946 + caddc 7948 < clt 8127 ≤ cle 8128 − cmin 8263 -cneg 8264 / cdiv 8765 ℕcn 9056 2c2 9107 ℤcz 9392 mod cmo 10489 ↑cexp 10705 abscabs 11383 ∥ cdvds 12173 ℙcprime 12504 |
| 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 2179 ax-14 2180 ax-ext 2188 ax-coll 4167 ax-sep 4170 ax-nul 4178 ax-pow 4226 ax-pr 4261 ax-un 4488 ax-setind 4593 ax-iinf 4644 ax-cnex 8036 ax-resscn 8037 ax-1cn 8038 ax-1re 8039 ax-icn 8040 ax-addcl 8041 ax-addrcl 8042 ax-mulcl 8043 ax-mulrcl 8044 ax-addcom 8045 ax-mulcom 8046 ax-addass 8047 ax-mulass 8048 ax-distr 8049 ax-i2m1 8050 ax-0lt1 8051 ax-1rid 8052 ax-0id 8053 ax-rnegex 8054 ax-precex 8055 ax-cnre 8056 ax-pre-ltirr 8057 ax-pre-ltwlin 8058 ax-pre-lttrn 8059 ax-pre-apti 8060 ax-pre-ltadd 8061 ax-pre-mulgt0 8062 ax-pre-mulext 8063 ax-arch 8064 ax-caucvg 8065 |
| 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 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-if 3576 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3857 df-int 3892 df-iun 3935 df-br 4052 df-opab 4114 df-mpt 4115 df-tr 4151 df-id 4348 df-po 4351 df-iso 4352 df-iord 4421 df-on 4423 df-ilim 4424 df-suc 4426 df-iom 4647 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-rn 4694 df-res 4695 df-ima 4696 df-iota 5241 df-fun 5282 df-fn 5283 df-f 5284 df-f1 5285 df-fo 5286 df-f1o 5287 df-fv 5288 df-isom 5289 df-riota 5912 df-ov 5960 df-oprab 5961 df-mpo 5962 df-1st 6239 df-2nd 6240 df-recs 6404 df-irdg 6469 df-frec 6490 df-1o 6515 df-2o 6516 df-oadd 6519 df-er 6633 df-en 6841 df-dom 6842 df-fin 6843 df-sup 7101 df-pnf 8129 df-mnf 8130 df-xr 8131 df-ltxr 8132 df-le 8133 df-sub 8265 df-neg 8266 df-reap 8668 df-ap 8675 df-div 8766 df-inn 9057 df-2 9115 df-3 9116 df-4 9117 df-n0 9316 df-z 9393 df-uz 9669 df-q 9761 df-rp 9796 df-fz 10151 df-fzo 10285 df-fl 10435 df-mod 10490 df-seqfrec 10615 df-exp 10706 df-ihash 10943 df-cj 11228 df-re 11229 df-im 11230 df-rsqrt 11384 df-abs 11385 df-clim 11665 df-proddc 11937 df-dvds 12174 df-gcd 12350 df-prm 12505 df-phi 12608 |
| This theorem is referenced by: lgsfcl2 15558 |
| Copyright terms: Public domain | W3C validator |