Theorem sumeq2 12125

Description: Equality theorem for sum. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 13-Jul-2013.)

Assertion

Ref	Expression
sumeq2	⊢ (∀𝑘 ∈ 𝐴 𝐵 = 𝐶 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ 𝐴 𝐶)

Distinct variable group:   𝐴,𝑘

Allowed substitution hints:   𝐵(𝑘)   𝐶(𝑘)

Proof of Theorem sumeq2

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

Step	Hyp	Ref	Expression
1		simpr 110	. . . . . . . . . . . 12 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) ∧ 𝑛 ∈ ℤ) ∧ 𝑛 ∈ 𝐴) → 𝑛 ∈ 𝐴)
2		simp-4l 547	. . . . . . . . . . . 12 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) ∧ 𝑛 ∈ ℤ) ∧ 𝑛 ∈ 𝐴) → ∀𝑘 ∈ 𝐴 𝐵 = 𝐶)
3		nfcsb1v 3180	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘⦋𝑛 / 𝑘⦌𝐵
4		nfcsb1v 3180	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘⦋𝑛 / 𝑘⦌𝐶
5	3, 4	nfeq 2400	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑘⦋𝑛 / 𝑘⦌𝐵 = ⦋𝑛 / 𝑘⦌𝐶
6		csbeq1a 3156	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑛 → 𝐵 = ⦋𝑛 / 𝑘⦌𝐵)
7		csbeq1a 3156	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑛 → 𝐶 = ⦋𝑛 / 𝑘⦌𝐶)
8	6, 7	eqeq12d 2253	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑛 → (𝐵 = 𝐶 ↔ ⦋𝑛 / 𝑘⦌𝐵 = ⦋𝑛 / 𝑘⦌𝐶))
9	5, 8	rspc 2923	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 = 𝐶 → ⦋𝑛 / 𝑘⦌𝐵 = ⦋𝑛 / 𝑘⦌𝐶))
10	1, 2, 9	sylc 62	. . . . . . . . . . 11 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) ∧ 𝑛 ∈ ℤ) ∧ 𝑛 ∈ 𝐴) → ⦋𝑛 / 𝑘⦌𝐵 = ⦋𝑛 / 𝑘⦌𝐶)
11		simpllr 540	. . . . . . . . . . . 12 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) ∧ 𝑛 ∈ ℤ) → 𝑚 ∈ ℤ)
12		simplrl 541	. . . . . . . . . . . 12 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) ∧ 𝑛 ∈ ℤ) → 𝐴 ⊆ (ℤ≥‘𝑚))
13		simplrr 542	. . . . . . . . . . . 12 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) ∧ 𝑛 ∈ ℤ) → ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)
14		simpr 110	. . . . . . . . . . . 12 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) ∧ 𝑛 ∈ ℤ) → 𝑛 ∈ ℤ)
15	11, 12, 13, 14	sumdc 12124	. . . . . . . . . . 11 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) ∧ 𝑛 ∈ ℤ) → DECID 𝑛 ∈ 𝐴)
16	10, 15	ifeq1dadc 3671	. . . . . . . . . 10 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) ∧ 𝑛 ∈ ℤ) → if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0) = if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))
17	16	mpteq2dva 4221	. . . . . . . . 9 ⊢ (((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) → (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0)) = (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0)))
18	17	seqeq3d 10892	. . . . . . . 8 ⊢ (((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) → seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) = seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))))
19	18	breq1d 4140	. . . . . . 7 ⊢ (((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) ∧ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴)) → (seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥 ↔ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))) ⇝ 𝑥))
20	19	pm5.32da 456	. . . . . 6 ⊢ ((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) → (((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ↔ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))) ⇝ 𝑥)))
21		df-3an 1011	. . . . . 6 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ↔ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥))
22		df-3an 1011	. . . . . 6 ⊢ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))) ⇝ 𝑥) ↔ ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))) ⇝ 𝑥))
23	20, 21, 22	3bitr4g 223	. . . . 5 ⊢ ((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℤ) → ((𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ↔ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))) ⇝ 𝑥)))
24	23	rexbidva 2547	. . . 4 ⊢ (∀𝑘 ∈ 𝐴 𝐵 = 𝐶 → (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ↔ ∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))) ⇝ 𝑥)))
25		f1of 5639	. . . . . . . . . . . . . . 15 ⊢ (𝑓:(1...𝑚)–1-1-onto→𝐴 → 𝑓:(1...𝑚)⟶𝐴)
26	25	ad3antlr 497	. . . . . . . . . . . . . 14 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → 𝑓:(1...𝑚)⟶𝐴)
27		simplr 533	. . . . . . . . . . . . . . 15 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → 𝑛 ∈ ℕ)
28		simpr 110	. . . . . . . . . . . . . . 15 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → 𝑛 ≤ 𝑚)
29		simp-4r 548	. . . . . . . . . . . . . . . . 17 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → 𝑚 ∈ ℕ)
30	29	nnzd 9767	. . . . . . . . . . . . . . . 16 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → 𝑚 ∈ ℤ)
31		fznn 10496	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 ∈ ℤ → (𝑛 ∈ (1...𝑚) ↔ (𝑛 ∈ ℕ ∧ 𝑛 ≤ 𝑚)))
32	30, 31	syl 14	. . . . . . . . . . . . . . 15 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → (𝑛 ∈ (1...𝑚) ↔ (𝑛 ∈ ℕ ∧ 𝑛 ≤ 𝑚)))
33	27, 28, 32	mpbir2and 957	. . . . . . . . . . . . . 14 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → 𝑛 ∈ (1...𝑚))
34	26, 33	ffvelcdmd 5844	. . . . . . . . . . . . 13 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → (𝑓‘𝑛) ∈ 𝐴)
35		simp-4l 547	. . . . . . . . . . . . 13 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → ∀𝑘 ∈ 𝐴 𝐵 = 𝐶)
36		nfcsb1v 3180	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘⦋(𝑓‘𝑛) / 𝑘⦌𝐵
37		nfcsb1v 3180	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘⦋(𝑓‘𝑛) / 𝑘⦌𝐶
38	36, 37	nfeq 2400	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘⦋(𝑓‘𝑛) / 𝑘⦌𝐵 = ⦋(𝑓‘𝑛) / 𝑘⦌𝐶
39		csbeq1a 3156	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = (𝑓‘𝑛) → 𝐵 = ⦋(𝑓‘𝑛) / 𝑘⦌𝐵)
40		csbeq1a 3156	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = (𝑓‘𝑛) → 𝐶 = ⦋(𝑓‘𝑛) / 𝑘⦌𝐶)
41	39, 40	eqeq12d 2253	. . . . . . . . . . . . . 14 ⊢ (𝑘 = (𝑓‘𝑛) → (𝐵 = 𝐶 ↔ ⦋(𝑓‘𝑛) / 𝑘⦌𝐵 = ⦋(𝑓‘𝑛) / 𝑘⦌𝐶))
42	38, 41	rspc 2923	. . . . . . . . . . . . 13 ⊢ ((𝑓‘𝑛) ∈ 𝐴 → (∀𝑘 ∈ 𝐴 𝐵 = 𝐶 → ⦋(𝑓‘𝑛) / 𝑘⦌𝐵 = ⦋(𝑓‘𝑛) / 𝑘⦌𝐶))
43	34, 35, 42	sylc 62	. . . . . . . . . . . 12 ⊢ (((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑛 ≤ 𝑚) → ⦋(𝑓‘𝑛) / 𝑘⦌𝐵 = ⦋(𝑓‘𝑛) / 𝑘⦌𝐶)
44		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ)
45	44	nnzd 9767	. . . . . . . . . . . . 13 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℤ)
46		simpllr 540	. . . . . . . . . . . . . 14 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑚 ∈ ℕ)
47	46	nnzd 9767	. . . . . . . . . . . . 13 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑚 ∈ ℤ)
48		zdcle 9721	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℤ ∧ 𝑚 ∈ ℤ) → DECID 𝑛 ≤ 𝑚)
49	45, 47, 48	syl2anc 415	. . . . . . . . . . . 12 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) → DECID 𝑛 ≤ 𝑚)
50	43, 49	ifeq1dadc 3671	. . . . . . . . . . 11 ⊢ ((((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) ∧ 𝑛 ∈ ℕ) → if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0) = if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0))
51	50	mpteq2dva 4221	. . . . . . . . . 10 ⊢ (((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)) = (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0)))
52	51	seqeq3d 10892	. . . . . . . . 9 ⊢ (((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0))) = seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0))))
53	52	fveq1d 5697	. . . . . . . 8 ⊢ (((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0)))‘𝑚))
54	53	eqeq2d 2250	. . . . . . 7 ⊢ (((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) ∧ 𝑓:(1...𝑚)–1-1-onto→𝐴) → (𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚) ↔ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0)))‘𝑚)))
55	54	pm5.32da 456	. . . . . 6 ⊢ ((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) → ((𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0)))‘𝑚))))
56	55	exbidv 1878	. . . . 5 ⊢ ((∀𝑘 ∈ 𝐴 𝐵 = 𝐶 ∧ 𝑚 ∈ ℕ) → (∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0)))‘𝑚))))
57	56	rexbidva 2547	. . . 4 ⊢ (∀𝑘 ∈ 𝐴 𝐵 = 𝐶 → (∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚)) ↔ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0)))‘𝑚))))
58	24, 57	orbi12d 805	. . 3 ⊢ (∀𝑘 ∈ 𝐴 𝐵 = 𝐶 → ((∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚))) ↔ (∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0)))‘𝑚)))))
59	58	iotabidv 5360	. 2 ⊢ (∀𝑘 ∈ 𝐴 𝐵 = 𝐶 → (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚)))) = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0)))‘𝑚)))))
60		df-sumdc 12120	. 2 ⊢ Σ𝑘 ∈ 𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚))))
61		df-sumdc 12120	. 2 ⊢ Σ𝑘 ∈ 𝐴 𝐶 = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐶, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐶, 0)))‘𝑚))))
62	59, 60, 61	3eqtr4g 2296	1 ⊢ (∀𝑘 ∈ 𝐴 𝐵 = 𝐶 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ 𝐴 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  DECID wdc 846   ∧ w3a 1009   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  ⦋csb 3147   ⊆ wss 3220  ifcif 3638   class class class wbr 4130   ↦ cmpt 4192  ℩cio 5335  ⟶wf 5373  –1-1-onto→wf1o 5376  ‘cfv 5377  (class class class)co 6085  0cc0 8179  1c1 8180   + caddc 8182   ≤ cle 8361  ℕcn 9304  ℤcz 9644  ℤ_≥cuz 9921  ...cfz 10411  seqcseq 10884   ⇝ cli 12044  Σcsu 12119

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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295

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-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  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-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-seqfrec 10885  df-sumdc 12120

This theorem is used by:  sumeq2i  12130  sumeq2d  12133  fsum00  12229