Theorem seqsplit 14086

Description: Split a sequence into two sequences. (Contributed by NM, 17-Mar-2005.) (Revised by Mario Carneiro, 27-May-2014.)

Hypotheses

Ref	Expression
seqsplit.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
seqsplit.2	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
seqsplit.3	⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))
seqsplit.4	⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝐾))
seqsplit.5	⊢ ((𝜑 ∧ 𝑥 ∈ (𝐾...𝑁)) → (𝐹‘𝑥) ∈ 𝑆)

Assertion

Ref	Expression
seqsplit	⊢ (𝜑 → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐹   𝑥,𝐾,𝑦,𝑧   𝑥,𝑀,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝑁,𝑦,𝑧   𝑥, + ,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem seqsplit

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		seqsplit.3	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))
2		eluzfz2 13592	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑁 ∈ ((𝑀 + 1)...𝑁))
3	1, 2	syl 17	. 2 ⊢ (𝜑 → 𝑁 ∈ ((𝑀 + 1)...𝑁))
4		eleq1 2832	. . . . . 6 ⊢ (𝑥 = (𝑀 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑀 + 1) ∈ ((𝑀 + 1)...𝑁)))
5		fveq2 6920	. . . . . . 7 ⊢ (𝑥 = (𝑀 + 1) → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘(𝑀 + 1)))
6		fveq2 6920	. . . . . . . 8 ⊢ (𝑥 = (𝑀 + 1) → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)))
7	6	oveq2d 7464	. . . . . . 7 ⊢ (𝑥 = (𝑀 + 1) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))
8	5, 7	eqeq12d 2756	. . . . . 6 ⊢ (𝑥 = (𝑀 + 1) → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)))))
9	4, 8	imbi12d 344	. . . . 5 ⊢ (𝑥 = (𝑀 + 1) → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))))
10	9	imbi2d 340	. . . 4 ⊢ (𝑥 = (𝑀 + 1) → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)))))))
11		eleq1 2832	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑛 ∈ ((𝑀 + 1)...𝑁)))
12		fveq2 6920	. . . . . . 7 ⊢ (𝑥 = 𝑛 → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘𝑛))
13		fveq2 6920	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘𝑛))
14	13	oveq2d 7464	. . . . . . 7 ⊢ (𝑥 = 𝑛 → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))
15	12, 14	eqeq12d 2756	. . . . . 6 ⊢ (𝑥 = 𝑛 → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛))))
16	11, 15	imbi12d 344	. . . . 5 ⊢ (𝑥 = 𝑛 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ (𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))))
17	16	imbi2d 340	. . . 4 ⊢ (𝑥 = 𝑛 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛))))))
18		eleq1 2832	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)))
19		fveq2 6920	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘(𝑛 + 1)))
20		fveq2 6920	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))
21	20	oveq2d 7464	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))))
22	19, 21	eqeq12d 2756	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))
23	18, 22	imbi12d 344	. . . . 5 ⊢ (𝑥 = (𝑛 + 1) → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))))))
24	23	imbi2d 340	. . . 4 ⊢ (𝑥 = (𝑛 + 1) → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))))
25		eleq1 2832	. . . . . 6 ⊢ (𝑥 = 𝑁 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑁 ∈ ((𝑀 + 1)...𝑁)))
26		fveq2 6920	. . . . . . 7 ⊢ (𝑥 = 𝑁 → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘𝑁))
27		fveq2 6920	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘𝑁))
28	27	oveq2d 7464	. . . . . . 7 ⊢ (𝑥 = 𝑁 → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))
29	26, 28	eqeq12d 2756	. . . . . 6 ⊢ (𝑥 = 𝑁 → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁))))
30	25, 29	imbi12d 344	. . . . 5 ⊢ (𝑥 = 𝑁 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))))
31	30	imbi2d 340	. . . 4 ⊢ (𝑥 = 𝑁 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁))))))
32		seqsplit.4	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝐾))
33		seqp1 14067	. . . . . . 7 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))))
34	32, 33	syl 17	. . . . . 6 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))))
35		eluzel2 12908	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → (𝑀 + 1) ∈ ℤ)
36		seq1 14065	. . . . . . . 8 ⊢ ((𝑀 + 1) ∈ ℤ → (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)) = (𝐹‘(𝑀 + 1)))
37	1, 35, 36	3syl 18	. . . . . . 7 ⊢ (𝜑 → (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)) = (𝐹‘(𝑀 + 1)))
38	37	oveq2d 7464	. . . . . 6 ⊢ (𝜑 → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))))
39	34, 38	eqtr4d 2783	. . . . 5 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))
40	39	a1i13 27	. . . 4 ⊢ ((𝑀 + 1) ∈ ℤ → (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))))
41		peano2fzr 13597	. . . . . . . 8 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
42	41	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
43	42	expr 456	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → 𝑛 ∈ ((𝑀 + 1)...𝑁)))
44	43	imim1d 82	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → ((𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛))) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))))
45		oveq1 7455	. . . . . 6 ⊢ ((seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) → ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))) = (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))))
46		simprl 770	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (ℤ≥‘(𝑀 + 1)))
47		peano2uz 12966	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → (𝑀 + 1) ∈ (ℤ≥‘𝐾))
48	32, 47	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝐾))
49	48	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑀 + 1) ∈ (ℤ≥‘𝐾))
50		uztrn 12921	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑀 + 1) ∈ (ℤ≥‘𝐾)) → 𝑛 ∈ (ℤ≥‘𝐾))
51	46, 49, 50	syl2anc 583	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (ℤ≥‘𝐾))
52		seqp1 14067	. . . . . . . 8 ⊢ (𝑛 ∈ (ℤ≥‘𝐾) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
53	51, 52	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
54		seqp1 14067	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)) = ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
55	46, 54	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)) = ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
56	55	oveq2d 7464	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
57		simpl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝜑)
58		eluzelz 12913	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → 𝑀 ∈ ℤ)
59	32, 58	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑀 ∈ ℤ)
60		peano2uzr 12968	. . . . . . . . . . . . . . 15 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑁 ∈ (ℤ≥‘𝑀))
61	59, 1, 60	syl2anc 583	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
62		fzss2 13624	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝐾...𝑀) ⊆ (𝐾...𝑁))
63	61, 62	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐾...𝑀) ⊆ (𝐾...𝑁))
64	63	sselda 4008	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐾...𝑀)) → 𝑥 ∈ (𝐾...𝑁))
65		seqsplit.5	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐾...𝑁)) → (𝐹‘𝑥) ∈ 𝑆)
66	64, 65	syldan 590	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐾...𝑀)) → (𝐹‘𝑥) ∈ 𝑆)
67		seqsplit.1	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
68	32, 66, 67	seqcl 14073	. . . . . . . . . 10 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘𝑀) ∈ 𝑆)
69	68	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq𝐾( + , 𝐹)‘𝑀) ∈ 𝑆)
70		elfzuz3 13581	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ ((𝑀 + 1)...𝑁) → 𝑁 ∈ (ℤ≥‘𝑛))
71		fzss2 13624	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ (ℤ≥‘𝑛) → ((𝑀 + 1)...𝑛) ⊆ ((𝑀 + 1)...𝑁))
72	42, 70, 71	3syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((𝑀 + 1)...𝑛) ⊆ ((𝑀 + 1)...𝑁))
73		fzss1 13623	. . . . . . . . . . . . . . 15 ⊢ ((𝑀 + 1) ∈ (ℤ≥‘𝐾) → ((𝑀 + 1)...𝑁) ⊆ (𝐾...𝑁))
74	32, 47, 73	3syl 18	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) ⊆ (𝐾...𝑁))
75	74	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((𝑀 + 1)...𝑁) ⊆ (𝐾...𝑁))
76	72, 75	sstrd 4019	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((𝑀 + 1)...𝑛) ⊆ (𝐾...𝑁))
77	76	sselda 4008	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ 𝑥 ∈ ((𝑀 + 1)...𝑛)) → 𝑥 ∈ (𝐾...𝑁))
78	65	adantlr 714	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ 𝑥 ∈ (𝐾...𝑁)) → (𝐹‘𝑥) ∈ 𝑆)
79	77, 78	syldan 590	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ 𝑥 ∈ ((𝑀 + 1)...𝑛)) → (𝐹‘𝑥) ∈ 𝑆)
80	67	adantlr 714	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
81	46, 79, 80	seqcl 14073	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq(𝑀 + 1)( + , 𝐹)‘𝑛) ∈ 𝑆)
82		fveq2 6920	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑛 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑛 + 1)))
83	82	eleq1d 2829	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → ((𝐹‘𝑥) ∈ 𝑆 ↔ (𝐹‘(𝑛 + 1)) ∈ 𝑆))
84	65	ralrimiva 3152	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ (𝐾...𝑁)(𝐹‘𝑥) ∈ 𝑆)
85	84	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ∀𝑥 ∈ (𝐾...𝑁)(𝐹‘𝑥) ∈ 𝑆)
86		simpr 484	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))
87		ssel2 4003	. . . . . . . . . . 11 ⊢ ((((𝑀 + 1)...𝑁) ⊆ (𝐾...𝑁) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝑛 + 1) ∈ (𝐾...𝑁))
88	74, 86, 87	syl2an 595	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑛 + 1) ∈ (𝐾...𝑁))
89	83, 85, 88	rspcdva 3636	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
90		seqsplit.2	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
91	90	caovassg 7648	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((seq𝐾( + , 𝐹)‘𝑀) ∈ 𝑆 ∧ (seq(𝑀 + 1)( + , 𝐹)‘𝑛) ∈ 𝑆 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑆)) → (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
92	57, 69, 81, 89, 91	syl13anc 1372	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
93	56, 92	eqtr4d 2783	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))) = (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))))
94	53, 93	eqeq12d 2756	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))) ↔ ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))) = (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1)))))
95	45, 94	imbitrrid 246	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))
96	44, 95	animpimp2impd 845	. . . 4 ⊢ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → ((𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))) → (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))))
97	10, 17, 24, 31, 40, 96	uzind4 12971	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))))
98	1, 97	mpcom 38	. 2 ⊢ (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁))))
99	3, 98	mpd 15	1 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108  ∀wral 3067   ⊆ wss 3976  ‘cfv 6573  (class class class)co 7448  1c1 11185   + caddc 11187  ℤcz 12639  ℤ_≥cuz 12903  ...cfz 13567  seqcseq 14052

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-er 8763  df-en 9004  df-dom 9005  df-sdom 9006  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-nn 12294  df-n0 12554  df-z 12640  df-uz 12904  df-fz 13568  df-seq 14053

This theorem is referenced by:  seq1p  14087  seqf1olem2  14093  bcval5  14367  clim2ser  15703  clim2ser2  15704  isumsplit  15888  clim2div  15937  gsumsgrpccat  18875  mulgnndir  19143  mblfinlem2  37618  fmul01lt1lem1  45505  fmul01lt1lem2  45506