fsummulc2 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > fsummulc2		GIF version

Theorem fsummulc2 11217

Description: A finite sum multiplied by a constant. (Contributed by NM, 12-Nov-2005.) (Revised by Mario Carneiro, 24-Apr-2014.)

**Hypotheses**
Ref	Expression
fsummulc2.1	⊢ (𝜑 → 𝐴 ∈ Fin)
fsummulc2.2	⊢ (𝜑 → 𝐶 ∈ ℂ)
fsummulc2.3	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)

**Assertion**
Ref	Expression
fsummulc2	⊢ (𝜑 → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))

Distinct variable groups: 𝐴,𝑘 𝐶,𝑘 𝜑,𝑘 Allowed substitution hint: 𝐵(𝑘)

Proof of Theorem fsummulc2 Dummy variables 𝑓 𝑚 𝑛 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fsummulc2.2	. . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ)
2	1	mul01d 8155	. . 3 ⊢ (𝜑 → (𝐶 · 0) = 0)
3		sumeq1 11124	. . . . . 6 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ ∅ 𝐵)
4		sum0 11157	. . . . . 6 ⊢ Σ𝑘 ∈ ∅ 𝐵 = 0
5	3, 4	syl6eq 2188	. . . . 5 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 𝐵 = 0)
6	5	oveq2d 5790	. . . 4 ⊢ (𝐴 = ∅ → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = (𝐶 · 0))
7		sumeq1 11124	. . . . 5 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵) = Σ𝑘 ∈ ∅ (𝐶 · 𝐵))
8		sum0 11157	. . . . 5 ⊢ Σ𝑘 ∈ ∅ (𝐶 · 𝐵) = 0
9	7, 8	syl6eq 2188	. . . 4 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵) = 0)
10	6, 9	eqeq12d 2154	. . 3 ⊢ (𝐴 = ∅ → ((𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵) ↔ (𝐶 · 0) = 0))
11	2, 10	syl5ibrcom 156	. 2 ⊢ (𝜑 → (𝐴 = ∅ → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵)))
12		addcl 7745	. . . . . . . . 9 ⊢ ((𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ) → (𝑢 + 𝑣) ∈ ℂ)
13	12	adantl 275	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → (𝑢 + 𝑣) ∈ ℂ)
14	1	ad2antrr 479	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → 𝐶 ∈ ℂ)
15		simprl 520	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → 𝑢 ∈ ℂ)
16		simprr 521	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → 𝑣 ∈ ℂ)
17	14, 15, 16	adddid 7790	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → (𝐶 · (𝑢 + 𝑣)) = ((𝐶 · 𝑢) + (𝐶 · 𝑣)))
18		simprl 520	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (♯‘𝐴) ∈ ℕ)
19		nnuz 9361	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
20	18, 19	eleqtrdi 2232	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (♯‘𝐴) ∈ (ℤ_≥‘1))
21		elnnuz 9362	. . . . . . . . . . . 12 ⊢ (𝑢 ∈ ℕ ↔ 𝑢 ∈ (ℤ_≥‘1))
22	21	biimpri 132	. . . . . . . . . . 11 ⊢ (𝑢 ∈ (ℤ_≥‘1) → 𝑢 ∈ ℕ)
23	22	adantl 275	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → 𝑢 ∈ ℕ)
24		f1of 5367	. . . . . . . . . . . . . . 15 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑓:(1...(♯‘𝐴))⟶𝐴)
25	24	ad2antll 482	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
26	25	ad2antrr 479	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
27		1zzd 9081	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 1 ∈ ℤ)
28	18	ad2antrr 479	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ)
29	28	nnzd 9172	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℤ)
30		eluzelz 9335	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∈ (ℤ_≥‘1) → 𝑢 ∈ ℤ)
31	30	ad2antlr 480	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝑢 ∈ ℤ)
32	27, 29, 31	3jca 1161	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑢 ∈ ℤ))
33		eluzle 9338	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∈ (ℤ_≥‘1) → 1 ≤ 𝑢)
34	33	ad2antlr 480	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 1 ≤ 𝑢)
35		simpr 109	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝑢 ≤ (♯‘𝐴))
36	34, 35	jca 304	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (1 ≤ 𝑢 ∧ 𝑢 ≤ (♯‘𝐴)))
37		elfz2 9797	. . . . . . . . . . . . . 14 ⊢ (𝑢 ∈ (1...(♯‘𝐴)) ↔ ((1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑢 ∈ ℤ) ∧ (1 ≤ 𝑢 ∧ 𝑢 ≤ (♯‘𝐴))))
38	32, 36, 37	sylanbrc 413	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝑢 ∈ (1...(♯‘𝐴)))
39		fvco3 5492	. . . . . . . . . . . . 13 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑢 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)))
40	26, 38, 39	syl2anc 408	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)))
41	26, 38	ffvelrnd 5556	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (𝑓‘𝑢) ∈ 𝐴)
42		fsummulc2.3	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
43	42	ralrimiva 2505	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
44	43	ad3antrrr 483	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
45		nfcsb1v 3035	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘⦋(𝑓‘𝑢) / 𝑘⦌𝐵
46	45	nfel1 2292	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ
47		csbeq1a 3012	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = (𝑓‘𝑢) → 𝐵 = ⦋(𝑓‘𝑢) / 𝑘⦌𝐵)
48	47	eleq1d 2208	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = (𝑓‘𝑢) → (𝐵 ∈ ℂ ↔ ⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ))
49	46, 48	rspc 2783	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑢) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ))
50	41, 44, 49	sylc 62	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ)
51		eqid 2139	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑘 ∈ 𝐴 ↦ 𝐵)
52	51	fvmpts 5499	. . . . . . . . . . . . . 14 ⊢ (((𝑓‘𝑢) ∈ 𝐴 ∧ ⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)) = ⦋(𝑓‘𝑢) / 𝑘⦌𝐵)
53	41, 50, 52	syl2anc 408	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)) = ⦋(𝑓‘𝑢) / 𝑘⦌𝐵)
54	53, 50	eqeltrd 2216	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)) ∈ ℂ)
55	40, 54	eqeltrd 2216	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢) ∈ ℂ)
56		0cnd 7759	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → 0 ∈ ℂ)
57	23	nnzd 9172	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → 𝑢 ∈ ℤ)
58	18	adantr 274	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → (♯‘𝐴) ∈ ℕ)
59	58	nnzd 9172	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → (♯‘𝐴) ∈ ℤ)
60		zdcle 9127	. . . . . . . . . . . 12 ⊢ ((𝑢 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ) → DECID 𝑢 ≤ (♯‘𝐴))
61	57, 59, 60	syl2anc 408	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → DECID 𝑢 ≤ (♯‘𝐴))
62	55, 56, 61	ifcldadc 3501	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) ∈ ℂ)
63		breq1 3932	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑢 → (𝑛 ≤ (♯‘𝐴) ↔ 𝑢 ≤ (♯‘𝐴)))
64		fveq2 5421	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑢 → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢))
65	63, 64	ifbieq1d 3494	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑢 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0))
66		eqid 2139	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))
67	65, 66	fvmptg 5497	. . . . . . . . . 10 ⊢ ((𝑢 ∈ ℕ ∧ if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) ∈ ℂ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0))
68	23, 62, 67	syl2anc 408	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0))
69	68, 62	eqeltrd 2216	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢) ∈ ℂ)
70		csbov2g 5812	. . . . . . . . . . . 12 ⊢ ((𝑓‘𝑢) ∈ 𝐴 → ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵) = (𝐶 · ⦋(𝑓‘𝑢) / 𝑘⦌𝐵))
71	41, 70	syl 14	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵) = (𝐶 · ⦋(𝑓‘𝑢) / 𝑘⦌𝐵))
72	35	iftrued 3481	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢))
73		fvco3 5492	. . . . . . . . . . . . 13 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑢 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)))
74	26, 38, 73	syl2anc 408	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)))
75	1	ad3antrrr 483	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝐶 ∈ ℂ)
76	75, 50	mulcld 7786	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (𝐶 · ⦋(𝑓‘𝑢) / 𝑘⦌𝐵) ∈ ℂ)
77	71, 76	eqeltrd 2216	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵) ∈ ℂ)
78		eqid 2139	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) = (𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))
79	78	fvmpts 5499	. . . . . . . . . . . . 13 ⊢ (((𝑓‘𝑢) ∈ 𝐴 ∧ ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵) ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)) = ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵))
80	41, 77, 79	syl2anc 408	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)) = ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵))
81	72, 74, 80	3eqtrd 2176	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵))
82	35	iftrued 3481	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) = (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢))
83	82, 40, 53	3eqtrd 2176	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) = ⦋(𝑓‘𝑢) / 𝑘⦌𝐵)
84	83	oveq2d 5790	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)) = (𝐶 · ⦋(𝑓‘𝑢) / 𝑘⦌𝐵))
85	71, 81, 84	3eqtr4d 2182	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)))
86	1	ad3antrrr 483	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → 𝐶 ∈ ℂ)
87	86	mul01d 8155	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → (𝐶 · 0) = 0)
88		simpr 109	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → ¬ 𝑢 ≤ (♯‘𝐴))
89	88	iffalsed 3484	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) = 0)
90	89	oveq2d 5790	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)) = (𝐶 · 0))
91	88	iffalsed 3484	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = 0)
92	87, 90, 91	3eqtr4rd 2183	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)))
93		exmiddc 821	. . . . . . . . . . 11 ⊢ (DECID 𝑢 ≤ (♯‘𝐴) → (𝑢 ≤ (♯‘𝐴) ∨ ¬ 𝑢 ≤ (♯‘𝐴)))
94	61, 93	syl 14	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → (𝑢 ≤ (♯‘𝐴) ∨ ¬ 𝑢 ≤ (♯‘𝐴)))
95	85, 92, 94	mpjaodan 787	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)))
96	80, 77	eqeltrd 2216	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)) ∈ ℂ)
97	74, 96	eqeltrd 2216	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢) ∈ ℂ)
98	97, 56, 61	ifcldadc 3501	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) ∈ ℂ)
99		fveq2 5421	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑢 → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢))
100	63, 99	ifbieq1d 3494	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑢 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0))
101		eqid 2139	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0))
102	100, 101	fvmptg 5497	. . . . . . . . . 10 ⊢ ((𝑢 ∈ ℕ ∧ if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) ∈ ℂ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0))‘𝑢) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0))
103	23, 98, 102	syl2anc 408	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0))‘𝑢) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0))
104	68	oveq2d 5790	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → (𝐶 · ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢)) = (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)))
105	95, 103, 104	3eqtr4d 2182	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0))‘𝑢) = (𝐶 · ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢)))
106		mulcl 7747	. . . . . . . . 9 ⊢ ((𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ) → (𝑢 · 𝑣) ∈ ℂ)
107	106	adantl 275	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → (𝑢 · 𝑣) ∈ ℂ)
108	1	adantr 274	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝐶 ∈ ℂ)
109	13, 17, 20, 69, 105, 107, 108	seq3distr 10286	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)) = (𝐶 · (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴))))
110		fveq2 5421	. . . . . . . 8 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑛)))
111		simprr 521	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)
112	1	adantr 274	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
113	112, 42	mulcld 7786	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℂ)
114	113	fmpttd 5575	. . . . . . . . . 10 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)):𝐴⟶ℂ)
115	114	adantr 274	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)):𝐴⟶ℂ)
116	115	ffvelrnda 5555	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) ∈ ℂ)
117		fvco3 5492	. . . . . . . . 9 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑛)))
118	25, 117	sylan 281	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑛)))
119	110, 18, 111, 116, 118	fsum3 11156	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)))
120		fveq2 5421	. . . . . . . . 9 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
121	42	fmpttd 5575	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
122	121	adantr 274	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
123	122	ffvelrnda 5555	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) ∈ ℂ)
124		fvco3 5492	. . . . . . . . . 10 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
125	25, 124	sylan 281	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
126	120, 18, 111, 123, 125	fsum3 11156	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)))
127	126	oveq2d 5790	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝐶 · Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚)) = (𝐶 · (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴))))
128	109, 119, 127	3eqtr4rd 2183	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝐶 · Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚)) = Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚))
129		sumfct 11143	. . . . . . . . 9 ⊢ (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐵)
130	43, 129	syl 14	. . . . . . . 8 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐵)
131	130	oveq2d 5790	. . . . . . 7 ⊢ (𝜑 → (𝐶 · Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚)) = (𝐶 · Σ𝑘 ∈ 𝐴 𝐵))
132	131	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝐶 · Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚)) = (𝐶 · Σ𝑘 ∈ 𝐴 𝐵))
133	113	ralrimiva 2505	. . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 (𝐶 · 𝐵) ∈ ℂ)
134		sumfct 11143	. . . . . . . 8 ⊢ (∀𝑘 ∈ 𝐴 (𝐶 · 𝐵) ∈ ℂ → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))
135	133, 134	syl 14	. . . . . . 7 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))
136	135	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))
137	128, 132, 136	3eqtr3d 2180	. . . . 5 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))
138	137	expr 372	. . . 4 ⊢ ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵)))
139	138	exlimdv 1791	. . 3 ⊢ ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵)))
140	139	expimpd 360	. 2 ⊢ (𝜑 → (((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵)))
141		fsummulc2.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ Fin)
142		fz1f1o 11144	. . 3 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))
143	141, 142	syl 14	. 2 ⊢ (𝜑 → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))
144	11, 140, 143	mpjaod 707	1 ⊢ (𝜑 → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ∨ wo 697 DECID wdc 819 ∧ w3a 962 = wceq 1331 ∃wex 1468 ∈ wcel 1480 ∀wral 2416 ⦋csb 3003 ∅c0 3363 ifcif 3474 class class class wbr 3929 ↦ cmpt 3989 ∘ ccom 4543 ⟶wf 5119 –1-1-onto→wf1o 5122 ‘cfv 5123 (class class class)co 5774 Fincfn 6634 ℂcc 7618 0cc0 7620 1c1 7621 + caddc 7623 · cmul 7625 ≤ cle 7801 ℕcn 8720 ℤcz 9054 ℤ_≥cuz 9326 ...cfz 9790 seqcseq 10218 ♯chash 10521 Σcsu 11122

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-mulrcl 7719 ax-addcom 7720 ax-mulcom 7721 ax-addass 7722 ax-mulass 7723 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-1rid 7727 ax-0id 7728 ax-rnegex 7729 ax-precex 7730 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-apti 7735 ax-pre-ltadd 7736 ax-pre-mulgt0 7737 ax-pre-mulext 7738 ax-arch 7739 ax-caucvg 7740

This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rmo 2424 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-if 3475 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-po 4218 df-iso 4219 df-iord 4288 df-on 4290 df-ilim 4291 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-isom 5132 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-irdg 6267 df-frec 6288 df-1o 6313 df-oadd 6317 df-er 6429 df-en 6635 df-dom 6636 df-fin 6637 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-reap 8337 df-ap 8344 df-div 8433 df-inn 8721 df-2 8779 df-3 8780 df-4 8781 df-n0 8978 df-z 9055 df-uz 9327 df-q 9412 df-rp 9442 df-fz 9791 df-fzo 9920 df-seqfrec 10219 df-exp 10293 df-ihash 10522 df-cj 10614 df-re 10615 df-im 10616 df-rsqrt 10770 df-abs 10771 df-clim 11048 df-sumdc 11123

This theorem is referenced by: fsummulc1 11218 fsumneg 11220 fsum2mul 11222 cvgratnnlemabsle 11296 mertensabs 11306 eirraplem 11483

W3C validator