Theorem fsumf1o 11786

Description: Re-index a finite sum using a bijection. (Contributed by Mario Carneiro, 20-Apr-2014.)

Hypotheses

Ref	Expression
fsumf1o.1	⊢ (𝑘 = 𝐺 → 𝐵 = 𝐷)
fsumf1o.2	⊢ (𝜑 → 𝐶 ∈ Fin)
fsumf1o.3	⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐴)
fsumf1o.4	⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → (𝐹‘𝑛) = 𝐺)
fsumf1o.5	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)

Assertion

Ref	Expression
fsumf1o	⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑛 ∈ 𝐶 𝐷)

Distinct variable groups:   𝑘,𝑛,𝐴   𝐵,𝑛   𝐶,𝑛   𝐷,𝑘   𝑛,𝐹   𝑘,𝐺   𝜑,𝑘,𝑛

Allowed substitution hints:   𝐵(𝑘)   𝐶(𝑘)   𝐷(𝑛)   𝐹(𝑘)   𝐺(𝑛)

Proof of Theorem fsumf1o

Dummy variables 𝑓 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sum0 11784	. . . 4 ⊢ Σ𝑘 ∈ ∅ 𝐵 = 0
2		fsumf1o.3	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐴)
3		f1oeq2 5528	. . . . . . . 8 ⊢ (𝐶 = ∅ → (𝐹:𝐶–1-1-onto→𝐴 ↔ 𝐹:∅–1-1-onto→𝐴))
4	2, 3	syl5ibcom 155	. . . . . . 7 ⊢ (𝜑 → (𝐶 = ∅ → 𝐹:∅–1-1-onto→𝐴))
5	4	imp 124	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐹:∅–1-1-onto→𝐴)
6		f1ofo 5546	. . . . . 6 ⊢ (𝐹:∅–1-1-onto→𝐴 → 𝐹:∅–onto→𝐴)
7		fo00 5576	. . . . . . 7 ⊢ (𝐹:∅–onto→𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
8	7	simprbi 275	. . . . . 6 ⊢ (𝐹:∅–onto→𝐴 → 𝐴 = ∅)
9	5, 6, 8	3syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐴 = ∅)
10	9	sumeq1d 11762	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = ∅) → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ ∅ 𝐵)
11		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = ∅) → 𝐶 = ∅)
12	11	sumeq1d 11762	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = ∅) → Σ𝑛 ∈ 𝐶 𝐷 = Σ𝑛 ∈ ∅ 𝐷)
13		sum0 11784	. . . . 5 ⊢ Σ𝑛 ∈ ∅ 𝐷 = 0
14	12, 13	eqtrdi 2255	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = ∅) → Σ𝑛 ∈ 𝐶 𝐷 = 0)
15	1, 10, 14	3eqtr4a 2265	. . 3 ⊢ ((𝜑 ∧ 𝐶 = ∅) → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑛 ∈ 𝐶 𝐷)
16	15	ex 115	. 2 ⊢ (𝜑 → (𝐶 = ∅ → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑛 ∈ 𝐶 𝐷))
17		2fveq3 5599	. . . . . . . 8 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘(𝑓‘𝑛))))
18		simprl 529	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → (♯‘𝐶) ∈ ℕ)
19		simprr 531	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)
20		f1of 5539	. . . . . . . . . . . 12 ⊢ (𝐹:𝐶–1-1-onto→𝐴 → 𝐹:𝐶⟶𝐴)
21	2, 20	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝐶⟶𝐴)
22	21	ffvelcdmda 5733	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐶) → (𝐹‘𝑚) ∈ 𝐴)
23		fsumf1o.5	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
24	23	fmpttd 5753	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
25	24	ffvelcdmda 5733	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹‘𝑚) ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) ∈ ℂ)
26	22, 25	syldan 282	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) ∈ ℂ)
27	26	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑚 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) ∈ ℂ)
28	2	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → 𝐹:𝐶–1-1-onto→𝐴)
29		f1oco 5562	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐶–1-1-onto→𝐴 ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶) → (𝐹 ∘ 𝑓):(1...(♯‘𝐶))–1-1-onto→𝐴)
30	28, 19, 29	syl2anc 411	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → (𝐹 ∘ 𝑓):(1...(♯‘𝐶))–1-1-onto→𝐴)
31		f1of 5539	. . . . . . . . . . 11 ⊢ ((𝐹 ∘ 𝑓):(1...(♯‘𝐶))–1-1-onto→𝐴 → (𝐹 ∘ 𝑓):(1...(♯‘𝐶))⟶𝐴)
32	30, 31	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → (𝐹 ∘ 𝑓):(1...(♯‘𝐶))⟶𝐴)
33		fvco3 5668	. . . . . . . . . 10 ⊢ (((𝐹 ∘ 𝑓):(1...(♯‘𝐶))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐶))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)))
34	32, 33	sylan 283	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(♯‘𝐶))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)))
35		f1of 5539	. . . . . . . . . . . 12 ⊢ (𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶 → 𝑓:(1...(♯‘𝐶))⟶𝐶)
36	35	ad2antll 491	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → 𝑓:(1...(♯‘𝐶))⟶𝐶)
37		fvco3 5668	. . . . . . . . . . 11 ⊢ ((𝑓:(1...(♯‘𝐶))⟶𝐶 ∧ 𝑛 ∈ (1...(♯‘𝐶))) → ((𝐹 ∘ 𝑓)‘𝑛) = (𝐹‘(𝑓‘𝑛)))
38	36, 37	sylan 283	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(♯‘𝐶))) → ((𝐹 ∘ 𝑓)‘𝑛) = (𝐹‘(𝑓‘𝑛)))
39	38	fveq2d 5598	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(♯‘𝐶))) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘(𝑓‘𝑛))))
40	34, 39	eqtrd 2239	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑛 ∈ (1...(♯‘𝐶))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘(𝑓‘𝑛))))
41	17, 18, 19, 27, 40	fsum3 11783	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → Σ𝑚 ∈ 𝐶 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐶), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛), 0)))‘(♯‘𝐶)))
42		eqid 2206	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑘 ∈ 𝐴 ↦ 𝐵)
43		fsumf1o.1	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝐺 → 𝐵 = 𝐷)
44		fsumf1o.4	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → (𝐹‘𝑛) = 𝐺)
45	21	ffvelcdmda 5733	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → (𝐹‘𝑛) ∈ 𝐴)
46	44, 45	eqeltrrd 2284	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → 𝐺 ∈ 𝐴)
47	43	eleq1d 2275	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝐺 → (𝐵 ∈ ℂ ↔ 𝐷 ∈ ℂ))
48	23	ralrimiva 2580	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
49	48	adantr 276	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
50	47, 49, 46	rspcdva 2886	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → 𝐷 ∈ ℂ)
51	42, 43, 46, 50	fvmptd3 5691	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝐺) = 𝐷)
52	44	fveq2d 5598	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝐺))
53		simpr 110	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → 𝑛 ∈ 𝐶)
54		eqid 2206	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ 𝐶 ↦ 𝐷) = (𝑛 ∈ 𝐶 ↦ 𝐷)
55	54	fvmpt2 5681	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ 𝐶 ∧ 𝐷 ∈ ℂ) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = 𝐷)
56	53, 50, 55	syl2anc 411	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = 𝐷)
57	51, 52, 56	3eqtr4rd 2250	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)))
58	57	ralrimiva 2580	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑛 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)))
59		nffvmpt1 5605	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚)
60	59	nfeq1 2359	. . . . . . . . . . 11 ⊢ Ⅎ𝑛((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚))
61		fveq2 5594	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑚 → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚))
62		2fveq3 5599	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑚 → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
63	61, 62	eqeq12d 2221	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑚 → (((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) ↔ ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚))))
64	60, 63	rspc 2875	. . . . . . . . . 10 ⊢ (𝑚 ∈ 𝐶 → (∀𝑛 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑛)) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚))))
65	58, 64	mpan9 281	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
66	65	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑚 ∈ 𝐶) → ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
67	66	sumeq2dv 11764	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → Σ𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = Σ𝑚 ∈ 𝐶 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝐹‘𝑚)))
68		fveq2 5594	. . . . . . . 8 ⊢ (𝑚 = ((𝐹 ∘ 𝑓)‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘((𝐹 ∘ 𝑓)‘𝑛)))
69	24	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
70	69	ffvelcdmda 5733	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) ∈ ℂ)
71	68, 18, 30, 70, 34	fsum3 11783	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐶), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ (𝐹 ∘ 𝑓))‘𝑛), 0)))‘(♯‘𝐶)))
72	41, 67, 71	3eqtr4rd 2250	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚))
73		sumfct 11770	. . . . . . . 8 ⊢ (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐵)
74	48, 73	syl 14	. . . . . . 7 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐵)
75	74	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐵)
76	50	ralrimiva 2580	. . . . . . . 8 ⊢ (𝜑 → ∀𝑛 ∈ 𝐶 𝐷 ∈ ℂ)
77		sumfct 11770	. . . . . . . 8 ⊢ (∀𝑛 ∈ 𝐶 𝐷 ∈ ℂ → Σ𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = Σ𝑛 ∈ 𝐶 𝐷)
78	76, 77	syl 14	. . . . . . 7 ⊢ (𝜑 → Σ𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = Σ𝑛 ∈ 𝐶 𝐷)
79	78	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → Σ𝑚 ∈ 𝐶 ((𝑛 ∈ 𝐶 ↦ 𝐷)‘𝑚) = Σ𝑛 ∈ 𝐶 𝐷)
80	72, 75, 79	3eqtr3d 2247	. . . . 5 ⊢ ((𝜑 ∧ ((♯‘𝐶) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)) → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑛 ∈ 𝐶 𝐷)
81	80	expr 375	. . . 4 ⊢ ((𝜑 ∧ (♯‘𝐶) ∈ ℕ) → (𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑛 ∈ 𝐶 𝐷))
82	81	exlimdv 1843	. . 3 ⊢ ((𝜑 ∧ (♯‘𝐶) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑛 ∈ 𝐶 𝐷))
83	82	expimpd 363	. 2 ⊢ (𝜑 → (((♯‘𝐶) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶) → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑛 ∈ 𝐶 𝐷))
84		fsumf1o.2	. . 3 ⊢ (𝜑 → 𝐶 ∈ Fin)
85		fz1f1o 11771	. . 3 ⊢ (𝐶 ∈ Fin → (𝐶 = ∅ ∨ ((♯‘𝐶) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)))
86	84, 85	syl 14	. 2 ⊢ (𝜑 → (𝐶 = ∅ ∨ ((♯‘𝐶) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐶))–1-1-onto→𝐶)))
87	16, 83, 86	mpjaod 720	1 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑛 ∈ 𝐶 𝐷)

