| 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 27358. (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 4063 | . . . . 5 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ ℙ) |
| 4 | gausslemma2dlem0b.h | . . . . . 6 ⊢ 𝐻 = ((𝑃 − 1) / 2) | |
| 5 | 1, 4 | gausslemma2dlem0b 27341 | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ ℕ) |
| 6 | 5 | nnnn0d 12493 | . . . 4 ⊢ (𝜑 → 𝐻 ∈ ℕ0) |
| 7 | 3, 6 | jca 517 | . . 3 ⊢ (𝜑 → (𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0)) |
| 8 | prmnn 16638 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 9 | nnre 12176 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℝ) | |
| 10 | peano2rem 11457 | . . . . . . . 8 ⊢ (𝑃 ∈ ℝ → (𝑃 − 1) ∈ ℝ) | |
| 11 | 9, 10 | syl 17 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℝ) |
| 12 | 2re 12250 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 13 | 12 | a1i 11 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 2 ∈ ℝ) |
| 14 | 13, 9 | remulcld 11171 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (2 · 𝑃) ∈ ℝ) |
| 15 | 9 | ltm1d 12083 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < 𝑃) |
| 16 | nnnn0 12439 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℕ0) | |
| 17 | 16 | nn0ge0d 12496 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 0 ≤ 𝑃) |
| 18 | 1le2 12380 | . . . . . . . . 9 ⊢ 1 ≤ 2 | |
| 19 | 18 | a1i 11 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 1 ≤ 2) |
| 20 | 9, 13, 17, 19 | lemulge12d 12089 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → 𝑃 ≤ (2 · 𝑃)) |
| 21 | 11, 9, 14, 15, 20 | ltletrd 11302 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < (2 · 𝑃)) |
| 22 | 2pos 12279 | . . . . . . . . 9 ⊢ 0 < 2 | |
| 23 | 12, 22 | pm3.2i 472 | . . . . . . . 8 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
| 24 | 23 | a1i 11 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (2 ∈ ℝ ∧ 0 < 2)) |
| 25 | ltdivmul 12026 | . . . . . . 7 ⊢ (((𝑃 − 1) ∈ ℝ ∧ 𝑃 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → (((𝑃 − 1) / 2) < 𝑃 ↔ (𝑃 − 1) < (2 · 𝑃))) | |
| 26 | 11, 9, 24, 25 | syl3anc 1380 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → (((𝑃 − 1) / 2) < 𝑃 ↔ (𝑃 − 1) < (2 · 𝑃))) |
| 27 | 21, 26 | mpbird 259 | . . . . 5 ⊢ (𝑃 ∈ ℕ → ((𝑃 − 1) / 2) < 𝑃) |
| 28 | 1, 2, 8, 27 | 4syl 19 | . . . 4 ⊢ (𝜑 → ((𝑃 − 1) / 2) < 𝑃) |
| 29 | 4, 28 | eqbrtrid 5109 | . . 3 ⊢ (𝜑 → 𝐻 < 𝑃) |
| 30 | prmndvdsfaclt 16690 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0) → (𝐻 < 𝑃 → ¬ 𝑃 ∥ (!‘𝐻))) | |
| 31 | 7, 29, 30 | sylc 65 | . 2 ⊢ (𝜑 → ¬ 𝑃 ∥ (!‘𝐻)) |
| 32 | 6 | faccld 14241 | . . . . . 6 ⊢ (𝜑 → (!‘𝐻) ∈ ℕ) |
| 33 | 32 | nnzd 12545 | . . . . 5 ⊢ (𝜑 → (!‘𝐻) ∈ ℤ) |
| 34 | nnz 12540 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℤ) | |
| 35 | 1, 2, 8, 34 | 4syl 19 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℤ) |
| 36 | 33, 35 | gcdcomd 16478 | . . . 4 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = (𝑃 gcd (!‘𝐻))) |
| 37 | 36 | eqeq1d 2743 | . . 3 ⊢ (𝜑 → (((!‘𝐻) gcd 𝑃) = 1 ↔ (𝑃 gcd (!‘𝐻)) = 1)) |
| 38 | coprm 16676 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (!‘𝐻) ∈ ℤ) → (¬ 𝑃 ∥ (!‘𝐻) ↔ (𝑃 gcd (!‘𝐻)) = 1)) | |
| 39 | 3, 33, 38 | syl2anc 591 | . . 3 ⊢ (𝜑 → (¬ 𝑃 ∥ (!‘𝐻) ↔ (𝑃 gcd (!‘𝐻)) = 1)) |
| 40 | 37, 39 | bitr4d 284 | . 2 ⊢ (𝜑 → (((!‘𝐻) gcd 𝑃) = 1 ↔ ¬ 𝑃 ∥ (!‘𝐻))) |
| 41 | 31, 40 | mpbird 259 | 1 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = 1) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ∖ cdif 3881 {csn 4557 class class class wbr 5074 ‘cfv 6488 (class class class)co 7359 ℝcr 11033 0cc0 11034 1c1 11035 · cmul 11039 < clt 11175 ≤ cle 11176 − cmin 11373 / cdiv 11803 ℕcn 12169 2c2 12231 ℕ0cn0 12432 ℤcz 12519 !cfa 14230 ∥ cdvds 16216 gcd cgcd 16458 ℙcprime 16635 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111 ax-pre-sup 11112 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-1o 8399 df-2o 8400 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-inf 9350 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-div 11804 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-n0 12433 df-z 12520 df-uz 12784 df-rp 12938 df-fl 13746 df-mod 13824 df-seq 13959 df-exp 14019 df-fac 14231 df-cj 15056 df-re 15057 df-im 15058 df-sqrt 15192 df-abs 15193 df-dvds 16217 df-gcd 16459 df-prm 16636 |
| This theorem is referenced by: gausslemma2dlem7 27357 |
| Copyright terms: Public domain | W3C validator |