Theorem dvdsflsumcom 27545

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 14143	. . 3 ⊢ (𝜑 → (1...(⌊‘𝐴)) ∈ Fin)
2		fzfid 14143	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → (1...𝑛) ∈ Fin)
3		elfznn 13714	. . . . . 6 ⊢ (𝑛 ∈ (1...(⌊‘𝐴)) → 𝑛 ∈ ℕ)
4	3	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → 𝑛 ∈ ℕ)
5		dvdsssfz1 16517	. . . . 5 ⊢ (𝑛 ∈ ℕ → {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ⊆ (1...𝑛))
6	4, 5	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ⊆ (1...𝑛))
7	2, 6	ssfid 9288	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ∈ Fin)
8		nnre 12369	. . . . . . . . . . . 12 ⊢ (𝑑 ∈ ℕ → 𝑑 ∈ ℝ)
9	8	ad2antrl 741	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑑 ∈ ℝ)
10	4	adantr 486	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑛 ∈ ℕ)
11	10	nnred 12377	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑛 ∈ ℝ)
12		dvdsflsumcom.2	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℝ)
13	12	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝐴 ∈ ℝ)
14		nnz 12741	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℕ → 𝑑 ∈ ℤ)
15		dvdsle 16509	. . . . . . . . . . . . 13 ⊢ ((𝑑 ∈ ℤ ∧ 𝑛 ∈ ℕ) → (𝑑 ∥ 𝑛 → 𝑑 ≤ 𝑛))
16	14, 4, 15	syl2anr 609	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ 𝑑 ∈ ℕ) → (𝑑 ∥ 𝑛 → 𝑑 ≤ 𝑛))
17	16	impr 460	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑑 ≤ 𝑛)
18		fznnfl 14029	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℝ → (𝑛 ∈ (1...(⌊‘𝐴)) ↔ (𝑛 ∈ ℕ ∧ 𝑛 ≤ 𝐴)))
19	12, 18	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑛 ∈ (1...(⌊‘𝐴)) ↔ (𝑛 ∈ ℕ ∧ 𝑛 ≤ 𝐴)))
20	19	simplbda 505	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → 𝑛 ≤ 𝐴)
21	20	adantr 486	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑛 ≤ 𝐴)
22	9, 11, 13, 17, 21	letrd 11494	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) → 𝑑 ≤ 𝐴)
23	22	ex 418	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) → 𝑑 ≤ 𝐴))
24	23	pm4.71rd 572	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ↔ (𝑑 ≤ 𝐴 ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛))))
25		ancom 466	. . . . . . . . 9 ⊢ ((𝑑 ≤ 𝐴 ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ∧ 𝑑 ≤ 𝐴))
26		an32 659	. . . . . . . . 9 ⊢ (((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ∧ 𝑑 ≤ 𝐴) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛))
27	25, 26	bitri 278	. . . . . . . 8 ⊢ ((𝑑 ≤ 𝐴 ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛))
28	24, 27	bitrdi 290	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛)))
29		fznnfl 14029	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → (𝑑 ∈ (1...(⌊‘𝐴)) ↔ (𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴)))
30	12, 29	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝑑 ∈ (1...(⌊‘𝐴)) ↔ (𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴)))
31	30	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → (𝑑 ∈ (1...(⌊‘𝐴)) ↔ (𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴)))
32	31	anbi1d 643	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛) ↔ ((𝑑 ∈ ℕ ∧ 𝑑 ≤ 𝐴) ∧ 𝑑 ∥ 𝑛)))
33	28, 32	bitr4d 285	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (1...(⌊‘𝐴))) → ((𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)))
34	33	pm5.32da 590	. . . . 5 ⊢ (𝜑 → ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛))))
35		an12 658	. . . . 5 ⊢ ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛)))
36	34, 35	bitrdi 290	. . . 4 ⊢ (𝜑 → ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)) ↔ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛))))
37		breq1 5109	. . . . . 6 ⊢ (𝑥 = 𝑑 → (𝑥 ∥ 𝑛 ↔ 𝑑 ∥ 𝑛))
38	37	elrab 3648	. . . . 5 ⊢ (𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛} ↔ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛))
39	38	anbi2i 635	. . . 4 ⊢ ((𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}) ↔ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ (𝑑 ∈ ℕ ∧ 𝑑 ∥ 𝑛)))
40		breq2 5110	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑑 ∥ 𝑥 ↔ 𝑑 ∥ 𝑛))
41	40	elrab 3648	. . . . 5 ⊢ (𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥} ↔ (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∥ 𝑛))
42	41	anbi2i 635	. . . 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 15969	. 2 ⊢ (𝜑 → Σ𝑛 ∈ (1...(⌊‘𝐴))Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}𝐵)
46		dvdsflsumcom.1	. . . 4 ⊢ (𝑛 = (𝑑 · 𝑚) → 𝐵 = 𝐶)
47		fzfid 14143	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → (1...(⌊‘(𝐴 / 𝑑))) ∈ Fin)
48	12	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → 𝐴 ∈ ℝ)
49	30	simprbda 504	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → 𝑑 ∈ ℕ)
50		eqid 2763	. . . . 5 ⊢ (𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦)) = (𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦))
51	48, 49, 50	dvdsflf1o 27544	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → (𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦)):(1...(⌊‘(𝐴 / 𝑑)))⟶1-1onto{𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})
52		oveq2 7451	. . . . . 6 ⊢ (𝑦 = 𝑚 → (𝑑 · 𝑦) = (𝑑 · 𝑚))
53		ovex 7476	. . . . . 6 ⊢ (𝑑 · 𝑚) ∈ V
54	52, 50, 53	fvmpt 7016	. . . . 5 ⊢ (𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑))) → ((𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦))‘𝑚) = (𝑑 · 𝑚))
55	54	adantl 487	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) ∧ 𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))) → ((𝑦 ∈ (1...(⌊‘(𝐴 / 𝑑))) ↦ (𝑑 · 𝑦))‘𝑚) = (𝑑 · 𝑚))
56	43	biimpar 483	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})) → (𝑛 ∈ (1...(⌊‘𝐴)) ∧ 𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}))
57	56, 44	syldan 603	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ (1...(⌊‘𝐴)) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥})) → 𝐵 ∈ ℂ)
58	57	anassrs 473	. . . 4 ⊢ (((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) ∧ 𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}) → 𝐵 ∈ ℂ)
59	46, 47, 51, 55, 58	fsumf1o 15918	. . 3 ⊢ ((𝜑 ∧ 𝑑 ∈ (1...(⌊‘𝐴))) → Σ𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}𝐵 = Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)
60	59	sumeq2dv 15898	. 2 ⊢ (𝜑 → Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑛 ∈ {𝑥 ∈ (1...(⌊‘𝐴)) ∣ 𝑑 ∥ 𝑥}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)
61	45, 60	eqtrd 2798	1 ⊢ (𝜑 → Σ𝑛 ∈ (1...(⌊‘𝐴))Σ𝑑 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑛}𝐵 = Σ𝑑 ∈ (1...(⌊‘𝐴))Σ𝑚 ∈ (1...(⌊‘(𝐴 / 𝑑)))𝐶)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900   class class class wbr 5106   ↦ cmpt 5189  ‘cfv 6558  (class class class)co 7443  ℂcc 11225  ℝcr 11226  1c1 11228   · cmul 11232   ≤ cle 11371   / cdiv 12000  ℕcn 12362  ℤcz 12720  ...cfz 13666  ⌊cfl 13957  Σcsu 15882   ∥ cdvds 16451

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-inf2 9669  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-mulcom 11291  ax-addass 11292  ax-mulass 11293  ax-distr 11294  ax-i2m1 11295  ax-1ne0 11296  ax-1rid 11297  ax-rnegex 11298  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302  ax-pre-ltadd 11303  ax-pre-mulgt0 11304  ax-pre-sup 11305

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-isom 6567  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-er 8745  df-en 9002  df-dom 9003  df-sdom 9004  df-fin 9005  df-sup 9461  df-inf 9462  df-oi 9531  df-card 10047  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-sub 11570  df-neg 11571  df-div 12001  df-nn 12363  df-2 12432  df-3 12433  df-n0 12634  df-z 12721  df-uz 12993  df-rp 13148  df-fz 13667  df-fzo 13816  df-fl 13959  df-seq 14172  df-exp 14232  df-hash 14502  df-cj 15295  df-re 15296  df-im 15297  df-sqrt 15431  df-abs 15432  df-clim 15684  df-sum 15883  df-dvds 16452

This theorem is used by:  dchrmusum2  27851  dchrvmasumlem1  27852  dchrvmasum2lem  27853  dchrisum0  27877  mudivsum  27887  mulogsum  27889  mulog2sumlem2  27892  vmalogdivsum2  27895  selberglem3  27904  selberg  27905  selberg34r  27928  pntsval2  27933