fsummulc2 - Intuitionistic Logic Explorer

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

Theorem fsummulc2 12234

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 8722	. . 3 ⊢ (𝜑 → (𝐶 · 0) = 0)
3		sumeq1 12140	. . . . . 6 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ ∅ 𝐵)
4		sum0 12174	. . . . . 6 ⊢ Σ𝑘 ∈ ∅ 𝐵 = 0
5	3, 4	eqtrdi 2287	. . . . 5 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 𝐵 = 0)
6	5	oveq2d 6101	. . . 4 ⊢ (𝐴 = ∅ → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = (𝐶 · 0))
7		sumeq1 12140	. . . . 5 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵) = Σ𝑘 ∈ ∅ (𝐶 · 𝐵))
8		sum0 12174	. . . . 5 ⊢ Σ𝑘 ∈ ∅ (𝐶 · 𝐵) = 0
9	7, 8	eqtrdi 2287	. . . 4 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵) = 0)
10	6, 9	eqeq12d 2253	. . 3 ⊢ (𝐴 = ∅ → ((𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵) ↔ (𝐶 · 0) = 0))
11	2, 10	syl5ibrcom 157	. 2 ⊢ (𝜑 → (𝐴 = ∅ → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵)))
12		addcl 8305	. . . . . . . . 9 ⊢ ((𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ) → (𝑢 + 𝑣) ∈ ℂ)
13	12	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → (𝑢 + 𝑣) ∈ ℂ)
14	1	ad2antrr 492	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → 𝐶 ∈ ℂ)
15		simprl 535	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → 𝑢 ∈ ℂ)
16		simprr 537	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → 𝑣 ∈ ℂ)
17	14, 15, 16	adddid 8351	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → (𝐶 · (𝑢 + 𝑣)) = ((𝐶 · 𝑢) + (𝐶 · 𝑣)))
18		simprl 535	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (♯‘𝐴) ∈ ℕ)
19		nnuz 9968	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
20	18, 19	eleqtrdi 2331	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (♯‘𝐴) ∈ (ℤ_≥‘1))
21		elnnuz 9969	. . . . . . . . . . . 12 ⊢ (𝑢 ∈ ℕ ↔ 𝑢 ∈ (ℤ_≥‘1))
22	21	biimpri 133	. . . . . . . . . . 11 ⊢ (𝑢 ∈ (ℤ_≥‘1) → 𝑢 ∈ ℕ)
23	22	adantl 277	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → 𝑢 ∈ ℕ)
24		f1of 5639	. . . . . . . . . . . . . . 15 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑓:(1...(♯‘𝐴))⟶𝐴)
25	24	ad2antll 495	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
26	25	ad2antrr 492	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
27		1zzd 9676	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 1 ∈ ℤ)
28	18	ad2antrr 492	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ)
29	28	nnzd 9772	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℤ)
30		eluzelz 9941	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∈ (ℤ_≥‘1) → 𝑢 ∈ ℤ)
31	30	ad2antlr 493	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝑢 ∈ ℤ)
32	27, 29, 31	3jca 1208	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑢 ∈ ℤ))
33		eluzle 9944	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∈ (ℤ_≥‘1) → 1 ≤ 𝑢)
34	33	ad2antlr 493	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 1 ≤ 𝑢)
35		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝑢 ≤ (♯‘𝐴))
36	34, 35	jca 306	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (1 ≤ 𝑢 ∧ 𝑢 ≤ (♯‘𝐴)))
37		elfz2 10429	. . . . . . . . . . . . . 14 ⊢ (𝑢 ∈ (1...(♯‘𝐴)) ↔ ((1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑢 ∈ ℤ) ∧ (1 ≤ 𝑢 ∧ 𝑢 ≤ (♯‘𝐴))))
38	32, 36, 37	sylanbrc 421	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝑢 ∈ (1...(♯‘𝐴)))
39		fvco3 5776	. . . . . . . . . . . . 13 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑢 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)))
40	26, 38, 39	syl2anc 415	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)))
41	26, 38	ffvelcdmd 5844	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (𝑓‘𝑢) ∈ 𝐴)
42		fsummulc2.3	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
43	42	ralrimiva 2623	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
44	43	ad3antrrr 496	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
45		nfcsb1v 3180	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘⦋(𝑓‘𝑢) / 𝑘⦌𝐵
46	45	nfel1 2403	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ
47		csbeq1a 3156	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = (𝑓‘𝑢) → 𝐵 = ⦋(𝑓‘𝑢) / 𝑘⦌𝐵)
48	47	eleq1d 2307	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = (𝑓‘𝑢) → (𝐵 ∈ ℂ ↔ ⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ))
49	46, 48	rspc 2923	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑢) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → ⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ))
50	41, 44, 49	sylc 62	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ)
51		eqid 2238	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑘 ∈ 𝐴 ↦ 𝐵)
52	51	fvmpts 5783	. . . . . . . . . . . . . 14 ⊢ (((𝑓‘𝑢) ∈ 𝐴 ∧ ⦋(𝑓‘𝑢) / 𝑘⦌𝐵 ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)) = ⦋(𝑓‘𝑢) / 𝑘⦌𝐵)
53	41, 50, 52	syl2anc 415	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)) = ⦋(𝑓‘𝑢) / 𝑘⦌𝐵)
54	53, 50	eqeltrd 2315	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑢)) ∈ ℂ)
55	40, 54	eqeltrd 2315	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢) ∈ ℂ)
56		0cnd 8320	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → 0 ∈ ℂ)
57	23	nnzd 9772	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → 𝑢 ∈ ℤ)
58	18	adantr 276	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → (♯‘𝐴) ∈ ℕ)
59	58	nnzd 9772	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → (♯‘𝐴) ∈ ℤ)
60		zdcle 9726	. . . . . . . . . . . 12 ⊢ ((𝑢 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ) → DECID 𝑢 ≤ (♯‘𝐴))
61	57, 59, 60	syl2anc 415	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → DECID 𝑢 ≤ (♯‘𝐴))
62	55, 56, 61	ifcldadc 3670	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) ∈ ℂ)
63		breq1 4133	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑢 → (𝑛 ≤ (♯‘𝐴) ↔ 𝑢 ≤ (♯‘𝐴)))
64		fveq2 5695	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑢 → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢))
65	63, 64	ifbieq1d 3663	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑢 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0))
66		eqid 2238	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))
67	65, 66	fvmptg 5781	. . . . . . . . . 10 ⊢ ((𝑢 ∈ ℕ ∧ if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) ∈ ℂ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0))
68	23, 62, 67	syl2anc 415	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0))
69	68, 62	eqeltrd 2315	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢) ∈ ℂ)
70		csbov2g 6127	. . . . . . . . . . . 12 ⊢ ((𝑓‘𝑢) ∈ 𝐴 → ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵) = (𝐶 · ⦋(𝑓‘𝑢) / 𝑘⦌𝐵))
71	41, 70	syl 14	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵) = (𝐶 · ⦋(𝑓‘𝑢) / 𝑘⦌𝐵))
72	35	iftrued 3647	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢))
73		fvco3 5776	. . . . . . . . . . . . 13 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑢 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)))
74	26, 38, 73	syl2anc 415	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)))
75	1	ad3antrrr 496	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → 𝐶 ∈ ℂ)
76	75, 50	mulcld 8347	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (𝐶 · ⦋(𝑓‘𝑢) / 𝑘⦌𝐵) ∈ ℂ)
77	71, 76	eqeltrd 2315	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵) ∈ ℂ)
78		eqid 2238	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) = (𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))
79	78	fvmpts 5783	. . . . . . . . . . . . 13 ⊢ (((𝑓‘𝑢) ∈ 𝐴 ∧ ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵) ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)) = ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵))
80	41, 77, 79	syl2anc 415	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)) = ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵))
81	72, 74, 80	3eqtrd 2275	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = ⦋(𝑓‘𝑢) / 𝑘⦌(𝐶 · 𝐵))
82	35	iftrued 3647	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) = (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢))
83	82, 40, 53	3eqtrd 2275	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) = ⦋(𝑓‘𝑢) / 𝑘⦌𝐵)
84	83	oveq2d 6101	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)) = (𝐶 · ⦋(𝑓‘𝑢) / 𝑘⦌𝐵))
85	71, 81, 84	3eqtr4d 2281	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)))
86	1	ad3antrrr 496	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → 𝐶 ∈ ℂ)
87	86	mul01d 8722	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → (𝐶 · 0) = 0)
88		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → ¬ 𝑢 ≤ (♯‘𝐴))
89	88	iffalsed 3650	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0) = 0)
90	89	oveq2d 6101	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)) = (𝐶 · 0))
91	88	iffalsed 3650	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = 0)
92	87, 90, 91	3eqtr4rd 2282	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑢 ≤ (♯‘𝐴)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)))
93		exmiddc 848	. . . . . . . . . . 11 ⊢ (DECID 𝑢 ≤ (♯‘𝐴) → (𝑢 ≤ (♯‘𝐴) ∨ ¬ 𝑢 ≤ (♯‘𝐴)))
94	61, 93	syl 14	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → (𝑢 ≤ (♯‘𝐴) ∨ ¬ 𝑢 ≤ (♯‘𝐴)))
95	85, 92, 94	mpjaodan 810	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) = (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)))
96	80, 77	eqeltrd 2315	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑢)) ∈ ℂ)
97	74, 96	eqeltrd 2315	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) ∧ 𝑢 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢) ∈ ℂ)
98	97, 56, 61	ifcldadc 3670	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) ∈ ℂ)
99		fveq2 5695	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑢 → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢))
100	63, 99	ifbieq1d 3663	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑢 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0))
101		eqid 2238	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0))
102	100, 101	fvmptg 5781	. . . . . . . . . 10 ⊢ ((𝑢 ∈ ℕ ∧ if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0) ∈ ℂ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0))‘𝑢) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0))
103	23, 98, 102	syl2anc 415	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0))‘𝑢) = if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑢), 0))
104	68	oveq2d 6101	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → (𝐶 · ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢)) = (𝐶 · if(𝑢 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑢), 0)))
105	95, 103, 104	3eqtr4d 2281	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑢 ∈ (ℤ_≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0))‘𝑢) = (𝐶 · ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))‘𝑢)))
106		mulcl 8307	. . . . . . . . 9 ⊢ ((𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ) → (𝑢 · 𝑣) ∈ ℂ)
107	106	adantl 277	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ (𝑢 ∈ ℂ ∧ 𝑣 ∈ ℂ)) → (𝑢 · 𝑣) ∈ ℂ)
108	1	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝐶 ∈ ℂ)
109	13, 17, 20, 69, 105, 107, 108	seq3distr 10984	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)) = (𝐶 · (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴))))
110		fveq2 5695	. . . . . . . 8 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑛)))
111		simprr 537	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)
112	1	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
113	112, 42	mulcld 8347	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐶 · 𝐵) ∈ ℂ)
114	113	fmpttd 5863	. . . . . . . . . 10 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)):𝐴⟶ℂ)
115	114	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)):𝐴⟶ℂ)
116	115	ffvelcdmda 5843	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) ∈ ℂ)
117		fvco3 5776	. . . . . . . . 9 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑛)))
118	25, 117	sylan 283	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘(𝑓‘𝑛)))
119	110, 18, 111, 116, 118	fsum3 12173	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵)) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)))
120		fveq2 5695	. . . . . . . . 9 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
121	42	fmpttd 5863	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
122	121	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
123	122	ffvelcdmda 5843	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) ∈ ℂ)
124		fvco3 5776	. . . . . . . . . 10 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
125	25, 124	sylan 283	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
126	120, 18, 111, 123, 125	fsum3 12173	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)))
127	126	oveq2d 6101	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝐶 · Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚)) = (𝐶 · (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴))))
128	109, 119, 127	3eqtr4rd 2282	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝐶 · Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚)) = Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚))
129		sumfct 12159	. . . . . . . . 9 ⊢ (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐵)
130	43, 129	syl 14	. . . . . . . 8 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐵)
131	130	oveq2d 6101	. . . . . . 7 ⊢ (𝜑 → (𝐶 · Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚)) = (𝐶 · Σ𝑘 ∈ 𝐴 𝐵))
132	131	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝐶 · Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚)) = (𝐶 · Σ𝑘 ∈ 𝐴 𝐵))
133	113	ralrimiva 2623	. . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 (𝐶 · 𝐵) ∈ ℂ)
134		sumfct 12159	. . . . . . . 8 ⊢ (∀𝑘 ∈ 𝐴 (𝐶 · 𝐵) ∈ ℂ → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))
135	133, 134	syl 14	. . . . . . 7 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))
136	135	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐶 · 𝐵))‘𝑚) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))
137	128, 132, 136	3eqtr3d 2279	. . . . 5 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))
138	137	expr 375	. . . 4 ⊢ ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵)))
139	138	exlimdv 1872	. . 3 ⊢ ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵)))
140	139	expimpd 363	. 2 ⊢ (𝜑 → (((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵)))
141		fsummulc2.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ Fin)
142		fz1f1o 12160	. . 3 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))
143	141, 142	syl 14	. 2 ⊢ (𝜑 → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))
144	11, 140, 143	mpjaod 730	1 ⊢ (𝜑 → (𝐶 · Σ𝑘 ∈ 𝐴 𝐵) = Σ𝑘 ∈ 𝐴 (𝐶 · 𝐵))

