| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lgslem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for lgsfcl2 27631. (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 4067 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 2 | 1 | adantl 487 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝑃 ∈ ℙ) |
| 3 | simpl 488 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → 𝐴 ∈ ℤ) | |
| 4 | oddprm 16989 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → ((𝑃 − 1) / 2) ∈ ℕ) | |
| 5 | 4 | adantl 487 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) → ((𝑃 − 1) / 2) ∈ ℕ) |
| 6 | prmdvdsexp 16892 | . . . . . . 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 16874 | . . . . . . 7 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃) | |
| 10 | 1, 9 | syl 18 | . . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 1 < 𝑃) |
| 11 | 10 | ad2antlr 740 | . . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → 1 < 𝑃) |
| 12 | p1modz1 16430 | . . . . 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 7435 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (1 − 1)) |
| 15 | 1m1e0 12416 | . . . 4 ⊢ (1 − 1) = 0 | |
| 16 | lgslem2.z | . . . . . 6 ⊢ 𝑍 = {𝑥 ∈ ℤ ∣ (abs‘𝑥) ≤ 1} | |
| 17 | 16 | lgslem2 27626 | . . . . 5 ⊢ ( -1 ∈ 𝑍 ∧ 0 ∈ 𝑍 ∧ 1 ∈ 𝑍) |
| 18 | 17 | simp2i 1158 | . . . 4 ⊢ 0 ∈ 𝑍 |
| 19 | 15, 18 | eqeltri 2856 | . . 3 ⊢ (1 − 1) ∈ 𝑍 |
| 20 | 14, 19 | eqeltrdi 2868 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2})) ∧ 𝑃 ∥ 𝐴) → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 21 | lgslem1 27625 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝑃 ∈ (ℙ ∖ {2}) ∧ ¬ 𝑃 ∥ 𝐴) → (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2}) | |
| 22 | elpri 4607 | . . . 4 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) ∈ {0, 2} → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 ∨ (((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2)) | |
| 23 | oveq1 7427 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (0 − 1)) | |
| 24 | df-neg 11545 | . . . . . . 7 ⊢ -1 = (0 − 1) | |
| 25 | 17 | simp1i 1157 | . . . . . . 7 ⊢ -1 ∈ 𝑍 |
| 26 | 24, 25 | eqeltrri 2857 | . . . . . 6 ⊢ (0 − 1) ∈ 𝑍 |
| 27 | 23, 26 | eqeltrdi 2868 | . . . . 5 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 0 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) ∈ 𝑍) |
| 28 | oveq1 7427 | . . . . . 6 ⊢ ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) = 2 → ((((𝐴↑((𝑃 − 1) / 2)) + 1) mod 𝑃) − 1) = (2 − 1)) | |
| 29 | 2m1e1 12468 | . . . . . . 7 ⊢ (2 − 1) = 1 | |
| 30 | 17 | simp3i 1159 | . . . . . . 7 ⊢ 1 ∈ 𝑍 |
| 31 | 29, 30 | eqeltri 2856 | . . . . . 6 ⊢ (2 − 1) ∈ 𝑍 |
| 32 | 28, 31 | eqeltrdi 2868 | . . . . 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 1569 ∈ wcel 2144 {crab 3412 ∖ cdif 4045 {csn 4583 {cpr 4585 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 0cc0 11201 1c1 11202 + caddc 11204 < clt 11344 ≤ cle 11345 − cmin 11542 -cneg 11543 / cdiv 11974 ℕcn 12336 2c2 12398 ℤcz 12694 mod cmo 14010 ↑cexp 14205 abscabs 15402 ∥ cdvds 16423 ℙcprime 16847 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11257 ax-resscn 11258 ax-1cn 11259 ax-icn 11260 ax-addcl 11261 ax-addrcl 11262 ax-mulcl 11263 ax-mulrcl 11264 ax-mulcom 11265 ax-addass 11266 ax-mulass 11267 ax-distr 11268 ax-i2m1 11269 ax-1ne0 11270 ax-1rid 11271 ax-rnegex 11272 ax-rrecex 11273 ax-cnre 11274 ax-pre-lttri 11275 ax-pre-lttrn 11276 ax-pre-ltadd 11277 ax-pre-mulgt0 11278 ax-pre-sup 11279 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8300 df-wrecs 8331 df-recs 8380 df-rdg 8419 df-1o 8477 df-2o 8478 df-oadd 8481 df-er 8718 df-en 8975 df-dom 8976 df-sdom 8977 df-fin 8978 df-sup 9435 df-inf 9436 df-dju 9983 df-card 10021 df-pnf 11346 df-mnf 11347 df-xr 11348 df-ltxr 11349 df-le 11350 df-sub 11544 df-neg 11545 df-div 11975 df-nn 12337 df-2 12406 df-3 12407 df-n0 12608 df-xnn0 12681 df-z 12695 df-uz 12967 df-rp 13122 df-fz 13641 df-fzo 13790 df-fl 13933 df-mod 14011 df-seq 14146 df-exp 14206 df-hash 14476 df-cj 15267 df-re 15268 df-im 15269 df-sqrt 15403 df-abs 15404 df-dvds 16424 df-gcd 16666 df-prm 16848 df-phi 16944 |
| This theorem is used by: lgsfcl2 27631 |
| Copyright terms: Public domain | W3C validator |