| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wilthimp | Structured version Visualization version GIF version | ||
| Description: The forward implication of Wilson's theorem wilth 27034 (see wilthlem3 27033), expressed using the modulo operation: For any prime 𝑝 we have (𝑝 − 1)!≡ − 1 (mod 𝑝), see theorem 5.24 in [ApostolNT] p. 116. (Contributed by AV, 21-Jul-2021.) |
| Ref | Expression |
|---|---|
| wilthimp | ⊢ (𝑃 ∈ ℙ → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wilth 27034 | . 2 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ 𝑃 ∥ ((!‘(𝑃 − 1)) + 1))) | |
| 2 | eluz2nn 12838 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → 𝑃 ∈ ℕ) | |
| 3 | nnm1nn0 12478 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ0) | |
| 4 | 2, 3 | syl 17 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 − 1) ∈ ℕ0) |
| 5 | 4 | faccld 14246 | . . . . . . 7 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℕ) |
| 6 | 5 | nnzd 12550 | . . . . . 6 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℤ) |
| 7 | 6 | peano2zd 12636 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → ((!‘(𝑃 − 1)) + 1) ∈ ℤ) |
| 8 | dvdsval3 16225 | . . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ ((!‘(𝑃 − 1)) + 1) ∈ ℤ) → (𝑃 ∥ ((!‘(𝑃 − 1)) + 1) ↔ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0)) | |
| 9 | 2, 7, 8 | syl2anc 585 | . . . 4 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 ∥ ((!‘(𝑃 − 1)) + 1) ↔ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0)) |
| 10 | 9 | biimpar 477 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → 𝑃 ∥ ((!‘(𝑃 − 1)) + 1)) |
| 11 | 5 | nncnd 12190 | . . . . . . . . . 10 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℂ) |
| 12 | 1cnd 11139 | . . . . . . . . . 10 ⊢ (𝑃 ∈ (ℤ≥‘2) → 1 ∈ ℂ) | |
| 13 | 11, 12 | jca 511 | . . . . . . . . 9 ⊢ (𝑃 ∈ (ℤ≥‘2) → ((!‘(𝑃 − 1)) ∈ ℂ ∧ 1 ∈ ℂ)) |
| 14 | 13 | adantr 480 | . . . . . . . 8 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → ((!‘(𝑃 − 1)) ∈ ℂ ∧ 1 ∈ ℂ)) |
| 15 | subneg 11443 | . . . . . . . 8 ⊢ (((!‘(𝑃 − 1)) ∈ ℂ ∧ 1 ∈ ℂ) → ((!‘(𝑃 − 1)) − -1) = ((!‘(𝑃 − 1)) + 1)) | |
| 16 | 14, 15 | syl 17 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → ((!‘(𝑃 − 1)) − -1) = ((!‘(𝑃 − 1)) + 1)) |
| 17 | 10, 16 | breqtrrd 5114 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → 𝑃 ∥ ((!‘(𝑃 − 1)) − -1)) |
| 18 | neg1z 12563 | . . . . . . . . . 10 ⊢ -1 ∈ ℤ | |
| 19 | 18 | a1i 11 | . . . . . . . . 9 ⊢ (𝑃 ∈ (ℤ≥‘2) → -1 ∈ ℤ) |
| 20 | 2, 6, 19 | 3jca 1129 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ)) |
| 21 | 20 | adantr 480 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → (𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ)) |
| 22 | moddvds 16232 | . . . . . . 7 ⊢ ((𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ) → (((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃) ↔ 𝑃 ∥ ((!‘(𝑃 − 1)) − -1))) | |
| 23 | 21, 22 | syl 17 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → (((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃) ↔ 𝑃 ∥ ((!‘(𝑃 − 1)) − -1))) |
| 24 | 17, 23 | mpbird 257 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃)) |
| 25 | 24 | ex 412 | . . . 4 ⊢ (𝑃 ∈ (ℤ≥‘2) → ((((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0 → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃))) |
| 26 | 9, 25 | sylbid 240 | . . 3 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 ∥ ((!‘(𝑃 − 1)) + 1) → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃))) |
| 27 | 26 | imp 406 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑃 ∥ ((!‘(𝑃 − 1)) + 1)) → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃)) |
| 28 | 1, 27 | sylbi 217 | 1 ⊢ (𝑃 ∈ ℙ → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6499 (class class class)co 7367 ℂcc 11036 0cc0 11038 1c1 11039 + caddc 11041 − cmin 11377 -cneg 11378 ℕcn 12174 2c2 12236 ℕ0cn0 12437 ℤcz 12524 ℤ≥cuz 12788 mod cmo 13828 !cfa 14235 ∥ cdvds 16221 ℙcprime 16640 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 ax-addf 11117 ax-mulf 11118 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6266 df-ord 6327 df-on 6328 df-lim 6329 df-suc 6330 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-of 7631 df-om 7818 df-1st 7942 df-2nd 7943 df-supp 8111 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-2o 8406 df-oadd 8409 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-fsupp 9275 df-sup 9355 df-inf 9356 df-oi 9425 df-dju 9825 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-xnn0 12511 df-z 12525 df-dec 12645 df-uz 12789 df-rp 12943 df-fz 13462 df-fzo 13609 df-fl 13751 df-mod 13829 df-seq 13964 df-exp 14024 df-fac 14236 df-hash 14293 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-dvds 16222 df-gcd 16464 df-prm 16641 df-phi 16736 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-starv 17235 df-tset 17239 df-ple 17240 df-ds 17242 df-unif 17243 df-0g 17404 df-gsum 17405 df-mre 17548 df-mrc 17549 df-acs 17551 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-submnd 18752 df-grp 18912 df-minusg 18913 df-mulg 19044 df-subg 19099 df-cntz 19292 df-cmn 19757 df-abl 19758 df-mgp 20122 df-rng 20134 df-ur 20163 df-ring 20216 df-cring 20217 df-subrng 20523 df-subrg 20547 df-cnfld 21353 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |