| 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 27351. (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 4072 | . . . . 5 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ ℙ) |
| 4 | gausslemma2dlem0b.h | . . . . . 6 ⊢ 𝐻 = ((𝑃 − 1) / 2) | |
| 5 | 1, 4 | gausslemma2dlem0b 27334 | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ ℕ) |
| 6 | 5 | nnnn0d 12489 | . . . 4 ⊢ (𝜑 → 𝐻 ∈ ℕ0) |
| 7 | 3, 6 | jca 511 | . . 3 ⊢ (𝜑 → (𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0)) |
| 8 | prmnn 16634 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 9 | nnre 12172 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℝ) | |
| 10 | peano2rem 11452 | . . . . . . . 8 ⊢ (𝑃 ∈ ℝ → (𝑃 − 1) ∈ ℝ) | |
| 11 | 9, 10 | syl 17 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℝ) |
| 12 | 2re 12246 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 13 | 12 | a1i 11 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 2 ∈ ℝ) |
| 14 | 13, 9 | remulcld 11166 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (2 · 𝑃) ∈ ℝ) |
| 15 | 9 | ltm1d 12079 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < 𝑃) |
| 16 | nnnn0 12435 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℕ0) | |
| 17 | 16 | nn0ge0d 12492 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 0 ≤ 𝑃) |
| 18 | 1le2 12376 | . . . . . . . . 9 ⊢ 1 ≤ 2 | |
| 19 | 18 | a1i 11 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 1 ≤ 2) |
| 20 | 9, 13, 17, 19 | lemulge12d 12085 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → 𝑃 ≤ (2 · 𝑃)) |
| 21 | 11, 9, 14, 15, 20 | ltletrd 11297 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < (2 · 𝑃)) |
| 22 | 2pos 12275 | . . . . . . . . 9 ⊢ 0 < 2 | |
| 23 | 12, 22 | pm3.2i 470 | . . . . . . . 8 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
| 24 | 23 | a1i 11 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (2 ∈ ℝ ∧ 0 < 2)) |
| 25 | ltdivmul 12022 | . . . . . . 7 ⊢ (((𝑃 − 1) ∈ ℝ ∧ 𝑃 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → (((𝑃 − 1) / 2) < 𝑃 ↔ (𝑃 − 1) < (2 · 𝑃))) | |
| 26 | 11, 9, 24, 25 | syl3anc 1374 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → (((𝑃 − 1) / 2) < 𝑃 ↔ (𝑃 − 1) < (2 · 𝑃))) |
| 27 | 21, 26 | mpbird 257 | . . . . 5 ⊢ (𝑃 ∈ ℕ → ((𝑃 − 1) / 2) < 𝑃) |
| 28 | 1, 2, 8, 27 | 4syl 19 | . . . 4 ⊢ (𝜑 → ((𝑃 − 1) / 2) < 𝑃) |
| 29 | 4, 28 | eqbrtrid 5121 | . . 3 ⊢ (𝜑 → 𝐻 < 𝑃) |
| 30 | prmndvdsfaclt 16686 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0) → (𝐻 < 𝑃 → ¬ 𝑃 ∥ (!‘𝐻))) | |
| 31 | 7, 29, 30 | sylc 65 | . 2 ⊢ (𝜑 → ¬ 𝑃 ∥ (!‘𝐻)) |
| 32 | 6 | faccld 14237 | . . . . . 6 ⊢ (𝜑 → (!‘𝐻) ∈ ℕ) |
| 33 | 32 | nnzd 12541 | . . . . 5 ⊢ (𝜑 → (!‘𝐻) ∈ ℤ) |
| 34 | nnz 12536 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℤ) | |
| 35 | 1, 2, 8, 34 | 4syl 19 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℤ) |
| 36 | 33, 35 | gcdcomd 16474 | . . . 4 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = (𝑃 gcd (!‘𝐻))) |
| 37 | 36 | eqeq1d 2739 | . . 3 ⊢ (𝜑 → (((!‘𝐻) gcd 𝑃) = 1 ↔ (𝑃 gcd (!‘𝐻)) = 1)) |
| 38 | coprm 16672 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (!‘𝐻) ∈ ℤ) → (¬ 𝑃 ∥ (!‘𝐻) ↔ (𝑃 gcd (!‘𝐻)) = 1)) | |
| 39 | 3, 33, 38 | syl2anc 585 | . . 3 ⊢ (𝜑 → (¬ 𝑃 ∥ (!‘𝐻) ↔ (𝑃 gcd (!‘𝐻)) = 1)) |
| 40 | 37, 39 | bitr4d 282 | . 2 ⊢ (𝜑 → (((!‘𝐻) gcd 𝑃) = 1 ↔ ¬ 𝑃 ∥ (!‘𝐻))) |
| 41 | 31, 40 | mpbird 257 | 1 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = 1) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∖ cdif 3887 {csn 4568 class class class wbr 5086 ‘cfv 6492 (class class class)co 7360 ℝcr 11028 0cc0 11029 1c1 11030 · cmul 11034 < clt 11170 ≤ cle 11171 − cmin 11368 / cdiv 11798 ℕcn 12165 2c2 12227 ℕ0cn0 12428 ℤcz 12515 !cfa 14226 ∥ cdvds 16212 gcd cgcd 16454 ℙcprime 16631 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-2o 8399 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-sup 9348 df-inf 9349 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-fl 13742 df-mod 13820 df-seq 13955 df-exp 14015 df-fac 14227 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-dvds 16213 df-gcd 16455 df-prm 16632 |
| This theorem is referenced by: gausslemma2dlem7 27350 |
| Copyright terms: Public domain | W3C validator |