![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > pcidlem | Structured version Visualization version 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 483 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝑃 ∈ ℙ) | |
2 | prmnn 15851 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
3 | 1, 2 | syl 17 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝑃 ∈ ℕ) |
4 | simpr 485 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ∈ ℕ0) | |
5 | 3, 4 | nnexpcld 13460 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑𝐴) ∈ ℕ) |
6 | 1, 5 | pccld 16020 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ∈ ℕ0) |
7 | 6 | nn0red 11810 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ∈ ℝ) |
8 | 7 | leidd 11060 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ≤ (𝑃 pCnt (𝑃↑𝐴))) |
9 | 5 | nnzd 11940 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑𝐴) ∈ ℤ) |
10 | pcdvdsb 16038 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃↑𝐴) ∈ ℤ ∧ (𝑃 pCnt (𝑃↑𝐴)) ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴))) | |
11 | 1, 9, 6, 10 | syl3anc 1364 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴))) |
12 | 8, 11 | mpbid 233 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴)) |
13 | 3, 6 | nnexpcld 13460 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∈ ℕ) |
14 | 13 | nnzd 11940 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∈ ℤ) |
15 | dvdsle 15497 | . . . . 5 ⊢ (((𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∈ ℤ ∧ (𝑃↑𝐴) ∈ ℕ) → ((𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) | |
16 | 14, 5, 15 | syl2anc 584 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) |
17 | 12, 16 | mpd 15 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴)) |
18 | 3 | nnred 11507 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝑃 ∈ ℝ) |
19 | 6 | nn0zd 11939 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ∈ ℤ) |
20 | nn0z 11859 | . . . . 5 ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℤ) | |
21 | 20 | adantl 482 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ∈ ℤ) |
22 | prmuz2 15873 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ≥‘2)) | |
23 | eluz2gt1 12173 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → 1 < 𝑃) | |
24 | 1, 22, 23 | 3syl 18 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 1 < 𝑃) |
25 | 18, 19, 21, 24 | leexp2d 13469 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴 ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) |
26 | 17, 25 | mpbird 258 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴) |
27 | iddvds 15460 | . . . 4 ⊢ ((𝑃↑𝐴) ∈ ℤ → (𝑃↑𝐴) ∥ (𝑃↑𝐴)) | |
28 | 9, 27 | syl 17 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑𝐴) ∥ (𝑃↑𝐴)) |
29 | pcdvdsb 16038 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃↑𝐴) ∈ ℤ ∧ 𝐴 ∈ ℕ0) → (𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑𝐴) ∥ (𝑃↑𝐴))) | |
30 | 1, 9, 4, 29 | syl3anc 1364 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑𝐴) ∥ (𝑃↑𝐴))) |
31 | 28, 30 | mpbird 258 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴))) |
32 | nn0re 11760 | . . . 4 ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℝ) | |
33 | 32 | adantl 482 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ∈ ℝ) |
34 | 7, 33 | letri3d 10635 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) = 𝐴 ↔ ((𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴 ∧ 𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴))))) |
35 | 26, 31, 34 | mpbir2and 709 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1525 ∈ wcel 2083 class class class wbr 4968 ‘cfv 6232 (class class class)co 7023 ℝcr 10389 1c1 10391 < clt 10528 ≤ cle 10529 ℕcn 11492 2c2 11546 ℕ0cn0 11751 ℤcz 11835 ℤ≥cuz 12097 ↑cexp 13283 ∥ cdvds 15444 ℙcprime 15848 pCnt cpc 16006 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1781 ax-4 1795 ax-5 1892 ax-6 1951 ax-7 1996 ax-8 2085 ax-9 2093 ax-10 2114 ax-11 2128 ax-12 2143 ax-13 2346 ax-ext 2771 ax-sep 5101 ax-nul 5108 ax-pow 5164 ax-pr 5228 ax-un 7326 ax-cnex 10446 ax-resscn 10447 ax-1cn 10448 ax-icn 10449 ax-addcl 10450 ax-addrcl 10451 ax-mulcl 10452 ax-mulrcl 10453 ax-mulcom 10454 ax-addass 10455 ax-mulass 10456 ax-distr 10457 ax-i2m1 10458 ax-1ne0 10459 ax-1rid 10460 ax-rnegex 10461 ax-rrecex 10462 ax-cnre 10463 ax-pre-lttri 10464 ax-pre-lttrn 10465 ax-pre-ltadd 10466 ax-pre-mulgt0 10467 ax-pre-sup 10468 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3or 1081 df-3an 1082 df-tru 1528 df-ex 1766 df-nf 1770 df-sb 2045 df-mo 2578 df-eu 2614 df-clab 2778 df-cleq 2790 df-clel 2865 df-nfc 2937 df-ne 2987 df-nel 3093 df-ral 3112 df-rex 3113 df-reu 3114 df-rmo 3115 df-rab 3116 df-v 3442 df-sbc 3712 df-csb 3818 df-dif 3868 df-un 3870 df-in 3872 df-ss 3880 df-pss 3882 df-nul 4218 df-if 4388 df-pw 4461 df-sn 4479 df-pr 4481 df-tp 4483 df-op 4485 df-uni 4752 df-iun 4833 df-br 4969 df-opab 5031 df-mpt 5048 df-tr 5071 df-id 5355 df-eprel 5360 df-po 5369 df-so 5370 df-fr 5409 df-we 5411 df-xp 5456 df-rel 5457 df-cnv 5458 df-co 5459 df-dm 5460 df-rn 5461 df-res 5462 df-ima 5463 df-pred 6030 df-ord 6076 df-on 6077 df-lim 6078 df-suc 6079 df-iota 6196 df-fun 6234 df-fn 6235 df-f 6236 df-f1 6237 df-fo 6238 df-f1o 6239 df-fv 6240 df-riota 6984 df-ov 7026 df-oprab 7027 df-mpo 7028 df-om 7444 df-1st 7552 df-2nd 7553 df-wrecs 7805 df-recs 7867 df-rdg 7905 df-1o 7960 df-2o 7961 df-er 8146 df-en 8365 df-dom 8366 df-sdom 8367 df-fin 8368 df-sup 8759 df-inf 8760 df-pnf 10530 df-mnf 10531 df-xr 10532 df-ltxr 10533 df-le 10534 df-sub 10725 df-neg 10726 df-div 11152 df-nn 11493 df-2 11554 df-3 11555 df-n0 11752 df-z 11836 df-uz 12098 df-q 12202 df-rp 12244 df-fl 13016 df-mod 13092 df-seq 13224 df-exp 13284 df-cj 14296 df-re 14297 df-im 14298 df-sqrt 14432 df-abs 14433 df-dvds 15445 df-gcd 15681 df-prm 15849 df-pc 16007 |
This theorem is referenced by: pcid 16042 pcmpt 16061 dvdsppwf1o 25449 |
Copyright terms: Public domain | W3C validator |