![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > gausslemma2dlem0c | Structured version Visualization version GIF version |
Description: Auxiliary lemma 3 for gausslemma2d 25958. (Contributed by AV, 13-Jul-2021.) |
Ref | Expression |
---|---|
gausslemma2dlem0a.p | ⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2})) |
gausslemma2dlem0b.h | ⊢ 𝐻 = ((𝑃 − 1) / 2) |
Ref | Expression |
---|---|
gausslemma2dlem0c | ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = 1) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gausslemma2dlem0a.p | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ (ℙ ∖ {2})) | |
2 | eldifi 4054 | . . . . 5 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ ℙ) |
4 | gausslemma2dlem0b.h | . . . . . 6 ⊢ 𝐻 = ((𝑃 − 1) / 2) | |
5 | 1, 4 | gausslemma2dlem0b 25941 | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ ℕ) |
6 | 5 | nnnn0d 11943 | . . . 4 ⊢ (𝜑 → 𝐻 ∈ ℕ0) |
7 | 3, 6 | jca 515 | . . 3 ⊢ (𝜑 → (𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0)) |
8 | prmnn 16008 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
9 | nnre 11632 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℝ) | |
10 | peano2rem 10942 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℝ → (𝑃 − 1) ∈ ℝ) | |
11 | 9, 10 | syl 17 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℝ) |
12 | 2re 11699 | . . . . . . . . . 10 ⊢ 2 ∈ ℝ | |
13 | 12 | a1i 11 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → 2 ∈ ℝ) |
14 | 13, 9 | remulcld 10660 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → (2 · 𝑃) ∈ ℝ) |
15 | 9 | ltm1d 11561 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < 𝑃) |
16 | nnnn0 11892 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℕ0) | |
17 | 16 | nn0ge0d 11946 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → 0 ≤ 𝑃) |
18 | 1le2 11834 | . . . . . . . . . 10 ⊢ 1 ≤ 2 | |
19 | 18 | a1i 11 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → 1 ≤ 2) |
20 | 9, 13, 17, 19 | lemulge12d 11567 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 𝑃 ≤ (2 · 𝑃)) |
21 | 11, 9, 14, 15, 20 | ltletrd 10789 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < (2 · 𝑃)) |
22 | 2pos 11728 | . . . . . . . . . 10 ⊢ 0 < 2 | |
23 | 12, 22 | pm3.2i 474 | . . . . . . . . 9 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
24 | 23 | a1i 11 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → (2 ∈ ℝ ∧ 0 < 2)) |
25 | ltdivmul 11504 | . . . . . . . 8 ⊢ (((𝑃 − 1) ∈ ℝ ∧ 𝑃 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → (((𝑃 − 1) / 2) < 𝑃 ↔ (𝑃 − 1) < (2 · 𝑃))) | |
26 | 11, 9, 24, 25 | syl3anc 1368 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (((𝑃 − 1) / 2) < 𝑃 ↔ (𝑃 − 1) < (2 · 𝑃))) |
27 | 21, 26 | mpbird 260 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → ((𝑃 − 1) / 2) < 𝑃) |
28 | 2, 8, 27 | 3syl 18 | . . . . 5 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → ((𝑃 − 1) / 2) < 𝑃) |
29 | 1, 28 | syl 17 | . . . 4 ⊢ (𝜑 → ((𝑃 − 1) / 2) < 𝑃) |
30 | 4, 29 | eqbrtrid 5065 | . . 3 ⊢ (𝜑 → 𝐻 < 𝑃) |
31 | prmndvdsfaclt 16057 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0) → (𝐻 < 𝑃 → ¬ 𝑃 ∥ (!‘𝐻))) | |
32 | 7, 30, 31 | sylc 65 | . 2 ⊢ (𝜑 → ¬ 𝑃 ∥ (!‘𝐻)) |
33 | 6 | faccld 13640 | . . . . . 6 ⊢ (𝜑 → (!‘𝐻) ∈ ℕ) |
34 | 33 | nnzd 12074 | . . . . 5 ⊢ (𝜑 → (!‘𝐻) ∈ ℤ) |
35 | nnz 11992 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℤ) | |
36 | 2, 8, 35 | 3syl 18 | . . . . . 6 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℤ) |
37 | 1, 36 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℤ) |
38 | gcdcom 15852 | . . . . 5 ⊢ (((!‘𝐻) ∈ ℤ ∧ 𝑃 ∈ ℤ) → ((!‘𝐻) gcd 𝑃) = (𝑃 gcd (!‘𝐻))) | |
39 | 34, 37, 38 | syl2anc 587 | . . . 4 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = (𝑃 gcd (!‘𝐻))) |
40 | 39 | eqeq1d 2800 | . . 3 ⊢ (𝜑 → (((!‘𝐻) gcd 𝑃) = 1 ↔ (𝑃 gcd (!‘𝐻)) = 1)) |
41 | coprm 16045 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (!‘𝐻) ∈ ℤ) → (¬ 𝑃 ∥ (!‘𝐻) ↔ (𝑃 gcd (!‘𝐻)) = 1)) | |
42 | 3, 34, 41 | syl2anc 587 | . . 3 ⊢ (𝜑 → (¬ 𝑃 ∥ (!‘𝐻) ↔ (𝑃 gcd (!‘𝐻)) = 1)) |
43 | 40, 42 | bitr4d 285 | . 2 ⊢ (𝜑 → (((!‘𝐻) gcd 𝑃) = 1 ↔ ¬ 𝑃 ∥ (!‘𝐻))) |
44 | 32, 43 | mpbird 260 | 1 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = 1) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∖ cdif 3878 {csn 4525 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 ℝcr 10525 0cc0 10526 1c1 10527 · cmul 10531 < clt 10664 ≤ cle 10665 − cmin 10859 / cdiv 11286 ℕcn 11625 2c2 11680 ℕ0cn0 11885 ℤcz 11969 !cfa 13629 ∥ cdvds 15599 gcd cgcd 15833 ℙcprime 16005 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-2o 8086 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-fl 13157 df-mod 13233 df-seq 13365 df-exp 13426 df-fac 13630 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-dvds 15600 df-gcd 15834 df-prm 16006 |
This theorem is referenced by: gausslemma2dlem7 25957 |
Copyright terms: Public domain | W3C validator |