| 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 27193 (see wilthlem3 27192), 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 27193 | . 2 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ 𝑃 ∥ ((!‘(𝑃 − 1)) + 1))) | |
| 2 | eluz2nn 12903 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → 𝑃 ∈ ℕ) | |
| 3 | nnm1nn0 12536 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ0) | |
| 4 | 2, 3 | syl 18 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 − 1) ∈ ℕ0) |
| 5 | 4 | faccld 14311 | . . . . . . 7 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℕ) |
| 6 | 5 | nnzd 12608 | . . . . . 6 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℤ) |
| 7 | 6 | peano2zd 12694 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → ((!‘(𝑃 − 1)) + 1) ∈ ℤ) |
| 8 | dvdsval3 16304 | . . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ ((!‘(𝑃 − 1)) + 1) ∈ ℤ) → (𝑃 ∥ ((!‘(𝑃 − 1)) + 1) ↔ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0)) | |
| 9 | 2, 7, 8 | syl2anc 595 | . . . 4 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 ∥ ((!‘(𝑃 − 1)) + 1) ↔ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0)) |
| 10 | 9 | biimpar 482 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → 𝑃 ∥ ((!‘(𝑃 − 1)) + 1)) |
| 11 | 5 | nncnd 12240 | . . . . . . . . . 10 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℂ) |
| 12 | 1cnd 11190 | . . . . . . . . . 10 ⊢ (𝑃 ∈ (ℤ≥‘2) → 1 ∈ ℂ) | |
| 13 | 11, 12 | jca 520 | . . . . . . . . 9 ⊢ (𝑃 ∈ (ℤ≥‘2) → ((!‘(𝑃 − 1)) ∈ ℂ ∧ 1 ∈ ℂ)) |
| 14 | 13 | adantr 485 | . . . . . . . 8 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → ((!‘(𝑃 − 1)) ∈ ℂ ∧ 1 ∈ ℂ)) |
| 15 | subneg 11495 | . . . . . . . 8 ⊢ (((!‘(𝑃 − 1)) ∈ ℂ ∧ 1 ∈ ℂ) → ((!‘(𝑃 − 1)) − -1) = ((!‘(𝑃 − 1)) + 1)) | |
| 16 | 14, 15 | syl 18 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → ((!‘(𝑃 − 1)) − -1) = ((!‘(𝑃 − 1)) + 1)) |
| 17 | 10, 16 | breqtrrd 5133 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → 𝑃 ∥ ((!‘(𝑃 − 1)) − -1)) |
| 18 | neg1z 12621 | . . . . . . . . . 10 ⊢ -1 ∈ ℤ | |
| 19 | 18 | a1i 11 | . . . . . . . . 9 ⊢ (𝑃 ∈ (ℤ≥‘2) → -1 ∈ ℤ) |
| 20 | 2, 6, 19 | 3jca 1144 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ)) |
| 21 | 20 | adantr 485 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → (𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ)) |
| 22 | moddvds 16311 | . . . . . . 7 ⊢ ((𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ) → (((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃) ↔ 𝑃 ∥ ((!‘(𝑃 − 1)) − -1))) | |
| 23 | 21, 22 | syl 18 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → (((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃) ↔ 𝑃 ∥ ((!‘(𝑃 − 1)) − -1))) |
| 24 | 17, 23 | mpbird 260 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃)) |
| 25 | 24 | ex 417 | . . . 4 ⊢ (𝑃 ∈ (ℤ≥‘2) → ((((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0 → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃))) |
| 26 | 9, 25 | sylbid 243 | . . 3 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 ∥ ((!‘(𝑃 − 1)) + 1) → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃))) |
| 27 | 26 | imp 411 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑃 ∥ ((!‘(𝑃 − 1)) + 1)) → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃)) |
| 28 | 1, 27 | sylbi 220 | 1 ⊢ (𝑃 ∈ ℙ → ((!‘(𝑃 − 1)) mod 𝑃) = (-1 mod 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 class class class wbr 5105 ‘cfv 6525 (class class class)co 7400 ℂcc 11086 0cc0 11088 1c1 11089 + caddc 11091 − cmin 11429 -cneg 11430 ℕcn 12224 2c2 12286 ℕ0cn0 12495 ℤcz 12582 ℤ≥cuz 12853 mod cmo 13893 !cfa 14300 ∥ cdvds 16300 ℙcprime 16719 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 ax-addf 11167 ax-mulf 11168 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-iin 4955 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-se 5606 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-of 7664 df-om 7851 df-1st 7974 df-2nd 7975 df-supp 8145 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-2o 8442 df-oadd 8445 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-fsupp 9310 df-sup 9390 df-inf 9391 df-oi 9460 df-dju 9875 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-3 12295 df-4 12296 df-5 12297 df-6 12298 df-7 12299 df-8 12300 df-9 12301 df-n0 12496 df-xnn0 12569 df-z 12583 df-dec 12703 df-uz 12854 df-rp 13008 df-fz 13527 df-fzo 13674 df-fl 13816 df-mod 13894 df-seq 14029 df-exp 14089 df-fac 14301 df-hash 14358 df-cj 15140 df-re 15141 df-im 15142 df-sqrt 15276 df-abs 15277 df-dvds 16301 df-gcd 16543 df-prm 16720 df-phi 16815 df-struct 17197 df-sets 17214 df-slot 17232 df-ndx 17244 df-base 17260 df-ress 17281 df-plusg 17313 df-mulr 17314 df-starv 17315 df-tset 17319 df-ple 17320 df-ds 17322 df-unif 17323 df-0g 17484 df-gsum 17485 df-mre 17628 df-mrc 17629 df-acs 17631 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-submnd 18832 df-grp 18993 df-minusg 18994 df-mulg 19125 df-subg 19180 df-cntz 19378 df-cmn 19843 df-abl 19844 df-mgp 20208 df-rng 20222 df-ur 20255 df-ring 20308 df-cring 20309 df-subrng 20622 df-subrg 20646 df-cnfld 21483 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |