fsumadd - Intuitionistic Logic Explorer

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

Theorem fsumadd 11659

Description: The sum of two finite sums. (Contributed by NM, 14-Nov-2005.) (Revised by Mario Carneiro, 22-Apr-2014.)

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

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

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

Proof of Theorem fsumadd Dummy variables 𝑓 𝑗 𝑛 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		00id 8212	. . . . 5 ⊢ (0 + 0) = 0
2		sum0 11641	. . . . . 6 ⊢ Σ𝑘 ∈ ∅ 𝐵 = 0
3		sum0 11641	. . . . . 6 ⊢ Σ𝑘 ∈ ∅ 𝐶 = 0
4	2, 3	oveq12i 5955	. . . . 5 ⊢ (Σ𝑘 ∈ ∅ 𝐵 + Σ𝑘 ∈ ∅ 𝐶) = (0 + 0)
5		sum0 11641	. . . . 5 ⊢ Σ𝑘 ∈ ∅ (𝐵 + 𝐶) = 0
6	1, 4, 5	3eqtr4ri 2236	. . . 4 ⊢ Σ𝑘 ∈ ∅ (𝐵 + 𝐶) = (Σ𝑘 ∈ ∅ 𝐵 + Σ𝑘 ∈ ∅ 𝐶)
7		sumeq1 11608	. . . 4 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶) = Σ𝑘 ∈ ∅ (𝐵 + 𝐶))
8		sumeq1 11608	. . . . 5 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ ∅ 𝐵)
9		sumeq1 11608	. . . . 5 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 𝐶 = Σ𝑘 ∈ ∅ 𝐶)
10	8, 9	oveq12d 5961	. . . 4 ⊢ (𝐴 = ∅ → (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶) = (Σ𝑘 ∈ ∅ 𝐵 + Σ𝑘 ∈ ∅ 𝐶))
11	6, 7, 10	3eqtr4a 2263	. . 3 ⊢ (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶) = (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶))
12	11	a1i 9	. 2 ⊢ (𝜑 → (𝐴 = ∅ → Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶) = (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶)))
13		simprl 529	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (♯‘𝐴) ∈ ℕ)
14		nnuz 9683	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
15	13, 14	eleqtrdi 2297	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (♯‘𝐴) ∈ (ℤ_≥‘1))
16		eqid 2204	. . . . . . . . . 10 ⊢ (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0))
17		breq1 4046	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑛 → (𝑗 ≤ (♯‘𝐴) ↔ 𝑛 ≤ (♯‘𝐴)))
18		fveq2 5575	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑛 → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗) = (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛))
19	17, 18	ifbieq1d 3592	. . . . . . . . . 10 ⊢ (𝑗 = 𝑛 → if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0) = if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))
20		elnnuz 9684	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ ↔ 𝑛 ∈ (ℤ_≥‘1))
21	20	biimpri 133	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ_≥‘1) → 𝑛 ∈ ℕ)
22	21	adantl 277	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → 𝑛 ∈ ℕ)
23		fsumadd.2	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
24	23	adantlr 477	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
25	24	fmpttd 5734	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ)
26		simprr 531	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)
27		f1of 5521	. . . . . . . . . . . . . . 15 ⊢ (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑓:(1...(♯‘𝐴))⟶𝐴)
28	26, 27	syl 14	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
29		fco 5440	. . . . . . . . . . . . . 14 ⊢ (((𝑘 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℂ ∧ 𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
30	25, 28, 29	syl2anc 411	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
31	30	ad2antrr 488	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
32		1zzd 9398	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → 1 ∈ ℤ)
33	13	ad2antrr 488	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℕ)
34	33	nnzd 9493	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (♯‘𝐴) ∈ ℤ)
35		eluzelz 9656	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ_≥‘1) → 𝑛 ∈ ℤ)
36	35	ad2antlr 489	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → 𝑛 ∈ ℤ)
37	32, 34, 36	3jca 1179	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑛 ∈ ℤ))
38		eluzle 9659	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ_≥‘1) → 1 ≤ 𝑛)
39	38	ad2antlr 489	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → 1 ≤ 𝑛)
40		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → 𝑛 ≤ (♯‘𝐴))
41	39, 40	jca 306	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (1 ≤ 𝑛 ∧ 𝑛 ≤ (♯‘𝐴)))
42		elfz2 10136	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (1...(♯‘𝐴)) ↔ ((1 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ (1 ≤ 𝑛 ∧ 𝑛 ≤ (♯‘𝐴))))
43	37, 41, 42	sylanbrc 417	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → 𝑛 ∈ (1...(♯‘𝐴)))
44	31, 43	ffvelcdmd 5715	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) ∈ ℂ)
45		0cnd 8064	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑛 ≤ (♯‘𝐴)) → 0 ∈ ℂ)
46	22	nnzd 9493	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → 𝑛 ∈ ℤ)
47	13	adantr 276	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → (♯‘𝐴) ∈ ℕ)
48	47	nnzd 9493	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → (♯‘𝐴) ∈ ℤ)
49		zdcle 9448	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℤ ∧ (♯‘𝐴) ∈ ℤ) → DECID 𝑛 ≤ (♯‘𝐴))
50	46, 48, 49	syl2anc 411	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → DECID 𝑛 ≤ (♯‘𝐴))
51	44, 45, 50	ifcldadc 3599	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) ∈ ℂ)
52	16, 19, 22, 51	fvmptd3 5672	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → ((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0))‘𝑛) = if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))
53	52, 51	eqeltrd 2281	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → ((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0))‘𝑛) ∈ ℂ)
54		eqid 2204	. . . . . . . . . 10 ⊢ (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0))
55		fveq2 5575	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑛 → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗) = (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛))
56	17, 55	ifbieq1d 3592	. . . . . . . . . 10 ⊢ (𝑗 = 𝑛 → if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0) = if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0))
57		fsumadd.3	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
58	57	adantlr 477	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)
59	58	fmpttd 5734	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶ℂ)
60	59	ad2antrr 488	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶ℂ)
61	28	ad2antrr 488	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → 𝑓:(1...(♯‘𝐴))⟶𝐴)
62		fco 5440	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ 𝐴 ↦ 𝐶):𝐴⟶ℂ ∧ 𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
63	60, 61, 62	syl2anc 411	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
64	63, 43	ffvelcdmd 5715	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛) ∈ ℂ)
65	64, 45, 50	ifcldadc 3599	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0) ∈ ℂ)
66	54, 56, 22, 65	fvmptd3 5672	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → ((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0))‘𝑛) = if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0))
67	66, 65	eqeltrd 2281	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → ((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0))‘𝑛) ∈ ℂ)
68		simpll 527	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))
69	28	ffvelcdmda 5714	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (𝑓‘𝑛) ∈ 𝐴)
70		simpr 110	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝐴)
71	23, 57	addcld 8091	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝐶) ∈ ℂ)
72		eqid 2204	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) = (𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))
73	72	fvmpt2 5662	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ 𝐴 ∧ (𝐵 + 𝐶) ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (𝐵 + 𝐶))
74	70, 71, 73	syl2anc 411	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (𝐵 + 𝐶))
75		eqid 2204	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐵) = (𝑘 ∈ 𝐴 ↦ 𝐵)
76	75	fvmpt2 5662	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑘 ∈ 𝐴 ∧ 𝐵 ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) = 𝐵)
77	70, 23, 76	syl2anc 411	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) = 𝐵)
78		eqid 2204	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ 𝐴 ↦ 𝐶) = (𝑘 ∈ 𝐴 ↦ 𝐶)
79	78	fvmpt2 5662	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑘 ∈ 𝐴 ∧ 𝐶 ∈ ℂ) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘) = 𝐶)
80	70, 57, 79	syl2anc 411	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘) = 𝐶)
81	77, 80	oveq12d 5961	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘)) = (𝐵 + 𝐶))
82	74, 81	eqtr4d 2240	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘)))
83	82	ralrimiva 2578	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘)))
84	83	ad2antrr 488	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → ∀𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘)))
85		nffvmpt1 5586	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘(𝑓‘𝑛))
86		nffvmpt1 5586	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛))
87		nfcv 2347	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘 +
88		nffvmpt1 5586	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛))
89	86, 87, 88	nfov 5973	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘(((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))
90	85, 89	nfeq 2355	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘(𝑓‘𝑛)) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))
91		fveq2 5575	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘(𝑓‘𝑛)))
92		fveq2 5575	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
93		fveq2 5575	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))
94	92, 93	oveq12d 5961	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = (𝑓‘𝑛) → (((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘)) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛))))
95	91, 94	eqeq12d 2219	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = (𝑓‘𝑛) → (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘)) ↔ ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘(𝑓‘𝑛)) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))))
96	90, 95	rspc 2870	. . . . . . . . . . . . . 14 ⊢ ((𝑓‘𝑛) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑘) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑘)) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘(𝑓‘𝑛)) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))))
97	69, 84, 96	sylc 62	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘(𝑓‘𝑛)) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛))))
98		fvco3 5649	. . . . . . . . . . . . . 14 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘(𝑓‘𝑛)))
99	28, 98	sylan 283	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘(𝑓‘𝑛)))
100		fvco3 5649	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
101	28, 100	sylan 283	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
102		fvco3 5649	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:(1...(♯‘𝐴))⟶𝐴 ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))
103	28, 102	sylan 283	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))
104	101, 103	oveq12d 5961	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → ((((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) + (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛)) = (((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)) + ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛))))
105	97, 99, 104	3eqtr4d 2247	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (1...(♯‘𝐴))) → (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛) = ((((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) + (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛)))
106	68, 43, 105	syl2anc 411	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛) = ((((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) + (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛)))
107	40	iftrued 3577	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0) = (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛))
108	40	iftrued 3577	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) = (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛))
109	40	iftrued 3577	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0) = (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛))
110	108, 109	oveq12d 5961	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) + if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)) = ((((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) + (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛)))
111	106, 107, 110	3eqtr4d 2247	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0) = (if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) + if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)))
112	1	eqcomi 2208	. . . . . . . . . . 11 ⊢ 0 = (0 + 0)
113		simpr 110	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑛 ≤ (♯‘𝐴)) → ¬ 𝑛 ≤ (♯‘𝐴))
114	113	iffalsed 3580	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑛 ≤ (♯‘𝐴)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0) = 0)
115	113	iffalsed 3580	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑛 ≤ (♯‘𝐴)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) = 0)
116	113	iffalsed 3580	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑛 ≤ (♯‘𝐴)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0) = 0)
117	115, 116	oveq12d 5961	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑛 ≤ (♯‘𝐴)) → (if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) + if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)) = (0 + 0))
118	112, 114, 117	3eqtr4a 2263	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ ¬ 𝑛 ≤ (♯‘𝐴)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0) = (if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) + if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)))
119		exmiddc 837	. . . . . . . . . . 11 ⊢ (DECID 𝑛 ≤ (♯‘𝐴) → (𝑛 ≤ (♯‘𝐴) ∨ ¬ 𝑛 ≤ (♯‘𝐴)))
120	50, 119	syl 14	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → (𝑛 ≤ (♯‘𝐴) ∨ ¬ 𝑛 ≤ (♯‘𝐴)))
121	111, 118, 120	mpjaodan 799	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0) = (if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) + if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)))
122		eqid 2204	. . . . . . . . . 10 ⊢ (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0))
123		fveq2 5575	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑛 → (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗) = (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛))
124	17, 123	ifbieq1d 3592	. . . . . . . . . 10 ⊢ (𝑗 = 𝑛 → if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0) = if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0))
125	71	fmpttd 5734	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ)
126	125	ad3antrrr 492	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ)
127		fco 5440	. . . . . . . . . . . . 13 ⊢ (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ ∧ 𝑓:(1...(♯‘𝐴))⟶𝐴) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
128	126, 61, 127	syl2anc 411	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓):(1...(♯‘𝐴))⟶ℂ)
129	128, 43	ffvelcdmd 5715	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) ∧ 𝑛 ≤ (♯‘𝐴)) → (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛) ∈ ℂ)
130	129, 45, 50	ifcldadc 3599	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0) ∈ ℂ)
131	122, 124, 22, 130	fvmptd3 5672	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → ((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0))‘𝑛) = if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0))
132	52, 66	oveq12d 5961	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → (((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0))‘𝑛) + ((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0))‘𝑛)) = (if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) + if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)))
133	121, 131, 132	3eqtr4d 2247	. . . . . . . 8 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑛 ∈ (ℤ_≥‘1)) → ((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0))‘𝑛) = (((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0))‘𝑛) + ((𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0))‘𝑛)))
134	15, 53, 67, 133	ser3add 10665	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴)) = ((seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴)) + (seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴))))
135		fveq2 5575	. . . . . . . . 9 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘(𝑓‘𝑛)))
136	24, 58	addcld 8091	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑘 ∈ 𝐴) → (𝐵 + 𝐶) ∈ ℂ)
137	136	fmpttd 5734	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ)
138	137	ffvelcdmda 5714	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑚) ∈ ℂ)
139	135, 13, 26, 138, 99	fsum3 11640	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)))
140		breq1 4046	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑗 → (𝑛 ≤ (♯‘𝐴) ↔ 𝑗 ≤ (♯‘𝐴)))
141		fveq2 5575	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑗 → (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗))
142	140, 141	ifbieq1d 3592	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑗 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0) = if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0))
143	142	cbvmptv 4139	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0))
144		seqeq3 10595	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0)) → seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0))) = seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0))))
145	143, 144	ax-mp 5	. . . . . . . . 9 ⊢ seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0))) = seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0)))
146	145	fveq1i 5576	. . . . . . . 8 ⊢ (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)) = (seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴))
147	139, 146	eqtrdi 2253	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = (seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴)))
148		fveq2 5575	. . . . . . . . . 10 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐵)‘(𝑓‘𝑛)))
149	25	ffvelcdmda 5714	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) ∈ ℂ)
150	148, 13, 26, 149, 101	fsum3 11640	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)))
151		fveq2 5575	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑗 → (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗))
152	140, 151	ifbieq1d 3592	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑗 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0) = if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0))
153	152	cbvmptv 4139	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0))
154		seqeq3 10595	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0)) → seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))) = seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0))))
155	153, 154	ax-mp 5	. . . . . . . . . 10 ⊢ seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0))) = seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0)))
156	155	fveq1i 5576	. . . . . . . . 9 ⊢ (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)) = (seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴))
157	150, 156	eqtrdi 2253	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = (seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴)))
158		fveq2 5575	. . . . . . . . . 10 ⊢ (𝑚 = (𝑓‘𝑛) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = ((𝑘 ∈ 𝐴 ↦ 𝐶)‘(𝑓‘𝑛)))
159	59	ffvelcdmda 5714	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) ∧ 𝑚 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) ∈ ℂ)
160	158, 13, 26, 159, 103	fsum3 11640	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)))
161		fveq2 5575	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑗 → (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛) = (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗))
162	140, 161	ifbieq1d 3592	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑗 → if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0) = if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0))
163	162	cbvmptv 4139	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0))
164		seqeq3 10595	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)) = (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0)) → seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0))) = seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0))))
165	163, 164	ax-mp 5	. . . . . . . . . 10 ⊢ seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0))) = seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0)))
166	165	fveq1i 5576	. . . . . . . . 9 ⊢ (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑛), 0)))‘(♯‘𝐴)) = (seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴))
167	160, 166	eqtrdi 2253	. . . . . . . 8 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = (seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴)))
168	157, 167	oveq12d 5961	. . . . . . 7 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) + Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚)) = ((seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐵) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴)) + (seq1( + , (𝑗 ∈ ℕ ↦ if(𝑗 ≤ (♯‘𝐴), (((𝑘 ∈ 𝐴 ↦ 𝐶) ∘ 𝑓)‘𝑗), 0)))‘(♯‘𝐴))))
169	134, 147, 168	3eqtr4d 2247	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = (Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) + Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚)))
170	71	ralrimiva 2578	. . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 (𝐵 + 𝐶) ∈ ℂ)
171		sumfct 11627	. . . . . . . 8 ⊢ (∀𝑘 ∈ 𝐴 (𝐵 + 𝐶) ∈ ℂ → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶))
172	170, 171	syl 14	. . . . . . 7 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶))
173	172	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶))
174	23	ralrimiva 2578	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
175		sumfct 11627	. . . . . . . . 9 ⊢ (∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐵)
176	174, 175	syl 14	. . . . . . . 8 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐵)
177	57	ralrimiva 2578	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ)
178		sumfct 11627	. . . . . . . . 9 ⊢ (∀𝑘 ∈ 𝐴 𝐶 ∈ ℂ → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐶)
179	177, 178	syl 14	. . . . . . . 8 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚) = Σ𝑘 ∈ 𝐴 𝐶)
180	176, 179	oveq12d 5961	. . . . . . 7 ⊢ (𝜑 → (Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) + Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚)) = (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶))
181	180	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → (Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐵)‘𝑚) + Σ𝑚 ∈ 𝐴 ((𝑘 ∈ 𝐴 ↦ 𝐶)‘𝑚)) = (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶))
182	169, 173, 181	3eqtr3d 2245	. . . . 5 ⊢ ((𝜑 ∧ ((♯‘𝐴) ∈ ℕ ∧ 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)) → Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶) = (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶))
183	182	expr 375	. . . 4 ⊢ ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶) = (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶)))
184	183	exlimdv 1841	. . 3 ⊢ ((𝜑 ∧ (♯‘𝐴) ∈ ℕ) → (∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴 → Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶) = (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶)))
185	184	expimpd 363	. 2 ⊢ (𝜑 → (((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) → Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶) = (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶)))
186		fsumadd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ Fin)
187		fz1f1o 11628	. . 3 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))
188	186, 187	syl 14	. 2 ⊢ (𝜑 → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))
189	12, 185, 188	mpjaod 719	1 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 (𝐵 + 𝐶) = (Σ𝑘 ∈ 𝐴 𝐵 + Σ𝑘 ∈ 𝐴 𝐶))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 709 DECID wdc 835 ∧ w3a 980 = wceq 1372 ∃wex 1514 ∈ wcel 2175 ∀wral 2483 ∅c0 3459 ifcif 3570 class class class wbr 4043 ↦ cmpt 4104 ∘ ccom 4678 ⟶wf 5266 –1-1-onto→wf1o 5269 ‘cfv 5270 (class class class)co 5943 Fincfn 6826 ℂcc 7922 0cc0 7924 1c1 7925 + caddc 7927 ≤ cle 8107 ℕcn 9035 ℤcz 9371 ℤ_≥cuz 9647 ...cfz 10129 seqcseq 10590 ♯chash 10918 Σcsu 11606

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 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-coll 4158 ax-sep 4161 ax-nul 4169 ax-pow 4217 ax-pr 4252 ax-un 4479 ax-setind 4584 ax-iinf 4635 ax-cnex 8015 ax-resscn 8016 ax-1cn 8017 ax-1re 8018 ax-icn 8019 ax-addcl 8020 ax-addrcl 8021 ax-mulcl 8022 ax-mulrcl 8023 ax-addcom 8024 ax-mulcom 8025 ax-addass 8026 ax-mulass 8027 ax-distr 8028 ax-i2m1 8029 ax-0lt1 8030 ax-1rid 8031 ax-0id 8032 ax-rnegex 8033 ax-precex 8034 ax-cnre 8035 ax-pre-ltirr 8036 ax-pre-ltwlin 8037 ax-pre-lttrn 8038 ax-pre-apti 8039 ax-pre-ltadd 8040 ax-pre-mulgt0 8041 ax-pre-mulext 8042 ax-arch 8043 ax-caucvg 8044

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-nel 2471 df-ral 2488 df-rex 2489 df-reu 2490 df-rmo 2491 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-nul 3460 df-if 3571 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-int 3885 df-iun 3928 df-br 4044 df-opab 4105 df-mpt 4106 df-tr 4142 df-id 4339 df-po 4342 df-iso 4343 df-iord 4412 df-on 4414 df-ilim 4415 df-suc 4417 df-iom 4638 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-rn 4685 df-res 4686 df-ima 4687 df-iota 5231 df-fun 5272 df-fn 5273 df-f 5274 df-f1 5275 df-fo 5276 df-f1o 5277 df-fv 5278 df-isom 5279 df-riota 5898 df-ov 5946 df-oprab 5947 df-mpo 5948 df-1st 6225 df-2nd 6226 df-recs 6390 df-irdg 6455 df-frec 6476 df-1o 6501 df-oadd 6505 df-er 6619 df-en 6827 df-dom 6828 df-fin 6829 df-pnf 8108 df-mnf 8109 df-xr 8110 df-ltxr 8111 df-le 8112 df-sub 8244 df-neg 8245 df-reap 8647 df-ap 8654 df-div 8745 df-inn 9036 df-2 9094 df-3 9095 df-4 9096 df-n0 9295 df-z 9372 df-uz 9648 df-q 9740 df-rp 9775 df-fz 10130 df-fzo 10264 df-seqfrec 10591 df-exp 10682 df-ihash 10919 df-cj 11095 df-re 11096 df-im 11097 df-rsqrt 11251 df-abs 11252 df-clim 11532 df-sumdc 11607

This theorem is referenced by: fsumsplit 11660 fsumsub 11705 binomlem 11736 pcbc 12616 plyaddlem1 15161

W3C validator