| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > pcidlem | GIF version | ||
| Description: The prime count of a prime power. (Contributed by Mario Carneiro, 12-Mar-2014.) |
| Ref | Expression |
|---|---|
| pcidlem | ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝑃 ∈ ℙ) | |
| 2 | prmnn 12807 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 3 | 1, 2 | syl 14 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝑃 ∈ ℕ) |
| 4 | simpr 110 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ∈ ℕ0) | |
| 5 | 3, 4 | nnexpcld 11057 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑𝐴) ∈ ℕ) |
| 6 | 1, 5 | pccld 12998 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ∈ ℕ0) |
| 7 | 6 | nn0red 9554 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ∈ ℝ) |
| 8 | 7 | leidd 8788 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ≤ (𝑃 pCnt (𝑃↑𝐴))) |
| 9 | 5 | nnzd 9699 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑𝐴) ∈ ℤ) |
| 10 | pcdvdsb 13018 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃↑𝐴) ∈ ℤ ∧ (𝑃 pCnt (𝑃↑𝐴)) ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴))) | |
| 11 | 1, 9, 6, 10 | syl3anc 1274 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴))) |
| 12 | 8, 11 | mpbid 147 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴)) |
| 13 | 3, 6 | nnexpcld 11057 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∈ ℕ) |
| 14 | 13 | nnzd 9699 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∈ ℤ) |
| 15 | dvdsle 12530 | . . . . 5 ⊢ (((𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∈ ℤ ∧ (𝑃↑𝐴) ∈ ℕ) → ((𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) | |
| 16 | 14, 5, 15 | syl2anc 411 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) |
| 17 | 12, 16 | mpd 13 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴)) |
| 18 | 3 | nnred 9250 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝑃 ∈ ℝ) |
| 19 | prmuz2 12828 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ≥‘2)) | |
| 20 | eluz2gt1 9934 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → 1 < 𝑃) | |
| 21 | 1, 19, 20 | 3syl 17 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 1 < 𝑃) |
| 22 | nn0leexp2 11072 | . . . 4 ⊢ (((𝑃 ∈ ℝ ∧ (𝑃 pCnt (𝑃↑𝐴)) ∈ ℕ0 ∧ 𝐴 ∈ ℕ0) ∧ 1 < 𝑃) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴 ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) | |
| 23 | 18, 6, 4, 21, 22 | syl31anc 1277 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴 ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) |
| 24 | 17, 23 | mpbird 167 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴) |
| 25 | iddvds 12490 | . . . 4 ⊢ ((𝑃↑𝐴) ∈ ℤ → (𝑃↑𝐴) ∥ (𝑃↑𝐴)) | |
| 26 | 9, 25 | syl 14 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑𝐴) ∥ (𝑃↑𝐴)) |
| 27 | pcdvdsb 13018 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃↑𝐴) ∈ ℤ ∧ 𝐴 ∈ ℕ0) → (𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑𝐴) ∥ (𝑃↑𝐴))) | |
| 28 | 1, 9, 4, 27 | syl3anc 1274 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑𝐴) ∥ (𝑃↑𝐴))) |
| 29 | 26, 28 | mpbird 167 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴))) |
| 30 | nn0re 9505 | . . . 4 ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℝ) | |
| 31 | 30 | adantl 277 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ∈ ℝ) |
| 32 | 7, 31 | letri3d 8389 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) = 𝐴 ↔ ((𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴 ∧ 𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴))))) |
| 33 | 24, 29, 32 | mpbir2and 953 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2203 class class class wbr 4109 ‘cfv 5352 (class class class)co 6050 ℝcr 8126 1c1 8128 < clt 8308 ≤ cle 8309 ℕcn 9237 2c2 9288 ℕ0cn0 9496 ℤcz 9577 ℤ≥cuz 9853 ↑cexp 10900 ∥ cdvds 12473 ℙcprime 12804 pCnt cpc 12982 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-mulrcl 8226 ax-addcom 8227 ax-mulcom 8228 ax-addass 8229 ax-mulass 8230 ax-distr 8231 ax-i2m1 8232 ax-0lt1 8233 ax-1rid 8234 ax-0id 8235 ax-rnegex 8236 ax-precex 8237 ax-cnre 8238 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-apti 8242 ax-pre-ltadd 8243 ax-pre-mulgt0 8244 ax-pre-mulext 8245 ax-arch 8246 ax-caucvg 8247 |
| This theorem depends on definitions: df-bi 117 df-stab 839 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-if 3621 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-id 4414 df-po 4417 df-iso 4418 df-iord 4487 df-on 4489 df-ilim 4490 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-isom 5361 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-frec 6622 df-1o 6647 df-2o 6648 df-er 6767 df-en 6976 df-sup 7275 df-inf 7276 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-sub 8446 df-neg 8447 df-reap 8849 df-ap 8856 df-div 8947 df-inn 9238 df-2 9296 df-3 9297 df-4 9298 df-n0 9497 df-z 9578 df-uz 9854 df-q 9952 df-rp 9987 df-fz 10343 df-fzo 10477 df-fl 10630 df-mod 10685 df-seqfrec 10810 df-exp 10901 df-cj 11527 df-re 11528 df-im 11529 df-rsqrt 11683 df-abs 11684 df-dvds 12474 df-gcd 12650 df-prm 12805 df-pc 12983 |
| This theorem is referenced by: pcid 13022 pcmpt 13041 dvdsppwf1o 15857 |
| Copyright terms: Public domain | W3C validator |