| 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 27246 (see wilthlem3 27245), 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 27246 | . 2 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ 𝑃 ∥ ((!‘(𝑃 − 1)) + 1))) | |
| 2 | eluz2nn 12918 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → 𝑃 ∈ ℕ) | |
| 3 | nnm1nn0 12551 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ0) | |
| 4 | 2, 3 | syl 18 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 − 1) ∈ ℕ0) |
| 5 | 4 | faccld 14327 | . . . . . . 7 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℕ) |
| 6 | 5 | nnzd 12623 | . . . . . 6 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℤ) |
| 7 | 6 | peano2zd 12709 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → ((!‘(𝑃 − 1)) + 1) ∈ ℤ) |
| 8 | dvdsval3 16320 | . . . . 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 12255 | . . . . . . . . . 10 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℂ) |
| 12 | 1cnd 11208 | . . . . . . . . . 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 11513 | . . . . . . . 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 5138 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → 𝑃 ∥ ((!‘(𝑃 − 1)) − -1)) |
| 18 | neg1z 12636 | . . . . . . . . . 10 ⊢ -1 ∈ ℤ | |
| 19 | 18 | a1i 11 | . . . . . . . . 9 ⊢ (𝑃 ∈ (ℤ≥‘2) → -1 ∈ ℤ) |
| 20 | 2, 6, 19 | 3jca 1145 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ)) |
| 21 | 20 | adantr 485 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → (𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ)) |
| 22 | moddvds 16327 | . . . . . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 ℂcc 11104 0cc0 11106 1c1 11107 + caddc 11109 − cmin 11447 -cneg 11448 ℕcn 12239 2c2 12301 ℕ0cn0 12510 ℤcz 12597 ℤ≥cuz 12868 mod cmo 13909 !cfa 14316 ∥ cdvds 16316 ℙcprime 16735 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 ax-addf 11185 ax-mulf 11186 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-iin 4958 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-se 5614 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7676 df-om 7861 df-1st 7984 df-2nd 7985 df-supp 8155 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-2o 8452 df-oadd 8455 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9320 df-sup 9400 df-inf 9401 df-oi 9470 df-dju 9894 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-4 12311 df-5 12312 df-6 12313 df-7 12314 df-8 12315 df-9 12316 df-n0 12511 df-xnn0 12584 df-z 12598 df-dec 12718 df-uz 12869 df-rp 13023 df-fz 13542 df-fzo 13690 df-fl 13832 df-mod 13910 df-seq 14045 df-exp 14105 df-fac 14317 df-hash 14374 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-dvds 16317 df-gcd 16559 df-prm 16736 df-phi 16831 df-struct 17213 df-sets 17230 df-slot 17248 df-ndx 17260 df-base 17276 df-ress 17297 df-plusg 17329 df-mulr 17330 df-starv 17331 df-tset 17335 df-ple 17336 df-ds 17338 df-unif 17339 df-0g 17500 df-gsum 17501 df-mre 17644 df-mrc 17645 df-acs 17647 df-mgm 18704 df-sgrp 18783 df-mnd 18799 df-submnd 18848 df-grp 19009 df-minusg 19010 df-mulg 19140 df-subg 19195 df-cntz 19393 df-cmn 19858 df-abl 19859 df-mgp 20223 df-rng 20237 df-ur 20270 df-ring 20323 df-cring 20324 df-subrng 20656 df-subrg 20680 df-cnfld 21534 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |