| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pc0 | Structured version Visualization version GIF version | ||
| Description: The value of the prime power function at zero. (Contributed by Mario Carneiro, 3-Oct-2014.) |
| Ref | Expression |
|---|---|
| pc0 | ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 0) = +∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0z 12744 | . . 3 ⊢ 0 ∈ ℤ | |
| 2 | zq 13121 | . . 3 ⊢ (0 ∈ ℤ → 0 ∈ ℚ) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ 0 ∈ ℚ |
| 4 | iftrue 4491 | . . . 4 ⊢ (𝑟 = 0 → if(𝑟 = 0, +∞, (℩𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑟 = (𝑥 / 𝑦) ∧ 𝑧 = (sup({𝑛 ∈ ℕ0 ∣ (𝑝↑𝑛) ∥ 𝑥}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑝↑𝑛) ∥ 𝑦}, ℝ, < ))))) = +∞) | |
| 5 | 4 | adantl 487 | . . 3 ⊢ ((𝑝 = 𝑃 ∧ 𝑟 = 0) → if(𝑟 = 0, +∞, (℩𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑟 = (𝑥 / 𝑦) ∧ 𝑧 = (sup({𝑛 ∈ ℕ0 ∣ (𝑝↑𝑛) ∥ 𝑥}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑝↑𝑛) ∥ 𝑦}, ℝ, < ))))) = +∞) |
| 6 | df-pc 17059 | . . 3 ⊢ pCnt = (𝑝 ∈ ℙ, 𝑟 ∈ ℚ ↦ if(𝑟 = 0, +∞, (℩𝑧∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ (𝑟 = (𝑥 / 𝑦) ∧ 𝑧 = (sup({𝑛 ∈ ℕ0 ∣ (𝑝↑𝑛) ∥ 𝑥}, ℝ, < ) − sup({𝑛 ∈ ℕ0 ∣ (𝑝↑𝑛) ∥ 𝑦}, ℝ, < )))))) | |
| 7 | pnfex 11401 | . . 3 ⊢ +∞ ∈ V | |
| 8 | 5, 6, 7 | ovmpoa 7607 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 0 ∈ ℚ) → (𝑃 pCnt 0) = +∞) |
| 9 | 3, 8 | mpan2 704 | 1 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 0) = +∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 {crab 3416 ifcif 4485 class class class wbr 5108 ℩cio 6518 (class class class)co 7451 supcsup 9469 ℝcr 11238 0cc0 11239 +∞cpnf 11379 < clt 11382 − cmin 11580 / cdiv 12013 ℕcn 12375 ℕ0cn0 12646 ℤcz 12733 ℚcq 13115 ↑cexp 14244 ∥ cdvds 16466 ℙcprime 16890 pCnt cpc 17058 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-z 12734 df-q 13116 df-pc 17059 |
| This theorem is used by: pcxnn0cl 17082 pcxcl 17083 pcge0 17084 pcdvdsb 17091 pcgcd1 17099 pc2dvds 17101 pcaddlem 17110 pcadd 17111 |
| Copyright terms: Public domain | W3C validator |