Theorem dvdsflsumcom 27166

Description: A sum commutation from Σ𝑛 ≤ 𝐴, Σ𝑑 ∥ 𝑛, 𝐵(𝑛, 𝑑) to Σ𝑑 ≤ 𝐴, Σ𝑚 ≤ 𝐴 / 𝑑, 𝐵(𝑛, 𝑑𝑚). (Contributed by Mario Carneiro, 4-May-2016.)

Hypotheses

Ref	Expression
dvdsflsumcom.1	⊢ (𝑛 = (𝑑 · 𝑚) → 𝐵 = 𝐶)
dvdsflsumcom.2	⊢ (𝜑 → 𝐴 ∈ ℝ)
dvdsflsumcom.3	⊢ ((𝜑 ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛})) → 𝐵 ∈ ℂ)

Assertion

Ref	Expression
dvdsflsumcom	⊢ (𝜑 → Σ𝑛 ∈ (1...(⌊‘𝐴))Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)

Distinct variable groups:   𝑚,𝑑,𝑛,𝑥,𝐴   𝐵,𝑚   𝐶,𝑛   𝜑,𝑑,𝑚,𝑛

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥,𝑛,𝑑)   𝐶(𝑥,𝑚,𝑑)

Proof of Theorem dvdsflsumcom

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fzfid 13908	. . 3 ⊢ (𝜑 → (1...(⌊‘𝐴)) ∈ Fin)
2		fzfid 13908	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → (1...𝑛) ∈ Fin)
3		elfznn 13481	. . . . . 6 ⊢ (𝑛 ∈ (1...(⌊‘𝐴)) → 𝑛 ∈ ℕ)
4	3	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → 𝑛 ∈ ℕ)
5		dvdsssfz1 16257	. . . . 5 ⊢ (𝑛 ∈ ℕ → {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ⊆ (1...𝑛))
6	4, 5	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ⊆ (1...𝑛))
7	2, 6	ssfid 9181	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ∈ Fin)
8		nnre 12164	. . . . . . . . . . . 12 ⊢ (𝑑 ∈ ℕ → 𝑑 ∈ ℝ)
9	8	ad2antrl 729	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑑 ∈ ℝ)
10	4	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑛 ∈ ℕ)
11	10	nnred 12172	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑛 ∈ ℝ)
12		dvdsflsumcom.2	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℝ)
13	12	ad2antrr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝐴 ∈ ℝ)
14		nnz 12521	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℕ → 𝑑 ∈ ℤ)
15		dvdsle 16249	. . . . . . . . . . . . 13 ⊢ ((𝑑 ∈ ℤ ∧ 𝑛 ∈ ℕ) → (𝑑 ∥ 𝑛 → 𝑑 ≤ 𝑛))
16	14, 4, 15	syl2anr 598	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ 𝑑 ∈ ℕ) → (𝑑 ∥ 𝑛 → 𝑑 ≤ 𝑛))
17	16	impr 454	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑑 ≤ 𝑛)
18		fznnfl 13794	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℝ → (𝑛 ∈ (1...(⌊‘𝐴)) ↔ (𝑛 ∈ ℕ ∧ 𝑛 ≤ 𝐴)))
19	12, 18	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑛 ∈ (1...(⌊‘𝐴)) ↔ (𝑛 ∈ ℕ ∧ 𝑛 ≤ 𝐴)))
20	19	simplbda 499	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → 𝑛 ≤ 𝐴)
21	20	adantr 480	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑛 ≤ 𝐴)
22	9, 11, 13, 17, 21	letrd 11302	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑑 ≤ 𝐴)
23	22	ex 412	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) → 𝑑 ≤ 𝐴))
24	23	pm4.71rd 562	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ↔ (𝑑 ≤ 𝐴 ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛))))
25		ancom 460	. . . . . . . . 9 ⊢ ((𝑑 ≤ 𝐴 ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ∧ 𝑑 ≤ 𝐴))
26		an32 647	. . . . . . . . 9 ⊢ (((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ∧ 𝑑 ≤ 𝐴) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛))
27	25, 26	bitri 275	. . . . . . . 8 ⊢ ((𝑑 ≤ 𝐴 ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛))
28	24, 27	bitrdi 287	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛)))
29		fznnfl 13794	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → (𝑑 ∈ (1...(⌊‘𝐴)) ↔ (𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴)))
30	12, 29	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝑑 ∈ (1...(⌊‘𝐴)) ↔ (𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴)))
31	30	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → (𝑑 ∈ (1...(⌊‘𝐴)) ↔ (𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴)))
32	31	anbi1d 632	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛)))
33	28, 32	bitr4d 282	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)))
34	33	pm5.32da 579	. . . . 5 ⊢ (𝜑 → ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛))))
35		an12 646	. . . . 5 ⊢ ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)))
36	34, 35	bitrdi 287	. . . 4 ⊢ (𝜑 → ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛))))
37		breq1 5103	. . . . . 6 ⊢ (𝑥 = 𝑑 → (𝑥 ∥ 𝑛 ↔ 𝑑 ∥ 𝑛))
38	37	elrab 3648	. . . . 5 ⊢ (𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ↔ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛))
39	38	anbi2i 624	. . . 4 ⊢ ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}) ↔ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)))
40		breq2 5104	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑑 ∥ 𝑥 ↔ 𝑑 ∥ 𝑛))
41	40	elrab 3648	. . . . 5 ⊢ (𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥} ↔ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛))
42	41	anbi2i 624	. . . 4 ⊢ ((𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)))
43	36, 39, 42	3bitr4g 314	. . 3 ⊢ (𝜑 → ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})))
44		dvdsflsumcom.3	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛})) → 𝐵 ∈ ℂ)
45	1, 1, 7, 43, 44	fsumcom2 15709	. 2 ⊢ (𝜑 → Σ𝑛 ∈ (1...(⌊‘𝐴))Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}𝐵)
46		dvdsflsumcom.1	. . . 4 ⊢ (𝑛 = (𝑑 · 𝑚) → 𝐵 = 𝐶)
47		fzfid 13908	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → (1...(⌊‘(𝐴 / 𝑑))) ∈ Fin)
48	12	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → 𝐴 ∈ ℝ)
49	30	simprbda 498	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → 𝑑 ∈ ℕ)
50		eqid 2737	. . . . 5 ⊢ (𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦)) = (𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦))
51	48, 49, 50	dvdsflf1o 27165	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → (𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦)):(1...(⌊‘(𝐴 / 𝑑)))–1-1-onto→{𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})
52		oveq2 7376	. . . . . 6 ⊢ (𝑦 = 𝑚 → (𝑑 · 𝑦) = (𝑑 · 𝑚))
53		ovex 7401	. . . . . 6 ⊢ (𝑑 · 𝑚) ∈ V
54	52, 50, 53	fvmpt 6949	. . . . 5 ⊢ (𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑))) → ((𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦))‘𝑚) = (𝑑 · 𝑚))
55	54	adantl 481	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) ∧ 𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))) → ((𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦))‘𝑚) = (𝑑 · 𝑚))
56	43	biimpar 477	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})) → (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}))
57	56, 44	syldan 592	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})) → 𝐵 ∈ ℂ)
58	57	anassrs 467	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}) → 𝐵 ∈ ℂ)
59	46, 47, 51, 55, 58	fsumf1o 15658	. . 3 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → Σ𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}𝐵 = Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)
60	59	sumeq2dv 15637	. 2 ⊢ (𝜑 → Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)
61	45, 60	eqtrd 2772	1 ⊢ (𝜑 → Σ𝑛 ∈ (1...(⌊‘𝐴))Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {crab 3401   ⊆ wss 3903   class class class wbr 5100   ↦ cmpt 5181  ‘cfv 6500  (class class class)co 7368  ℂcc 11036  ℝcr 11037  1c1 11039   · cmul 11043   ≤ cle 11179   / cdiv 11806  ℕcn 12157  ℤcz 12500  ...cfz 13435  ⌊cfl 13722  Σcsu 15621   ∥ cdvds 16191

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-inf2 9562  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-sup 9357  df-inf 9358  df-oi 9427  df-card 9863  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-div 11807  df-nn 12158  df-2 12220  df-3 12221  df-n0 12414  df-z 12501  df-uz 12764  df-rp 12918  df-fz 13436  df-fzo 13583  df-fl 13724  df-seq 13937  df-exp 13997  df-hash 14266  df-cj 15034  df-re 15035  df-im 15036  df-sqrt 15170  df-abs 15171  df-clim 15423  df-sum 15622  df-dvds 16192

This theorem is referenced by:  dchrmusum2  27473  dchrvmasumlem1  27474  dchrvmasum2lem  27475  dchrisum0  27499  mudivsum  27509  mulogsum  27511  mulog2sumlem2  27514  vmalogdivsum2  27517  selberglem3  27526  selberg  27527  selberg34r  27550  pntsval2  27555