![]() |
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 481 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝑃 ∈ ℙ) | |
2 | prmnn 16652 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
3 | 1, 2 | syl 17 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝑃 ∈ ℕ) |
4 | simpr 483 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ∈ ℕ0) | |
5 | 3, 4 | nnexpcld 14247 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑𝐴) ∈ ℕ) |
6 | 1, 5 | pccld 16826 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ∈ ℕ0) |
7 | 6 | nn0red 12571 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ∈ ℝ) |
8 | 7 | leidd 11818 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ≤ (𝑃 pCnt (𝑃↑𝐴))) |
9 | 5 | nnzd 12623 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑𝐴) ∈ ℤ) |
10 | pcdvdsb 16845 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃↑𝐴) ∈ ℤ ∧ (𝑃 pCnt (𝑃↑𝐴)) ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴))) | |
11 | 1, 9, 6, 10 | syl3anc 1368 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴))) |
12 | 8, 11 | mpbid 231 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴)) |
13 | 3, 6 | nnexpcld 14247 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∈ ℕ) |
14 | 13 | nnzd 12623 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∈ ℤ) |
15 | dvdsle 16294 | . . . . 5 ⊢ (((𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∈ ℤ ∧ (𝑃↑𝐴) ∈ ℕ) → ((𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) | |
16 | 14, 5, 15 | syl2anc 582 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ∥ (𝑃↑𝐴) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) |
17 | 12, 16 | mpd 15 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴)) |
18 | 3 | nnred 12265 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝑃 ∈ ℝ) |
19 | 6 | nn0zd 12622 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ∈ ℤ) |
20 | nn0z 12621 | . . . . 5 ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℤ) | |
21 | 20 | adantl 480 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ∈ ℤ) |
22 | prmuz2 16674 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ≥‘2)) | |
23 | eluz2gt1 12942 | . . . . 5 ⊢ (𝑃 ∈ (ℤ≥‘2) → 1 < 𝑃) | |
24 | 1, 22, 23 | 3syl 18 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 1 < 𝑃) |
25 | 18, 19, 21, 24 | leexp2d 14254 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴 ↔ (𝑃↑(𝑃 pCnt (𝑃↑𝐴))) ≤ (𝑃↑𝐴))) |
26 | 17, 25 | mpbird 256 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴) |
27 | iddvds 16254 | . . . 4 ⊢ ((𝑃↑𝐴) ∈ ℤ → (𝑃↑𝐴) ∥ (𝑃↑𝐴)) | |
28 | 9, 27 | syl 17 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃↑𝐴) ∥ (𝑃↑𝐴)) |
29 | pcdvdsb 16845 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃↑𝐴) ∈ ℤ ∧ 𝐴 ∈ ℕ0) → (𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑𝐴) ∥ (𝑃↑𝐴))) | |
30 | 1, 9, 4, 29 | syl3anc 1368 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴)) ↔ (𝑃↑𝐴) ∥ (𝑃↑𝐴))) |
31 | 28, 30 | mpbird 256 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴))) |
32 | nn0re 12519 | . . . 4 ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℝ) | |
33 | 32 | adantl 480 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → 𝐴 ∈ ℝ) |
34 | 7, 33 | letri3d 11394 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → ((𝑃 pCnt (𝑃↑𝐴)) = 𝐴 ↔ ((𝑃 pCnt (𝑃↑𝐴)) ≤ 𝐴 ∧ 𝐴 ≤ (𝑃 pCnt (𝑃↑𝐴))))) |
35 | 26, 31, 34 | mpbir2and 711 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 class class class wbr 5152 ‘cfv 6553 (class class class)co 7426 ℝcr 11145 1c1 11147 < clt 11286 ≤ cle 11287 ℕcn 12250 2c2 12305 ℕ0cn0 12510 ℤcz 12596 ℤ≥cuz 12860 ↑cexp 14066 ∥ cdvds 16238 ℙcprime 16649 pCnt cpc 16812 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 ax-pre-sup 11224 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-1o 8493 df-2o 8494 df-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-fin 8974 df-sup 9473 df-inf 9474 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-div 11910 df-nn 12251 df-2 12313 df-3 12314 df-n0 12511 df-z 12597 df-uz 12861 df-q 12971 df-rp 13015 df-fl 13797 df-mod 13875 df-seq 14007 df-exp 14067 df-cj 15086 df-re 15087 df-im 15088 df-sqrt 15222 df-abs 15223 df-dvds 16239 df-gcd 16477 df-prm 16650 df-pc 16813 |
This theorem is referenced by: pcid 16849 pcmpt 16868 dvdsppwf1o 27138 aks6d1c2p2 41622 aks6d1c7 41688 |
Copyright terms: Public domain | W3C validator |