| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pcpre1 | Structured version Visualization version GIF version | ||
| Description: Value of the prime power pre-function at 1. (Contributed by Mario Carneiro, 23-Feb-2014.) (Revised by Mario Carneiro, 26-Apr-2016.) |
| Ref | Expression |
|---|---|
| pclem.1 | ⊢ 𝐴 = {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑁} |
| pclem.2 | ⊢ 𝑆 = sup(𝐴, ℝ, < ) |
| Ref | Expression |
|---|---|
| pcpre1 | ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑆 = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1z 12622 | . . . . . . . . . 10 ⊢ 1 ∈ ℤ | |
| 2 | eleq1 2822 | . . . . . . . . . 10 ⊢ (𝑁 = 1 → (𝑁 ∈ ℤ ↔ 1 ∈ ℤ)) | |
| 3 | 1, 2 | mpbiri 258 | . . . . . . . . 9 ⊢ (𝑁 = 1 → 𝑁 ∈ ℤ) |
| 4 | ax-1ne0 11198 | . . . . . . . . . 10 ⊢ 1 ≠ 0 | |
| 5 | neeq1 2994 | . . . . . . . . . 10 ⊢ (𝑁 = 1 → (𝑁 ≠ 0 ↔ 1 ≠ 0)) | |
| 6 | 4, 5 | mpbiri 258 | . . . . . . . . 9 ⊢ (𝑁 = 1 → 𝑁 ≠ 0) |
| 7 | 3, 6 | jca 511 | . . . . . . . 8 ⊢ (𝑁 = 1 → (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) |
| 8 | pclem.1 | . . . . . . . . 9 ⊢ 𝐴 = {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑁} | |
| 9 | pclem.2 | . . . . . . . . 9 ⊢ 𝑆 = sup(𝐴, ℝ, < ) | |
| 10 | 8, 9 | pcprecl 16859 | . . . . . . . 8 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑆 ∈ ℕ0 ∧ (𝑃↑𝑆) ∥ 𝑁)) |
| 11 | 7, 10 | sylan2 593 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑆 ∈ ℕ0 ∧ (𝑃↑𝑆) ∥ 𝑁)) |
| 12 | 11 | simprd 495 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑃↑𝑆) ∥ 𝑁) |
| 13 | simpr 484 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑁 = 1) | |
| 14 | 12, 13 | breqtrd 5145 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑃↑𝑆) ∥ 1) |
| 15 | eluz2nn 12898 | . . . . . . . . 9 ⊢ (𝑃 ∈ (ℤ≥‘2) → 𝑃 ∈ ℕ) | |
| 16 | 15 | adantr 480 | . . . . . . . 8 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑃 ∈ ℕ) |
| 17 | 11 | simpld 494 | . . . . . . . 8 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑆 ∈ ℕ0) |
| 18 | 16, 17 | nnexpcld 14263 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑃↑𝑆) ∈ ℕ) |
| 19 | 18 | nnzd 12615 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑃↑𝑆) ∈ ℤ) |
| 20 | 1nn 12251 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 21 | dvdsle 16329 | . . . . . 6 ⊢ (((𝑃↑𝑆) ∈ ℤ ∧ 1 ∈ ℕ) → ((𝑃↑𝑆) ∥ 1 → (𝑃↑𝑆) ≤ 1)) | |
| 22 | 19, 20, 21 | sylancl 586 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → ((𝑃↑𝑆) ∥ 1 → (𝑃↑𝑆) ≤ 1)) |
| 23 | 14, 22 | mpd 15 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑃↑𝑆) ≤ 1) |
| 24 | 16 | nncnd 12256 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑃 ∈ ℂ) |
| 25 | 24 | exp0d 14158 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑃↑0) = 1) |
| 26 | 23, 25 | breqtrrd 5147 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑃↑𝑆) ≤ (𝑃↑0)) |
| 27 | 16 | nnred 12255 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑃 ∈ ℝ) |
| 28 | 17 | nn0zd 12614 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑆 ∈ ℤ) |
| 29 | 0zd 12600 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 0 ∈ ℤ) | |
| 30 | eluz2gt1 12936 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → 1 < 𝑃) | |
| 31 | 30 | adantr 480 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 1 < 𝑃) |
| 32 | 27, 28, 29, 31 | leexp2d 14270 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑆 ≤ 0 ↔ (𝑃↑𝑆) ≤ (𝑃↑0))) |
| 33 | 26, 32 | mpbird 257 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑆 ≤ 0) |
| 34 | 10 | simpld 494 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑆 ∈ ℕ0) |
| 35 | 7, 34 | sylan2 593 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑆 ∈ ℕ0) |
| 36 | nn0le0eq0 12529 | . . 3 ⊢ (𝑆 ∈ ℕ0 → (𝑆 ≤ 0 ↔ 𝑆 = 0)) | |
| 37 | 35, 36 | syl 17 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → (𝑆 ≤ 0 ↔ 𝑆 = 0)) |
| 38 | 33, 37 | mpbid 232 | 1 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ 𝑁 = 1) → 𝑆 = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ≠ wne 2932 {crab 3415 class class class wbr 5119 ‘cfv 6531 (class class class)co 7405 supcsup 9452 ℝcr 11128 0cc0 11129 1c1 11130 < clt 11269 ≤ cle 11270 ℕcn 12240 2c2 12295 ℕ0cn0 12501 ℤcz 12588 ℤ≥cuz 12852 ↑cexp 14079 ∥ cdvds 16272 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-er 8719 df-en 8960 df-dom 8961 df-sdom 8962 df-sup 9454 df-inf 9455 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-3 12304 df-n0 12502 df-z 12589 df-uz 12853 df-rp 13009 df-fl 13809 df-seq 14020 df-exp 14080 df-cj 15118 df-re 15119 df-im 15120 df-sqrt 15254 df-abs 15255 df-dvds 16273 |
| This theorem is referenced by: pczpre 16867 pc1 16875 |
| Copyright terms: Public domain | W3C validator |