pcmul - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > pcmul		Structured version Visualization version GIF version

Theorem pcmul 16780

Description: Multiplication property of the prime power function. (Contributed by Mario Carneiro, 23-Feb-2014.)

**Assertion**
Ref	Expression
pcmul	⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → (𝑃 pCnt (𝐴 · 𝐵)) = ((𝑃 pCnt 𝐴) + (𝑃 pCnt 𝐵)))

Proof of Theorem pcmul Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2732	. . 3 ⊢ sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐴}, ℝ, < ) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐴}, ℝ, < )
2		eqid 2732	. . 3 ⊢ sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐵}, ℝ, < ) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐵}, ℝ, < )
3		eqid 2732	. . 3 ⊢ sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ (𝐴 · 𝐵)}, ℝ, < ) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ (𝐴 · 𝐵)}, ℝ, < )
4	1, 2, 3	pcpremul 16772	. 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → (sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐴}, ℝ, < ) + sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐵}, ℝ, < )) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ (𝐴 · 𝐵)}, ℝ, < ))
5	1	pczpre 16776	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℤ ∧ 𝐴 ≠ 0)) → (𝑃 pCnt 𝐴) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐴}, ℝ, < ))
6	5	3adant3 1132	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → (𝑃 pCnt 𝐴) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐴}, ℝ, < ))
7	2	pczpre 16776	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → (𝑃 pCnt 𝐵) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐵}, ℝ, < ))
8	7	3adant2 1131	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → (𝑃 pCnt 𝐵) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐵}, ℝ, < ))
9	6, 8	oveq12d 7423	. 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → ((𝑃 pCnt 𝐴) + (𝑃 pCnt 𝐵)) = (sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐴}, ℝ, < ) + sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ 𝐵}, ℝ, < )))
10		zmulcl 12607	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 · 𝐵) ∈ ℤ)
11	10	ad2ant2r 745	. . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → (𝐴 · 𝐵) ∈ ℤ)
12		zcn 12559	. . . . . . 7 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ)
13	12	anim1i 615	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) → (𝐴 ∈ ℂ ∧ 𝐴 ≠ 0))
14		zcn 12559	. . . . . . 7 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℂ)
15	14	anim1i 615	. . . . . 6 ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≠ 0) → (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0))
16		mulne0 11852	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) → (𝐴 · 𝐵) ≠ 0)
17	13, 15, 16	syl2an 596	. . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → (𝐴 · 𝐵) ≠ 0)
18	11, 17	jca 512	. . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵) ∈ ℤ ∧ (𝐴 · 𝐵) ≠ 0))
19	3	pczpre 16776	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ ((𝐴 · 𝐵) ∈ ℤ ∧ (𝐴 · 𝐵) ≠ 0)) → (𝑃 pCnt (𝐴 · 𝐵)) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ (𝐴 · 𝐵)}, ℝ, < ))
20	18, 19	sylan2 593	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ ((𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0))) → (𝑃 pCnt (𝐴 · 𝐵)) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ (𝐴 · 𝐵)}, ℝ, < ))
21	20	3impb 1115	. 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → (𝑃 pCnt (𝐴 · 𝐵)) = sup({𝑛 ∈ ℕ₀ ∣ (𝑃↑𝑛) ∥ (𝐴 · 𝐵)}, ℝ, < ))
22	4, 9, 21	3eqtr4rd 2783	1 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℤ ∧ 𝐴 ≠ 0) ∧ (𝐵 ∈ ℤ ∧ 𝐵 ≠ 0)) → (𝑃 pCnt (𝐴 · 𝐵)) = ((𝑃 pCnt 𝐴) + (𝑃 pCnt 𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 {crab 3432 class class class wbr 5147 (class class class)co 7405 supcsup 9431 ℂcc 11104 ℝcr 11105 0cc0 11106 + caddc 11109 · cmul 11111 < clt 11244 ℕ₀cn0 12468 ℤcz 12554 ↑cexp 14023 ∥ cdvds 16193 ℙcprime 16604 pCnt cpc 16765

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-2o 8463 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-sup 9433 df-inf 9434 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-n0 12469 df-z 12555 df-uz 12819 df-q 12929 df-rp 12971 df-fl 13753 df-mod 13831 df-seq 13963 df-exp 14024 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-dvds 16194 df-gcd 16432 df-prm 16605 df-pc 16766

This theorem is referenced by: pcqmul 16782 pcaddlem 16817 pcmpt 16821 pcfac 16828 pcbc 16829 sylow1lem1 19460 sylow1lem5 19464 mumullem2 26673 chtublem 26703 lgsdi 26826 aks6d1c2p2 40945

W3C validator