| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > gausslemma2dlem0c | GIF version | ||
| Description: Auxiliary lemma 3 for gausslemma2d 16310. (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 3351 | . . . . 5 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ ℙ) | |
| 3 | 1, 2 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ ℙ) |
| 4 | gausslemma2dlem0b.h | . . . . . 6 ⊢ 𝐻 = ((𝑃 − 1) / 2) | |
| 5 | 1, 4 | gausslemma2dlem0b 16291 | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ ℕ) |
| 6 | 5 | nnnn0d 9625 | . . . 4 ⊢ (𝜑 → 𝐻 ∈ ℕ0) |
| 7 | 3, 6 | jca 306 | . . 3 ⊢ (𝜑 → (𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0)) |
| 8 | prmnn 12906 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 9 | nnre 9314 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℝ) | |
| 10 | peano2rem 8595 | . . . . . . . 8 ⊢ (𝑃 ∈ ℝ → (𝑃 − 1) ∈ ℝ) | |
| 11 | 9, 10 | syl 14 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℝ) |
| 12 | 2re 9377 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 13 | 12 | a1i 9 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 2 ∈ ℝ) |
| 14 | 13, 9 | remulcld 8357 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (2 · 𝑃) ∈ ℝ) |
| 15 | 9 | ltm1d 9265 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < 𝑃) |
| 16 | nnnn0 9575 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℕ0) | |
| 17 | 16 | nn0ge0d 9628 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 0 ≤ 𝑃) |
| 18 | 1le2 9518 | . . . . . . . . 9 ⊢ 1 ≤ 2 | |
| 19 | 18 | a1i 9 | . . . . . . . 8 ⊢ (𝑃 ∈ ℕ → 1 ≤ 2) |
| 20 | 9, 13, 17, 19 | lemulge12d 9271 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → 𝑃 ≤ (2 · 𝑃)) |
| 21 | 11, 9, 14, 15, 20 | ltletrd 8753 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) < (2 · 𝑃)) |
| 22 | 2pos 9398 | . . . . . . . . 9 ⊢ 0 < 2 | |
| 23 | 12, 22 | pm3.2i 272 | . . . . . . . 8 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
| 24 | 23 | a1i 9 | . . . . . . 7 ⊢ (𝑃 ∈ ℕ → (2 ∈ ℝ ∧ 0 < 2)) |
| 25 | ltdivmul 9209 | . . . . . . 7 ⊢ (((𝑃 − 1) ∈ ℝ ∧ 𝑃 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → (((𝑃 − 1) / 2) < 𝑃 ↔ (𝑃 − 1) < (2 · 𝑃))) | |
| 26 | 11, 9, 24, 25 | syl3anc 1278 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → (((𝑃 − 1) / 2) < 𝑃 ↔ (𝑃 − 1) < (2 · 𝑃))) |
| 27 | 21, 26 | mpbird 167 | . . . . 5 ⊢ (𝑃 ∈ ℕ → ((𝑃 − 1) / 2) < 𝑃) |
| 28 | 1, 2, 8, 27 | 4syl 18 | . . . 4 ⊢ (𝜑 → ((𝑃 − 1) / 2) < 𝑃) |
| 29 | 4, 28 | eqbrtrid 4165 | . . 3 ⊢ (𝜑 → 𝐻 < 𝑃) |
| 30 | prmndvdsfaclt 12953 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐻 ∈ ℕ0) → (𝐻 < 𝑃 → ¬ 𝑃 ∥ (!‘𝐻))) | |
| 31 | 7, 29, 30 | sylc 62 | . 2 ⊢ (𝜑 → ¬ 𝑃 ∥ (!‘𝐻)) |
| 32 | 6 | faccld 11189 | . . . . . 6 ⊢ (𝜑 → (!‘𝐻) ∈ ℕ) |
| 33 | 32 | nnzd 9772 | . . . . 5 ⊢ (𝜑 → (!‘𝐻) ∈ ℤ) |
| 34 | nnz 9668 | . . . . . 6 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℤ) | |
| 35 | 1, 2, 8, 34 | 4syl 18 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℤ) |
| 36 | 33, 35 | gcdcomd 12769 | . . . 4 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = (𝑃 gcd (!‘𝐻))) |
| 37 | 36 | eqeq1d 2247 | . . 3 ⊢ (𝜑 → (((!‘𝐻) gcd 𝑃) = 1 ↔ (𝑃 gcd (!‘𝐻)) = 1)) |
| 38 | coprm 12941 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (!‘𝐻) ∈ ℤ) → (¬ 𝑃 ∥ (!‘𝐻) ↔ (𝑃 gcd (!‘𝐻)) = 1)) | |
| 39 | 3, 33, 38 | syl2anc 415 | . . 3 ⊢ (𝜑 → (¬ 𝑃 ∥ (!‘𝐻) ↔ (𝑃 gcd (!‘𝐻)) = 1)) |
| 40 | 37, 39 | bitr4d 191 | . 2 ⊢ (𝜑 → (((!‘𝐻) gcd 𝑃) = 1 ↔ ¬ 𝑃 ∥ (!‘𝐻))) |
| 41 | 31, 40 | mpbird 167 | 1 ⊢ (𝜑 → ((!‘𝐻) gcd 𝑃) = 1) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∖ cdif 3217 {csn 3709 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 ℝcr 8179 0cc0 8180 1c1 8181 · cmul 8185 < clt 8361 ≤ cle 8362 − cmin 8499 / cdiv 9005 ℕcn 9307 2c2 9358 ℕ0cn0 9568 ℤcz 9649 !cfa 11178 ∥ cdvds 12572 gcd cgcd 12748 ℙcprime 12903 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 ax-arch 8299 ax-caucvg 8300 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-xor 1425 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-1o 6687 df-2o 6688 df-er 6807 df-en 7023 df-sup 7325 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-n0 9569 df-z 9650 df-uz 9932 df-q 10030 df-rp 10066 df-fz 10423 df-fzo 10561 df-fl 10716 df-mod 10774 df-seqfrec 10899 df-exp 10990 df-fac 11179 df-cj 11622 df-re 11623 df-im 11624 df-rsqrt 11779 df-abs 11780 df-dvds 12573 df-gcd 12749 df-prm 12904 |
| This theorem is used by: gausslemma2dlem7 16309 |
| Copyright terms: Public domain | W3C validator |