Syntax hints:   → wi 4   ∧ wa 104   ∨ wo 710   = wceq 1373  ∃wex 1516   ∈ wcel 2177  ∀wral 2485  ∅c0 3464  ifcif 3575   class class class wbr 4054   ↦ cmpt 4116   ∘ ccom 4692  ⟶wf 5281  –onto→wfo 5283  –1-1-onto→wf1o 5284  ‘cfv 5285  (class class class)co 5962  Fincfn 6845  ℂcc 7953  0cc0 7955  1c1 7956   + caddc 7958   ≤ cle 8138  ℕcn 9066  ...cfz 10160  seqcseq 10624  ♯chash 10952  Σcsu 11749

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4170  ax-sep 4173  ax-nul 4181  ax-pow 4229  ax-pr 4264  ax-un 4493  ax-setind 4598  ax-iinf 4649  ax-cnex 8046  ax-resscn 8047  ax-1cn 8048  ax-1re 8049  ax-icn 8050  ax-addcl 8051  ax-addrcl 8052  ax-mulcl 8053  ax-mulrcl 8054  ax-addcom 8055  ax-mulcom 8056  ax-addass 8057  ax-mulass 8058  ax-distr 8059  ax-i2m1 8060  ax-0lt1 8061  ax-1rid 8062  ax-0id 8063  ax-rnegex 8064  ax-precex 8065  ax-cnre 8066  ax-pre-ltirr 8067  ax-pre-ltwlin 8068  ax-pre-lttrn 8069  ax-pre-apti 8070  ax-pre-ltadd 8071  ax-pre-mulgt0 8072  ax-pre-mulext 8073  ax-arch 8074  ax-caucvg 8075

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-if 3576  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3860  df-int 3895  df-iun 3938  df-br 4055  df-opab 4117  df-mpt 4118  df-tr 4154  df-id 4353  df-po 4356  df-iso 4357  df-iord 4426  df-on 4428  df-ilim 4429  df-suc 4431  df-iom 4652  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-iota 5246  df-fun 5287  df-fn 5288  df-f 5289  df-f1 5290  df-fo 5291  df-f1o 5292  df-fv 5293  df-isom 5294  df-riota 5917  df-ov 5965  df-oprab 5966  df-mpo 5967  df-1st 6244  df-2nd 6245  df-recs 6409  df-irdg 6474  df-frec 6495  df-1o 6520  df-oadd 6524  df-er 6638  df-en 6846  df-dom 6847  df-fin 6848  df-pnf 8139  df-mnf 8140  df-xr 8141  df-ltxr 8142  df-le 8143  df-sub 8275  df-neg 8276  df-reap 8678  df-ap 8685  df-div 8776  df-inn 9067  df-2 9125  df-3 9126  df-4 9127  df-n0 9326  df-z 9403  df-uz 9679  df-q 9771  df-rp 9806  df-fz 10161  df-fzo 10295  df-seqfrec 10625  df-exp 10716  df-ihash 10953  df-cj 11238  df-re 11239  df-im 11240  df-rsqrt 11394  df-abs 11395  df-clim 11675  df-sumdc 11750

This theorem is referenced by:  fisumss  11788  fsum2dlemstep  11830  fsumcnv  11833  fsumrev  11839  fsumshft  11840  phisum  12648  fsumdvdsmul  15548  sgmppw  15549