| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lgslem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for lgsfcl2 27623. (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 4078 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 2 | 1 | adantl 487 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝑃 ∈ ℙ) |
| 3 | simpl 488 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝐴 ∈ ℤ) | |
| 4 | oddprm 16981 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → ((𝑃 − 1) / 2) ∈ ℕ) | |
| 5 | 4 | adantl 487 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((𝑃 − 1) / 2) ∈ ℕ) |
| 6 | prmdvdsexp 16884 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ ∧ ((𝑃 − 1) / 2) ∈ ℕ) → (𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ↔ 𝑃 ∥ 𝐴)) | |
| 7 | 2, 3, 5, 6 | syl3anc 1398 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → (𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ↔ 𝑃 ∥ 𝐴)) |
| 8 | 7 | biimpar 483 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → 𝑃 ∥ (𝐴↑((𝑃 − 1) / 2))) |
| 9 | prmgt1 16866 | . . . . . . 7 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃) | |
| 10 | 1, 9 | syl 18 | . . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 1 < 𝑃) |
| 11 | 10 | ad2antlr 740 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → 1 < 𝑃) |
| 12 | p1modz1 16422 | . . . . 5 ⊢ ((𝑃 ∥ (𝐴↑((𝑃 − 1) / 2)) ∧ 1 < 𝑃) → (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 1) | |
| 13 | 8, 11, 12 | syl2anc 596 | . . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 1) |
| 14 | 13 | oveq1d 7433 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (1 − 1)) |
| 15 | 1m1e0 12408 | . . . 4 ⊢ (1 − 1) = 0 | |
| 16 | lgslem2.z | . . . . . 6 ⊢ 𝑍 = {𝑥 ∈ ℤ ∣ (abs‘𝑥) ≤ 1} | |
| 17 | 16 | lgslem2 27618 | . . . . 5 ⊢ (-1 ∈ 𝑍 ∧ 0 ∈ 𝑍 ∧ 1 ∈ 𝑍) |
| 18 | 17 | simp2i 1158 | . . . 4 ⊢ 0 ∈ 𝑍 |
| 19 | 15, 18 | eqeltri 2857 | . . 3 ⊢ (1 − 1) ∈ 𝑍 |
| 20 | 14, 19 | eqeltrdi 2869 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 21 | lgslem1 27617 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2}) ∧ ¬ 𝑃 ∥ 𝐴) → (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2}) | |
| 22 | elpri 4608 | . . . 4 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2} → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 ∨ (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2)) | |
| 23 | oveq1 7425 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (0 − 1)) | |
| 24 | df-neg 11537 | . . . . . . 7 ⊢ -1 = (0 − 1) | |
| 25 | 17 | simp1i 1157 | . . . . . . 7 ⊢ -1 ∈ 𝑍 |
| 26 | 24, 25 | eqeltrri 2858 | . . . . . 6 ⊢ (0 − 1) ∈ 𝑍 |
| 27 | 23, 26 | eqeltrdi 2869 | . . . . 5 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 28 | oveq1 7425 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (2 − 1)) | |
| 29 | 2m1e1 12460 | . . . . . . 7 ⊢ (2 − 1) = 1 | |
| 30 | 17 | simp3i 1159 | . . . . . . 7 ⊢ 1 ∈ 𝑍 |
| 31 | 29, 30 | eqeltri 2857 | . . . . . 6 ⊢ (2 − 1) ∈ 𝑍 |
| 32 | 28, 31 | eqeltrdi 2869 | . . . . 5 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 33 | 27, 32 | jaoi 871 | . . . 4 ⊢ (((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 ∨ (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 34 | 21, 22, 33 | 3syl 19 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2}) ∧ ¬ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 35 | 34 | 3expa 1136 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ ¬ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 36 | 20, 35 | pm2.61dan 825 | 1 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 {crab 3413 ∖ cdif 3896 {csn 4584 {cpr 4586 class class class wbr 5103 ‘cfv 6537 (class class class)co 7418 0cc0 11193 1c1 11194 + caddc 11196 < clt 11336 ≤ cle 11337 − cmin 11534 -cneg 11535 / cdiv 11966 ℕcn 12328 2c2 12390 ℤcz 12686 mod cmo 14002 ↑cexp 14197 abscabs 15394 ∥ cdvds 16415 ℙcprime 16839 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-pre-sup 11271 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-2o 8470 df-oadd 8473 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-sup 9427 df-inf 9428 df-dju 9975 df-card 10013 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-div 11967 df-nn 12329 df-2 12398 df-3 12399 df-n0 12600 df-xnn0 12673 df-z 12687 df-uz 12959 df-rp 13114 df-fz 13633 df-fzo 13782 df-fl 13925 df-mod 14003 df-seq 14138 df-exp 14198 df-hash 14468 df-cj 15259 df-re 15260 df-im 15261 df-sqrt 15395 df-abs 15396 df-dvds 16416 df-gcd 16658 df-prm 16840 df-phi 16936 |
| This theorem is used by: lgsfcl2 27623 |
| Copyright terms: Public domain | W3C validator |