| 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 27038 (see wilthlem3 27037), 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 27038 | . 2 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ 𝑃 ∥ ((!‘(𝑃 − 1)) + 1))) | |
| 2 | eluz2nn 12903 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → 𝑃 ∈ ℕ) | |
| 3 | nnm1nn0 12547 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ0) | |
| 4 | 2, 3 | syl 17 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 − 1) ∈ ℕ0) |
| 5 | 4 | faccld 14307 | . . . . . . 7 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℕ) |
| 6 | 5 | nnzd 12620 | . . . . . 6 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℤ) |
| 7 | 6 | peano2zd 12705 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → ((!‘(𝑃 − 1)) + 1) ∈ ℤ) |
| 8 | dvdsval3 16281 | . . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ ((!‘(𝑃 − 1)) + 1) ∈ ℤ) → (𝑃 ∥ ((!‘(𝑃 − 1)) + 1) ↔ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0)) | |
| 9 | 2, 7, 8 | syl2anc 584 | . . . 4 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 ∥ ((!‘(𝑃 − 1)) + 1) ↔ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0)) |
| 10 | 9 | biimpar 477 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → 𝑃 ∥ ((!‘(𝑃 − 1)) + 1)) |
| 11 | 5 | nncnd 12261 | . . . . . . . . . 10 ⊢ (𝑃 ∈ (ℤ≥‘2) → (!‘(𝑃 − 1)) ∈ ℂ) |
| 12 | 1cnd 11235 | . . . . . . . . . 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 11537 | . . . . . . . 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 5152 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → 𝑃 ∥ ((!‘(𝑃 − 1)) − -1)) |
| 18 | neg1z 12633 | . . . . . . . . . 10 ⊢ -1 ∈ ℤ | |
| 19 | 18 | a1i 11 | . . . . . . . . 9 ⊢ (𝑃 ∈ (ℤ≥‘2) → -1 ∈ ℤ) |
| 20 | 2, 6, 19 | 3jca 1128 | . . . . . . . 8 ⊢ (𝑃 ∈ (ℤ≥‘2) → (𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ)) |
| 21 | 20 | adantr 480 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (((!‘(𝑃 − 1)) + 1) mod 𝑃) = 0) → (𝑃 ∈ ℕ ∧ (!‘(𝑃 − 1)) ∈ ℤ ∧ -1 ∈ ℤ)) |
| 22 | moddvds 16288 | . . . . . . 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 1086 = wceq 1540 ∈ wcel 2109 class class class wbr 5124 ‘cfv 6536 (class class class)co 7410 ℂcc 11132 0cc0 11134 1c1 11135 + caddc 11137 − cmin 11471 -cneg 11472 ℕcn 12245 2c2 12300 ℕ0cn0 12506 ℤcz 12593 ℤ≥cuz 12857 mod cmo 13891 !cfa 14296 ∥ cdvds 16277 ℙcprime 16695 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 ax-pre-sup 11212 ax-addf 11213 ax-mulf 11214 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-iin 4975 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 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 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7676 df-om 7867 df-1st 7993 df-2nd 7994 df-supp 8165 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-2o 8486 df-oadd 8489 df-er 8724 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-fsupp 9379 df-sup 9459 df-inf 9460 df-oi 9529 df-dju 9920 df-card 9958 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-div 11900 df-nn 12246 df-2 12308 df-3 12309 df-4 12310 df-5 12311 df-6 12312 df-7 12313 df-8 12314 df-9 12315 df-n0 12507 df-xnn0 12580 df-z 12594 df-dec 12714 df-uz 12858 df-rp 13014 df-fz 13530 df-fzo 13677 df-fl 13814 df-mod 13892 df-seq 14025 df-exp 14085 df-fac 14297 df-hash 14354 df-cj 15123 df-re 15124 df-im 15125 df-sqrt 15259 df-abs 15260 df-dvds 16278 df-gcd 16519 df-prm 16696 df-phi 16790 df-struct 17171 df-sets 17188 df-slot 17206 df-ndx 17218 df-base 17234 df-ress 17257 df-plusg 17289 df-mulr 17290 df-starv 17291 df-tset 17295 df-ple 17296 df-ds 17298 df-unif 17299 df-0g 17460 df-gsum 17461 df-mre 17603 df-mrc 17604 df-acs 17606 df-mgm 18623 df-sgrp 18702 df-mnd 18718 df-submnd 18767 df-grp 18924 df-minusg 18925 df-mulg 19056 df-subg 19111 df-cntz 19305 df-cmn 19768 df-abl 19769 df-mgp 20106 df-rng 20118 df-ur 20147 df-ring 20200 df-cring 20201 df-subrng 20511 df-subrg 20535 df-cnfld 21321 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |