dchrisum0fmul - Metamath Proof Explorer

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

Theorem dchrisum0fmul 24995

Description: The function 𝐹, the divisor sum of a Dirichlet character, is a multiplicative function (but not completely multiplicative). Equation 9.4.27 of [Shapiro], p. 382. (Contributed by Mario Carneiro, 5-May-2016.)

**Hypotheses**
Ref	Expression
rpvmasum.z	⊢ 𝑍 = (ℤ/nℤ‘𝑁)
rpvmasum.l	⊢ 𝐿 = (ℤRHom‘𝑍)
rpvmasum.a	⊢ (𝜑 → 𝑁 ∈ ℕ)
rpvmasum2.g	⊢ 𝐺 = (DChr‘𝑁)
rpvmasum2.d	⊢ 𝐷 = (Base‘𝐺)
rpvmasum2.1	⊢ 1 = (0_g‘𝐺)
dchrisum0f.f	⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣)))
dchrisum0f.x	⊢ (𝜑 → 𝑋 ∈ 𝐷)
dchrisum0fmul.a	⊢ (𝜑 → 𝐴 ∈ ℕ)
dchrisum0fmul.b	⊢ (𝜑 → 𝐵 ∈ ℕ)
dchrisum0fmul.m	⊢ (𝜑 → (𝐴 gcd 𝐵) = 1)

**Assertion**
Ref	Expression
dchrisum0fmul	⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = ((𝐹‘𝐴) · (𝐹‘𝐵)))

Distinct variable groups: 𝑞,𝑏,𝑣,𝐴 𝑁,𝑞 𝐵,𝑏,𝑞,𝑣 𝐿,𝑏,𝑣 𝑋,𝑏,𝑣 Allowed substitution hints: 𝜑(𝑣,𝑞,𝑏) 𝐷(𝑣,𝑞,𝑏) 1 (𝑣,𝑞,𝑏) 𝐹(𝑣,𝑞,𝑏) 𝐺(𝑣,𝑞,𝑏) 𝐿(𝑞) 𝑁(𝑣,𝑏) 𝑋(𝑞) 𝑍(𝑣,𝑞,𝑏)

