MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fsumadd Structured version   Visualization version   GIF version

Theorem fsumadd 14403
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.
StepHypRef Expression
1 00id 10155 . . . . 5 (0 + 0) = 0
2 sum0 14385 . . . . . 6 Σ𝑘 ∈ ∅ 𝐵 = 0
3 sum0 14385 . . . . . 6 Σ𝑘 ∈ ∅ 𝐶 = 0
42, 3oveq12i 6616 . . . . 5 𝑘 ∈ ∅ 𝐵 + Σ𝑘 ∈ ∅ 𝐶) = (0 + 0)
5 sum0 14385 . . . . 5 Σ𝑘 ∈ ∅ (𝐵 + 𝐶) = 0
61, 4, 53eqtr4ri 2654 . . . 4 Σ𝑘 ∈ ∅ (𝐵 + 𝐶) = (Σ𝑘 ∈ ∅ 𝐵 + Σ𝑘 ∈ ∅ 𝐶)
7 sumeq1 14353 . . . 4 (𝐴 = ∅ → Σ𝑘𝐴 (𝐵 + 𝐶) = Σ𝑘 ∈ ∅ (𝐵 + 𝐶))
8 sumeq1 14353 . . . . 5 (𝐴 = ∅ → Σ𝑘𝐴 𝐵 = Σ𝑘 ∈ ∅ 𝐵)
9 sumeq1 14353 . . . . 5 (𝐴 = ∅ → Σ𝑘𝐴 𝐶 = Σ𝑘 ∈ ∅ 𝐶)
108, 9oveq12d 6622 . . . 4 (𝐴 = ∅ → (Σ𝑘𝐴 𝐵 + Σ𝑘𝐴 𝐶) = (Σ𝑘 ∈ ∅ 𝐵 + Σ𝑘 ∈ ∅ 𝐶))
116, 7, 103eqtr4a 2681 . . 3 (𝐴 = ∅ → Σ𝑘𝐴 (𝐵 + 𝐶) = (Σ𝑘𝐴 𝐵 + Σ𝑘𝐴 𝐶))
1211a1i 11 . 2 (𝜑 → (𝐴 = ∅ → Σ𝑘𝐴 (𝐵 + 𝐶) = (Σ𝑘𝐴 𝐵 + Σ𝑘𝐴 𝐶)))
13 simprl 793 . . . . . . . . 9 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → (#‘𝐴) ∈ ℕ)
14 nnuz 11667 . . . . . . . . 9 ℕ = (ℤ‘1)
1513, 14syl6eleq 2708 . . . . . . . 8 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → (#‘𝐴) ∈ (ℤ‘1))
16 fsumadd.2 . . . . . . . . . . . 12 ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)
1716adantlr 750 . . . . . . . . . . 11 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑘𝐴) → 𝐵 ∈ ℂ)
18 eqid 2621 . . . . . . . . . . 11 (𝑘𝐴𝐵) = (𝑘𝐴𝐵)
1917, 18fmptd 6340 . . . . . . . . . 10 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴𝐵):𝐴⟶ℂ)
20 simprr 795 . . . . . . . . . . 11 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)
21 f1of 6094 . . . . . . . . . . 11 (𝑓:(1...(#‘𝐴))–1-1-onto𝐴𝑓:(1...(#‘𝐴))⟶𝐴)
2220, 21syl 17 . . . . . . . . . 10 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → 𝑓:(1...(#‘𝐴))⟶𝐴)
23 fco 6015 . . . . . . . . . 10 (((𝑘𝐴𝐵):𝐴⟶ℂ ∧ 𝑓:(1...(#‘𝐴))⟶𝐴) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(#‘𝐴))⟶ℂ)
2419, 22, 23syl2anc 692 . . . . . . . . 9 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → ((𝑘𝐴𝐵) ∘ 𝑓):(1...(#‘𝐴))⟶ℂ)
2524ffvelrnda 6315 . . . . . . . 8 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) ∈ ℂ)
26 fsumadd.3 . . . . . . . . . . . 12 ((𝜑𝑘𝐴) → 𝐶 ∈ ℂ)
2726adantlr 750 . . . . . . . . . . 11 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑘𝐴) → 𝐶 ∈ ℂ)
28 eqid 2621 . . . . . . . . . . 11 (𝑘𝐴𝐶) = (𝑘𝐴𝐶)
2927, 28fmptd 6340 . . . . . . . . . 10 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴𝐶):𝐴⟶ℂ)
30 fco 6015 . . . . . . . . . 10 (((𝑘𝐴𝐶):𝐴⟶ℂ ∧ 𝑓:(1...(#‘𝐴))⟶𝐴) → ((𝑘𝐴𝐶) ∘ 𝑓):(1...(#‘𝐴))⟶ℂ)
3129, 22, 30syl2anc 692 . . . . . . . . 9 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → ((𝑘𝐴𝐶) ∘ 𝑓):(1...(#‘𝐴))⟶ℂ)
3231ffvelrnda 6315 . . . . . . . 8 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛) ∈ ℂ)
3322ffvelrnda 6315 . . . . . . . . . 10 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → (𝑓𝑛) ∈ 𝐴)
34 ovex 6632 . . . . . . . . . . . . . . 15 (𝐵 + 𝐶) ∈ V
35 eqid 2621 . . . . . . . . . . . . . . . 16 (𝑘𝐴 ↦ (𝐵 + 𝐶)) = (𝑘𝐴 ↦ (𝐵 + 𝐶))
3635fvmpt2 6248 . . . . . . . . . . . . . . 15 ((𝑘𝐴 ∧ (𝐵 + 𝐶) ∈ V) → ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (𝐵 + 𝐶))
3734, 36mpan2 706 . . . . . . . . . . . . . 14 (𝑘𝐴 → ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (𝐵 + 𝐶))
3837adantl 482 . . . . . . . . . . . . 13 ((𝜑𝑘𝐴) → ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (𝐵 + 𝐶))
39 simpr 477 . . . . . . . . . . . . . . 15 ((𝜑𝑘𝐴) → 𝑘𝐴)
4018fvmpt2 6248 . . . . . . . . . . . . . . 15 ((𝑘𝐴𝐵 ∈ ℂ) → ((𝑘𝐴𝐵)‘𝑘) = 𝐵)
4139, 16, 40syl2anc 692 . . . . . . . . . . . . . 14 ((𝜑𝑘𝐴) → ((𝑘𝐴𝐵)‘𝑘) = 𝐵)
4228fvmpt2 6248 . . . . . . . . . . . . . . 15 ((𝑘𝐴𝐶 ∈ ℂ) → ((𝑘𝐴𝐶)‘𝑘) = 𝐶)
4339, 26, 42syl2anc 692 . . . . . . . . . . . . . 14 ((𝜑𝑘𝐴) → ((𝑘𝐴𝐶)‘𝑘) = 𝐶)
4441, 43oveq12d 6622 . . . . . . . . . . . . 13 ((𝜑𝑘𝐴) → (((𝑘𝐴𝐵)‘𝑘) + ((𝑘𝐴𝐶)‘𝑘)) = (𝐵 + 𝐶))
4538, 44eqtr4d 2658 . . . . . . . . . . . 12 ((𝜑𝑘𝐴) → ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) + ((𝑘𝐴𝐶)‘𝑘)))
4645ralrimiva 2960 . . . . . . . . . . 11 (𝜑 → ∀𝑘𝐴 ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) + ((𝑘𝐴𝐶)‘𝑘)))
4746ad2antrr 761 . . . . . . . . . 10 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → ∀𝑘𝐴 ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) + ((𝑘𝐴𝐶)‘𝑘)))
48 nffvmpt1 6156 . . . . . . . . . . . 12 𝑘((𝑘𝐴 ↦ (𝐵 + 𝐶))‘(𝑓𝑛))
49 nffvmpt1 6156 . . . . . . . . . . . . 13 𝑘((𝑘𝐴𝐵)‘(𝑓𝑛))
50 nfcv 2761 . . . . . . . . . . . . 13 𝑘 +
51 nffvmpt1 6156 . . . . . . . . . . . . 13 𝑘((𝑘𝐴𝐶)‘(𝑓𝑛))
5249, 50, 51nfov 6630 . . . . . . . . . . . 12 𝑘(((𝑘𝐴𝐵)‘(𝑓𝑛)) + ((𝑘𝐴𝐶)‘(𝑓𝑛)))
5348, 52nfeq 2772 . . . . . . . . . . 11 𝑘((𝑘𝐴 ↦ (𝐵 + 𝐶))‘(𝑓𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) + ((𝑘𝐴𝐶)‘(𝑓𝑛)))
54 fveq2 6148 . . . . . . . . . . . 12 (𝑘 = (𝑓𝑛) → ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘(𝑓𝑛)))
55 fveq2 6148 . . . . . . . . . . . . 13 (𝑘 = (𝑓𝑛) → ((𝑘𝐴𝐵)‘𝑘) = ((𝑘𝐴𝐵)‘(𝑓𝑛)))
56 fveq2 6148 . . . . . . . . . . . . 13 (𝑘 = (𝑓𝑛) → ((𝑘𝐴𝐶)‘𝑘) = ((𝑘𝐴𝐶)‘(𝑓𝑛)))
5755, 56oveq12d 6622 . . . . . . . . . . . 12 (𝑘 = (𝑓𝑛) → (((𝑘𝐴𝐵)‘𝑘) + ((𝑘𝐴𝐶)‘𝑘)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) + ((𝑘𝐴𝐶)‘(𝑓𝑛))))
5854, 57eqeq12d 2636 . . . . . . . . . . 11 (𝑘 = (𝑓𝑛) → (((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) + ((𝑘𝐴𝐶)‘𝑘)) ↔ ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘(𝑓𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) + ((𝑘𝐴𝐶)‘(𝑓𝑛)))))
5953, 58rspc 3289 . . . . . . . . . 10 ((𝑓𝑛) ∈ 𝐴 → (∀𝑘𝐴 ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑘) = (((𝑘𝐴𝐵)‘𝑘) + ((𝑘𝐴𝐶)‘𝑘)) → ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘(𝑓𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) + ((𝑘𝐴𝐶)‘(𝑓𝑛)))))
6033, 47, 59sylc 65 . . . . . . . . 9 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘(𝑓𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) + ((𝑘𝐴𝐶)‘(𝑓𝑛))))
61 fvco3 6232 . . . . . . . . . 10 ((𝑓:(1...(#‘𝐴))⟶𝐴𝑛 ∈ (1...(#‘𝐴))) → (((𝑘𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛) = ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘(𝑓𝑛)))
6222, 61sylan 488 . . . . . . . . 9 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → (((𝑘𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛) = ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘(𝑓𝑛)))
63 fvco3 6232 . . . . . . . . . . 11 ((𝑓:(1...(#‘𝐴))⟶𝐴𝑛 ∈ (1...(#‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) = ((𝑘𝐴𝐵)‘(𝑓𝑛)))
6422, 63sylan 488 . . . . . . . . . 10 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → (((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) = ((𝑘𝐴𝐵)‘(𝑓𝑛)))
65 fvco3 6232 . . . . . . . . . . 11 ((𝑓:(1...(#‘𝐴))⟶𝐴𝑛 ∈ (1...(#‘𝐴))) → (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛) = ((𝑘𝐴𝐶)‘(𝑓𝑛)))
6622, 65sylan 488 . . . . . . . . . 10 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛) = ((𝑘𝐴𝐶)‘(𝑓𝑛)))
6764, 66oveq12d 6622 . . . . . . . . 9 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → ((((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) + (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛)) = (((𝑘𝐴𝐵)‘(𝑓𝑛)) + ((𝑘𝐴𝐶)‘(𝑓𝑛))))
6860, 62, 673eqtr4d 2665 . . . . . . . 8 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑛 ∈ (1...(#‘𝐴))) → (((𝑘𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓)‘𝑛) = ((((𝑘𝐴𝐵) ∘ 𝑓)‘𝑛) + (((𝑘𝐴𝐶) ∘ 𝑓)‘𝑛)))
6915, 25, 32, 68seradd 12783 . . . . . . 7 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → (seq1( + , ((𝑘𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓))‘(#‘𝐴)) = ((seq1( + , ((𝑘𝐴𝐵) ∘ 𝑓))‘(#‘𝐴)) + (seq1( + , ((𝑘𝐴𝐶) ∘ 𝑓))‘(#‘𝐴))))
70 fveq2 6148 . . . . . . . 8 (𝑚 = (𝑓𝑛) → ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘(𝑓𝑛)))
7117, 27addcld 10003 . . . . . . . . . 10 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑘𝐴) → (𝐵 + 𝐶) ∈ ℂ)
7271, 35fmptd 6340 . . . . . . . . 9 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → (𝑘𝐴 ↦ (𝐵 + 𝐶)):𝐴⟶ℂ)
7372ffvelrnda 6315 . . . . . . . 8 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑚) ∈ ℂ)
7470, 13, 20, 73, 62fsum 14384 . . . . . . 7 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → Σ𝑚𝐴 ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = (seq1( + , ((𝑘𝐴 ↦ (𝐵 + 𝐶)) ∘ 𝑓))‘(#‘𝐴)))
75 fveq2 6148 . . . . . . . . 9 (𝑚 = (𝑓𝑛) → ((𝑘𝐴𝐵)‘𝑚) = ((𝑘𝐴𝐵)‘(𝑓𝑛)))
7619ffvelrnda 6315 . . . . . . . . 9 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴𝐵)‘𝑚) ∈ ℂ)
7775, 13, 20, 76, 64fsum 14384 . . . . . . . 8 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = (seq1( + , ((𝑘𝐴𝐵) ∘ 𝑓))‘(#‘𝐴)))
78 fveq2 6148 . . . . . . . . 9 (𝑚 = (𝑓𝑛) → ((𝑘𝐴𝐶)‘𝑚) = ((𝑘𝐴𝐶)‘(𝑓𝑛)))
7929ffvelrnda 6315 . . . . . . . . 9 (((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) ∧ 𝑚𝐴) → ((𝑘𝐴𝐶)‘𝑚) ∈ ℂ)
8078, 13, 20, 79, 66fsum 14384 . . . . . . . 8 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → Σ𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚) = (seq1( + , ((𝑘𝐴𝐶) ∘ 𝑓))‘(#‘𝐴)))
8177, 80oveq12d 6622 . . . . . . 7 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → (Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) + Σ𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚)) = ((seq1( + , ((𝑘𝐴𝐵) ∘ 𝑓))‘(#‘𝐴)) + (seq1( + , ((𝑘𝐴𝐶) ∘ 𝑓))‘(#‘𝐴))))
8269, 74, 813eqtr4d 2665 . . . . . 6 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → Σ𝑚𝐴 ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = (Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) + Σ𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚)))
83 sumfc 14373 . . . . . 6 Σ𝑚𝐴 ((𝑘𝐴 ↦ (𝐵 + 𝐶))‘𝑚) = Σ𝑘𝐴 (𝐵 + 𝐶)
84 sumfc 14373 . . . . . . 7 Σ𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) = Σ𝑘𝐴 𝐵
85 sumfc 14373 . . . . . . 7 Σ𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚) = Σ𝑘𝐴 𝐶
8684, 85oveq12i 6616 . . . . . 6 𝑚𝐴 ((𝑘𝐴𝐵)‘𝑚) + Σ𝑚𝐴 ((𝑘𝐴𝐶)‘𝑚)) = (Σ𝑘𝐴 𝐵 + Σ𝑘𝐴 𝐶)
8782, 83, 863eqtr3g 2678 . . . . 5 ((𝜑 ∧ ((#‘𝐴) ∈ ℕ ∧ 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)) → Σ𝑘𝐴 (𝐵 + 𝐶) = (Σ𝑘𝐴 𝐵 + Σ𝑘𝐴 𝐶))
8887expr 642 . . . 4 ((𝜑 ∧ (#‘𝐴) ∈ ℕ) → (𝑓:(1...(#‘𝐴))–1-1-onto𝐴 → Σ𝑘𝐴 (𝐵 + 𝐶) = (Σ𝑘𝐴 𝐵 + Σ𝑘𝐴 𝐶)))
8988exlimdv 1858 . . 3 ((𝜑 ∧ (#‘𝐴) ∈ ℕ) → (∃𝑓 𝑓:(1...(#‘𝐴))–1-1-onto𝐴 → Σ𝑘𝐴 (𝐵 + 𝐶) = (Σ𝑘𝐴 𝐵 + Σ𝑘𝐴 𝐶)))
9089expimpd 628 . 2 (𝜑 → (((#‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(#‘𝐴))–1-1-onto𝐴) → Σ𝑘𝐴 (𝐵 + 𝐶) = (Σ𝑘𝐴 𝐵 + Σ𝑘𝐴 𝐶)))
91 fsumadd.1 . . 3 (𝜑𝐴 ∈ Fin)
92 fz1f1o 14374 . . 3 (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((#‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)))
9391, 92syl 17 . 2 (𝜑 → (𝐴 = ∅ ∨ ((#‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(#‘𝐴))–1-1-onto𝐴)))
9412, 90, 93mpjaod 396 1 (𝜑 → Σ𝑘𝐴 (𝐵 + 𝐶) = (Σ𝑘𝐴 𝐵 + Σ𝑘𝐴 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 383  wa 384   = wceq 1480  wex 1701  wcel 1987  wral 2907  Vcvv 3186  c0 3891  cmpt 4673  ccom 5078  wf 5843  1-1-ontowf1o 5846  cfv 5847  (class class class)co 6604  Fincfn 7899  cc 9878  0cc0 9880  1c1 9881   + caddc 9883  cn 10964  cuz 11631  ...cfz 12268  seqcseq 12741  #chash 13057  Σcsu 14350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4731  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902  ax-inf2 8482  ax-cnex 9936  ax-resscn 9937  ax-1cn 9938  ax-icn 9939  ax-addcl 9940  ax-addrcl 9941  ax-mulcl 9942  ax-mulrcl 9943  ax-mulcom 9944  ax-addass 9945  ax-mulass 9946  ax-distr 9947  ax-i2m1 9948  ax-1ne0 9949  ax-1rid 9950  ax-rnegex 9951  ax-rrecex 9952  ax-cnre 9953  ax-pre-lttri 9954  ax-pre-lttrn 9955  ax-pre-ltadd 9956  ax-pre-mulgt0 9957  ax-pre-sup 9958
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-fal 1486  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-pss 3571  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-tp 4153  df-op 4155  df-uni 4403  df-int 4441  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-tr 4713  df-eprel 4985  df-id 4989  df-po 4995  df-so 4996  df-fr 5033  df-se 5034  df-we 5035  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639  df-ord 5685  df-on 5686  df-lim 5687  df-suc 5688  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-isom 5856  df-riota 6565  df-ov 6607  df-oprab 6608  df-mpt2 6609  df-om 7013  df-1st 7113  df-2nd 7114  df-wrecs 7352  df-recs 7413  df-rdg 7451  df-1o 7505  df-oadd 7509  df-er 7687  df-en 7900  df-dom 7901  df-sdom 7902  df-fin 7903  df-sup 8292  df-oi 8359  df-card 8709  df-pnf 10020  df-mnf 10021  df-xr 10022  df-ltxr 10023  df-le 10024  df-sub 10212  df-neg 10213  df-div 10629  df-nn 10965  df-2 11023  df-3 11024  df-n0 11237  df-z 11322  df-uz 11632  df-rp 11777  df-fz 12269  df-fzo 12407  df-seq 12742  df-exp 12801  df-hash 13058  df-cj 13773  df-re 13774  df-im 13775  df-sqrt 13909  df-abs 13910  df-clim 14153  df-sum 14351
This theorem is referenced by:  fsumsplit  14404  fsumsub  14448  binomlem  14486  binomfallfaclem2  14696  pwp1fsum  15038  pcbc  15528  csbren  23090  trirn  23091  ovollb2lem  23163  ovoliunlem1  23177  itg1addlem5  23373  itgsplit  23508  plyaddlem1  23873  basellem8  24714  logfaclbnd  24847  dchrvmasum2if  25086  mudivsum  25119  logsqvma  25131  selberglem1  25134  selberglem2  25135  selberg  25137  selberg2  25140  selberg3lem1  25146  selberg4  25150  pntsval2  25165  ax5seglem9  25717  dvnmul  39461  dirkertrigeqlem2  39620  sge0xaddlem1  39954  sge0xaddlem2  39955  hoidmvlelem2  40114  altgsumbcALT  41416
  Copyright terms: Public domain W3C validator