Theorem dvdsflsumcom 27330

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 14011	. . 3 ⊢ (𝜑 → (1...(⌊‘𝐴)) ∈ Fin)
2		fzfid 14011	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → (1...𝑛) ∈ Fin)
3		elfznn 13583	. . . . . 6 ⊢ (𝑛 ∈ (1...(⌊‘𝐴)) → 𝑛 ∈ ℕ)
4	3	adantl 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → 𝑛 ∈ ℕ)
5		dvdsssfz1 16377	. . . . 5 ⊢ (𝑛 ∈ ℕ → {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ⊆ (1...𝑛))
6	4, 5	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ⊆ (1...𝑛))
7	2, 6	ssfid 9230	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ∈ Fin)
8		nnre 12241	. . . . . . . . . . . 12 ⊢ (𝑑 ∈ ℕ → 𝑑 ∈ ℝ)
9	8	ad2antrl 740	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑑 ∈ ℝ)
10	4	adantr 485	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑛 ∈ ℕ)
11	10	nnred 12249	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑛 ∈ ℝ)
12		dvdsflsumcom.2	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℝ)
13	12	ad2antrr 738	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝐴 ∈ ℝ)
14		nnz 12613	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℕ → 𝑑 ∈ ℤ)
15		dvdsle 16369	. . . . . . . . . . . . 13 ⊢ ((𝑑 ∈ ℤ ∧ 𝑛 ∈ ℕ) → (𝑑 ∥ 𝑛 → 𝑑 ≤ 𝑛))
16	14, 4, 15	syl2anr 608	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ 𝑑 ∈ ℕ) → (𝑑 ∥ 𝑛 → 𝑑 ≤ 𝑛))
17	16	impr 459	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑑 ≤ 𝑛)
18		fznnfl 13897	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℝ → (𝑛 ∈ (1...(⌊‘𝐴)) ↔ (𝑛 ∈ ℕ ∧ 𝑛 ≤ 𝐴)))
19	12, 18	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑛 ∈ (1...(⌊‘𝐴)) ↔ (𝑛 ∈ ℕ ∧ 𝑛 ≤ 𝐴)))
20	19	simplbda 504	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → 𝑛 ≤ 𝐴)
21	20	adantr 485	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑛 ≤ 𝐴)
22	9, 11, 13, 17, 21	letrd 11368	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑑 ≤ 𝐴)
23	22	ex 417	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) → 𝑑 ≤ 𝐴))
24	23	pm4.71rd 571	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ↔ (𝑑 ≤ 𝐴 ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛))))
25		ancom 465	. . . . . . . . 9 ⊢ ((𝑑 ≤ 𝐴 ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ∧ 𝑑 ≤ 𝐴))
26		an32 658	. . . . . . . . 9 ⊢ (((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ∧ 𝑑 ≤ 𝐴) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛))
27	25, 26	bitri 278	. . . . . . . 8 ⊢ ((𝑑 ≤ 𝐴 ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛))
28	24, 27	bitrdi 290	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛)))
29		fznnfl 13897	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → (𝑑 ∈ (1...(⌊‘𝐴)) ↔ (𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴)))
30	12, 29	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝑑 ∈ (1...(⌊‘𝐴)) ↔ (𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴)))
31	30	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → (𝑑 ∈ (1...(⌊‘𝐴)) ↔ (𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴)))
32	31	anbi1d 642	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛)))
33	28, 32	bitr4d 285	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)))
34	33	pm5.32da 589	. . . . 5 ⊢ (𝜑 → ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛))))
35		an12 657	. . . . 5 ⊢ ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)))
36	34, 35	bitrdi 290	. . . 4 ⊢ (𝜑 → ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛))))
37		breq1 5113	. . . . . 6 ⊢ (𝑥 = 𝑑 → (𝑥 ∥ 𝑛 ↔ 𝑑 ∥ 𝑛))
38	37	elrab 3651	. . . . 5 ⊢ (𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ↔ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛))
39	38	anbi2i 634	. . . 4 ⊢ ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}) ↔ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)))
40		breq2 5114	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑑 ∥ 𝑥 ↔ 𝑑 ∥ 𝑛))
41	40	elrab 3651	. . . . 5 ⊢ (𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥} ↔ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛))
42	41	anbi2i 634	. . . 4 ⊢ ((𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)))
43	36, 39, 42	3bitr4g 317	. . 3 ⊢ (𝜑 → ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})))
44		dvdsflsumcom.3	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛})) → 𝐵 ∈ ℂ)
45	1, 1, 7, 43, 44	fsumcom2 15827	. 2 ⊢ (𝜑 → Σ𝑛 ∈ (1...(⌊‘𝐴))Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}𝐵)
46		dvdsflsumcom.1	. . . 4 ⊢ (𝑛 = (𝑑 · 𝑚) → 𝐵 = 𝐶)
47		fzfid 14011	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → (1...(⌊‘(𝐴 / 𝑑))) ∈ Fin)
48	12	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → 𝐴 ∈ ℝ)
49	30	simprbda 503	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → 𝑑 ∈ ℕ)
50		eqid 2763	. . . . 5 ⊢ (𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦)) = (𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦))
51	48, 49, 50	dvdsflf1o 27329	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → (𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦)):(1...(⌊‘(𝐴 / 𝑑)))–1-1-onto→{𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})
52		oveq2 7420	. . . . . 6 ⊢ (𝑦 = 𝑚 → (𝑑 · 𝑦) = (𝑑 · 𝑚))
53		ovex 7445	. . . . . 6 ⊢ (𝑑 · 𝑚) ∈ V
54	52, 50, 53	fvmpt 6991	. . . . 5 ⊢ (𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑))) → ((𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦))‘𝑚) = (𝑑 · 𝑚))
55	54	adantl 486	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) ∧ 𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))) → ((𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦))‘𝑚) = (𝑑 · 𝑚))
56	43	biimpar 482	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})) → (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}))
57	56, 44	syldan 602	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})) → 𝐵 ∈ ℂ)
58	57	anassrs 472	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}) → 𝐵 ∈ ℂ)
59	46, 47, 51, 55, 58	fsumf1o 15776	. . 3 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → Σ𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}𝐵 = Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)
60	59	sumeq2dv 15755	. 2 ⊢ (𝜑 → Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)
61	45, 60	eqtrd 2798	1 ⊢ (𝜑 → Σ𝑛 ∈ (1...(⌊‘𝐴))Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  {crab 3416   ⊆ wss 3906   class class class wbr 5110   ↦ cmpt 5193  ‘cfv 6538  (class class class)co 7412  ℂcc 11099  ℝcr 11100  1c1 11102   · cmul 11106   ≤ cle 11245   / cdiv 11872  ℕcn 12234  ℤcz 12592  ...cfz 13536  ⌊cfl 13825  Σcsu 15739   ∥ cdvds 16311

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-inf2 9611  ax-cnex 11157  ax-resscn 11158  ax-1cn 11159  ax-icn 11160  ax-addcl 11161  ax-addrcl 11162  ax-mulcl 11163  ax-mulrcl 11164  ax-mulcom 11165  ax-addass 11166  ax-mulass 11167  ax-distr 11168  ax-i2m1 11169  ax-1ne0 11170  ax-1rid 11171  ax-rnegex 11172  ax-rrecex 11173  ax-cnre 11174  ax-pre-lttri 11175  ax-pre-lttrn 11176  ax-pre-ltadd 11177  ax-pre-mulgt0 11178  ax-pre-sup 11179

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-er 8695  df-en 8945  df-dom 8946  df-sdom 8947  df-fin 8948  df-sup 9403  df-inf 9404  df-oi 9473  df-card 9926  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11444  df-neg 11445  df-div 11873  df-nn 12235  df-2 12304  df-3 12305  df-n0 12506  df-z 12593  df-uz 12864  df-rp 13018  df-fz 13537  df-fzo 13685  df-fl 13827  df-seq 14040  df-exp 14100  df-hash 14369  df-cj 15152  df-re 15153  df-im 15154  df-sqrt 15288  df-abs 15289  df-clim 15541  df-sum 15740  df-dvds 16312

This theorem is referenced by:  dchrmusum2  27636  dchrvmasumlem1  27637  dchrvmasum2lem  27638  dchrisum0  27662  mudivsum  27672  mulogsum  27674  mulog2sumlem2  27677  vmalogdivsum2  27680  selberglem3  27689  selberg  27690  selberg34r  27713  pntsval2  27718