Proof of Theorem dchrisum0fmul Dummy variables 𝑘 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dchrisum0fmul.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℕ)
2		dchrisum0fmul.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℕ)
3		dchrisum0fmul.m	. . 3 ⊢ (𝜑 → (𝐴 gcd 𝐵) = 1)
4		eqid 2610	. . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}
5		eqid 2610	. . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}
6		eqid 2610	. . 3 ⊢ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} = {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)}
7		rpvmasum2.g	. . . 4 ⊢ 𝐺 = (DChr‘𝑁)
8		rpvmasum.z	. . . 4 ⊢ 𝑍 = (ℤ/nℤ‘𝑁)
9		rpvmasum2.d	. . . 4 ⊢ 𝐷 = (Base‘𝐺)
10		rpvmasum.l	. . . 4 ⊢ 𝐿 = (ℤRHom‘𝑍)
11		dchrisum0f.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐷)
12	11	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → 𝑋 ∈ 𝐷)
13		elrabi 3328	. . . . . 6 ⊢ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} → 𝑗 ∈ ℕ)
14	13	nnzd 11357	. . . . 5 ⊢ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} → 𝑗 ∈ ℤ)
15	14	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → 𝑗 ∈ ℤ)
16	7, 8, 9, 10, 12, 15	dchrzrhcl 24770	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴}) → (𝑋‘(𝐿‘𝑗)) ∈ ℂ)
17	11	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → 𝑋 ∈ 𝐷)
18		elrabi 3328	. . . . . 6 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} → 𝑘 ∈ ℕ)
19	18	nnzd 11357	. . . . 5 ⊢ (𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} → 𝑘 ∈ ℤ)
20	19	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → 𝑘 ∈ ℤ)
21	7, 8, 9, 10, 17, 20	dchrzrhcl 24770	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → (𝑋‘(𝐿‘𝑘)) ∈ ℂ)
22	14, 19	anim12i 588	. . . 4 ⊢ ((𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵}) → (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ))
23	11	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑋 ∈ 𝐷)
24		simprl 790	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑗 ∈ ℤ)
25		simprr 792	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → 𝑘 ∈ ℤ)
26	7, 8, 9, 10, 23, 24, 25	dchrzrhmul 24771	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → (𝑋‘(𝐿‘(𝑗 · 𝑘))) = ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))))
27	26	eqcomd 2616	. . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ)) → ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))) = (𝑋‘(𝐿‘(𝑗 · 𝑘))))
28	22, 27	sylan2 490	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} ∧ 𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵})) → ((𝑋‘(𝐿‘𝑗)) · (𝑋‘(𝐿‘𝑘))) = (𝑋‘(𝐿‘(𝑗 · 𝑘))))
29		fveq2 6103	. . . 4 ⊢ (𝑖 = (𝑗 · 𝑘) → (𝐿‘𝑖) = (𝐿‘(𝑗 · 𝑘)))
30	29	fveq2d 6107	. . 3 ⊢ (𝑖 = (𝑗 · 𝑘) → (𝑋‘(𝐿‘𝑖)) = (𝑋‘(𝐿‘(𝑗 · 𝑘))))
31	1, 2, 3, 4, 5, 6, 16, 21, 28, 30	fsumdvdsmul 24721	. 2 ⊢ (𝜑 → (Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)) · Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖)))
32		rpvmasum.a	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ)
33		rpvmasum2.1	. . . . 5 ⊢ 1 = (0_g‘𝐺)
34		dchrisum0f.f	. . . . 5 ⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣)))
35	8, 10, 32, 7, 9, 33, 34	dchrisum0fval 24994	. . . 4 ⊢ (𝐴 ∈ ℕ → (𝐹‘𝐴) = Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)))
36	1, 35	syl 17	. . 3 ⊢ (𝜑 → (𝐹‘𝐴) = Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)))
37	8, 10, 32, 7, 9, 33, 34	dchrisum0fval 24994	. . . 4 ⊢ (𝐵 ∈ ℕ → (𝐹‘𝐵) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘)))
38	2, 37	syl 17	. . 3 ⊢ (𝜑 → (𝐹‘𝐵) = Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘)))
39	36, 38	oveq12d 6567	. 2 ⊢ (𝜑 → ((𝐹‘𝐴) · (𝐹‘𝐵)) = (Σ𝑗 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐴} (𝑋‘(𝐿‘𝑗)) · Σ𝑘 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝐵} (𝑋‘(𝐿‘𝑘))))
40	1, 2	nnmulcld 10945	. . 3 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℕ)
41	8, 10, 32, 7, 9, 33, 34	dchrisum0fval 24994	. . 3 ⊢ ((𝐴 · 𝐵) ∈ ℕ → (𝐹‘(𝐴 · 𝐵)) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖)))
42	40, 41	syl 17	. 2 ⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = Σ𝑖 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ (𝐴 · 𝐵)} (𝑋‘(𝐿‘𝑖)))
43	31, 39, 42	3eqtr4rd 2655	1 ⊢ (𝜑 → (𝐹‘(𝐴 · 𝐵)) = ((𝐹‘𝐴) · (𝐹‘𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {crab 2900 class class class wbr 4583 ↦ cmpt 4643 ‘cfv 5804 (class class class)co 6549 1c1 9816 · cmul 9820 ℕcn 10897 ℤcz 11254 Σcsu 14264 ∥ cdvds 14821 gcd cgcd 15054 Basecbs 15695 0_gc0g 15923 ℤRHomczrh 19667 ℤ/nℤczn 19670 DChrcdchr 24757

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 ax-addf 9894 ax-mulf 9895

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-tpos 7239 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-ec 7631 df-qs 7635 df-map 7746 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-inf 8232 df-oi 8298 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-uz 11564 df-rp 11709 df-fz 12198 df-fzo 12335 df-fl 12455 df-mod 12531 df-seq 12664 df-exp 12723 df-hash 12980 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-clim 14067 df-sum 14265 df-dvds 14822 df-gcd 15055 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-ress 15702 df-plusg 15781 df-mulr 15782 df-starv 15783 df-sca 15784 df-vsca 15785 df-ip 15786 df-tset 15787 df-ple 15788 df-ds 15791 df-unif 15792 df-0g 15925 df-imas 15991 df-qus 15992 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-mhm 17158 df-grp 17248 df-minusg 17249 df-sbg 17250 df-mulg 17364 df-subg 17414 df-nsg 17415 df-eqg 17416 df-ghm 17481 df-cmn 18018 df-abl 18019 df-mgp 18313 df-ur 18325 df-ring 18372 df-cring 18373 df-oppr 18446 df-dvdsr 18464 df-unit 18465 df-rnghom 18538 df-subrg 18601 df-lmod 18688 df-lss 18754 df-lsp 18793 df-sra 18993 df-rgmod 18994 df-lidl 18995 df-rsp 18996 df-2idl 19053 df-cnfld 19568 df-zring 19638 df-zrh 19671 df-zn 19674 df-dchr 24758

This theorem is referenced by: dchrisum0flblem2 24998

W3C validator