| 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 27353. (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 4085 | . . . . 5 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ ℙ) |
| 4 | gausslemma2dlem0b.h | . . . . . 6 ⊢ 𝐻 = ((𝑃 − 1) / 2) | |
| 5 | 1, 4 | gausslemma2dlem0b 27336 | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ ℕ) |
| 6 | 5 | nnnn0d 12474 | . . . 4 ⊢ (𝜑 → 𝐻 ∈ ℕ0) |
| 7 | 3, 6 | jca 511 | . . 3 ⊢ (𝜑 → (𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0)) |
| 8 | prmnn 16613 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 9 | nnre 12164 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℝ) | |
| 10 | peano2rem 11460 | . . . . . . . 8 ⊢ (𝑃 ∈ ℝ → (𝑃 − 1) ∈ ℝ) | |
| 11 | 9, 10 | syl 17 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℝ) |
| 12 | 2re 12231 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 13 | 12 | a1i 11 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 2 ∈ ℝ) |
| 14 | 13, 9 | remulcld 11174 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (2 · 𝑃) ∈ ℝ) |
| 15 | 9 | ltm1d 12086 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < 𝑃) |
| 16 | nnnn0 12420 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℕ0) | |
| 17 | 16 | nn0ge0d 12477 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 0 ≤ 𝑃) |
| 18 | 1le2 12361 | . . . . . . . . 9 ⊢ 1 ≤ 2 | |
| 19 | 18 | a1i 11 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 1 ≤ 2) |
| 20 | 9, 13, 17, 19 | lemulge12d 12092 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → 𝑃 ≤ (2 · 𝑃)) |
| 21 | 11, 9, 14, 15, 20 | ltletrd 11305 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < (2 · 𝑃)) |
| 22 | 2pos 12260 | . . . . . . . . 9 ⊢ 0 < 2 | |
| 23 | 12, 22 | pm3.2i 470 | . . . . . . . 8 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
| 24 | 23 | a1i 11 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (2 ∈ ℝ ∧ 0 < 2)) |
| 25 | ltdivmul 12029 | . . . . . . 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 5135 | . . 3 ⊢ (𝜑 → 𝐻 < 𝑃) |
| 30 | prmndvdsfaclt 16664 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0) → (𝐻 < 𝑃 → ¬ 𝑃 ∥ (!‘𝐻))) | |
| 31 | 7, 29, 30 | sylc 65 | . 2 ⊢ (𝜑 → ¬ 𝑃 ∥ (!‘𝐻)) |
| 32 | 6 | faccld 14219 | . . . . . 6 ⊢ (𝜑 → (!‘𝐻) ∈ ℕ) |
| 33 | 32 | nnzd 12526 | . . . . 5 ⊢ (𝜑 → (!‘𝐻) ∈ ℤ) |
| 34 | nnz 12521 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℤ) | |
| 35 | 1, 2, 8, 34 | 4syl 19 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℤ) |
| 36 | 33, 35 | gcdcomd 16453 | . . . 4 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = (𝑃 gcd (!‘𝐻))) |
| 37 | 36 | eqeq1d 2739 | . . 3 ⊢ (𝜑 → (((!‘𝐻) gcd 𝑃) = 1 ↔ (𝑃 gcd (!‘𝐻)) = 1)) |
| 38 | coprm 16650 | . . . 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 3900 {csn 4582 class class class wbr 5100 ‘cfv 6500 (class class class)co 7368 ℝcr 11037 0cc0 11038 1c1 11039 · cmul 11043 < clt 11178 ≤ cle 11179 − cmin 11376 / cdiv 11806 ℕcn 12157 2c2 12212 ℕ0cn0 12413 ℤcz 12500 !cfa 14208 ∥ cdvds 16191 gcd cgcd 16433 ℙcprime 16610 |
| 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 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-inf 9358 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-n0 12414 df-z 12501 df-uz 12764 df-rp 12918 df-fl 13724 df-mod 13802 df-seq 13937 df-exp 13997 df-fac 14209 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-dvds 16192 df-gcd 16434 df-prm 16611 |
| This theorem is referenced by: gausslemma2dlem7 27352 |
| Copyright terms: Public domain | W3C validator |