Colors of variables: wff set class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 720 DECID wdc 846 ∧ w3a 1009 = wceq 1402 ∃wex 1545 ∈ wcel 2209 ∀wral 2528 ⦋csb 3147 ∅c0 3520 ifcif 3638 class class class wbr 4130 ↦ cmpt 4192 ∘ ccom 4778 ⟶wf 5373 –1-1-onto→wf1o 5376 ‘cfv 5377 (class class class)co 6085 Fincfn 7022 ℂcc 8178 0cc0 8180 1c1 8181 + caddc 8183 · cmul 8185 ≤ cle 8362 ℕcn 9307 ℤcz 9649 ℤ_≥cuz 9931 ...cfz 10422 seqcseq 10899 ♯chash 11230 Σcsu 12138

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 ax-arch 8299 ax-caucvg 8300

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-isom 5386 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-frec 6662 df-1o 6687 df-oadd 6691 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-n0 9569 df-z 9650 df-uz 9932 df-q 10030 df-rp 10066 df-fz 10423 df-fzo 10561 df-seqfrec 10900 df-exp 10991 df-ihash 11231 df-cj 11623 df-re 11624 df-im 11625 df-rsqrt 11780 df-abs 11781 df-clim 12064 df-sumdc 12139

This theorem is used by: fsummulc1 12235 fsumneg 12237 fsum2mul 12239 cvgratnnlemabsle 12313 mertensabs 12323 eirraplem 12563 fsumdvdsmul 16246

W3C validator