Theorem seq3split 10718

Description: Split a sequence into two sequences. (Contributed by Jim Kingdon, 16-Aug-2021.) (Revised by Jim Kingdon, 21-Oct-2022.)

Hypotheses

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

Assertion

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

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

Proof of Theorem seq3split

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		seq3split.3	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))
2		eluzfz2 10236	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑁 ∈ ((𝑀 + 1)...𝑁))
3	1, 2	syl 14	. 2 ⊢ (𝜑 → 𝑁 ∈ ((𝑀 + 1)...𝑁))
4		eleq1 2292	. . . . . 6 ⊢ (𝑥 = (𝑀 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑀 + 1) ∈ ((𝑀 + 1)...𝑁)))
5		fveq2 5629	. . . . . . 7 ⊢ (𝑥 = (𝑀 + 1) → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘(𝑀 + 1)))
6		fveq2 5629	. . . . . . . 8 ⊢ (𝑥 = (𝑀 + 1) → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)))
7	6	oveq2d 6023	. . . . . . 7 ⊢ (𝑥 = (𝑀 + 1) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))
8	5, 7	eqeq12d 2244	. . . . . 6 ⊢ (𝑥 = (𝑀 + 1) → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)))))
9	4, 8	imbi12d 234	. . . . 5 ⊢ (𝑥 = (𝑀 + 1) → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))))
10	9	imbi2d 230	. . . 4 ⊢ (𝑥 = (𝑀 + 1) → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)))))))
11		eleq1 2292	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑛 ∈ ((𝑀 + 1)...𝑁)))
12		fveq2 5629	. . . . . . 7 ⊢ (𝑥 = 𝑛 → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘𝑛))
13		fveq2 5629	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘𝑛))
14	13	oveq2d 6023	. . . . . . 7 ⊢ (𝑥 = 𝑛 → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))
15	12, 14	eqeq12d 2244	. . . . . 6 ⊢ (𝑥 = 𝑛 → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛))))
16	11, 15	imbi12d 234	. . . . 5 ⊢ (𝑥 = 𝑛 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ (𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))))
17	16	imbi2d 230	. . . 4 ⊢ (𝑥 = 𝑛 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛))))))
18		eleq1 2292	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)))
19		fveq2 5629	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘(𝑛 + 1)))
20		fveq2 5629	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))
21	20	oveq2d 6023	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))))
22	19, 21	eqeq12d 2244	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))
23	18, 22	imbi12d 234	. . . . 5 ⊢ (𝑥 = (𝑛 + 1) → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))))))
24	23	imbi2d 230	. . . 4 ⊢ (𝑥 = (𝑛 + 1) → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))))
25		eleq1 2292	. . . . . 6 ⊢ (𝑥 = 𝑁 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑁 ∈ ((𝑀 + 1)...𝑁)))
26		fveq2 5629	. . . . . . 7 ⊢ (𝑥 = 𝑁 → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘𝑁))
27		fveq2 5629	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘𝑁))
28	27	oveq2d 6023	. . . . . . 7 ⊢ (𝑥 = 𝑁 → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))
29	26, 28	eqeq12d 2244	. . . . . 6 ⊢ (𝑥 = 𝑁 → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁))))
30	25, 29	imbi12d 234	. . . . 5 ⊢ (𝑥 = 𝑁 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))))
31	30	imbi2d 230	. . . 4 ⊢ (𝑥 = 𝑁 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁))))))
32		seq3split.4	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝐾))
33		seq3split.5	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑥) ∈ 𝑆)
34		seq3split.1	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
35	32, 33, 34	seq3p1 10695	. . . . . 6 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))))
36		eluzel2 9735	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → (𝑀 + 1) ∈ ℤ)
37	1, 36	syl 14	. . . . . . . 8 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ)
38		simpl 109	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝜑)
39		eluzel2 9735	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → 𝐾 ∈ ℤ)
40	32, 39	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐾 ∈ ℤ)
41	40	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝐾 ∈ ℤ)
42		eluzelz 9739	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (ℤ≥‘(𝑀 + 1)) → 𝑥 ∈ ℤ)
43	42	adantl 277	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑥 ∈ ℤ)
44	41	zred 9577	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝐾 ∈ ℝ)
45		eluzelz 9739	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → 𝑀 ∈ ℤ)
46	32, 45	syl 14	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑀 ∈ ℤ)
47	46	zred 9577	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑀 ∈ ℝ)
48	47	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑀 ∈ ℝ)
49	43	zred 9577	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑥 ∈ ℝ)
50		eluzle 9742	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → 𝐾 ≤ 𝑀)
51	32, 50	syl 14	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐾 ≤ 𝑀)
52	51	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝐾 ≤ 𝑀)
53		peano2re 8290	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ ℝ → (𝑀 + 1) ∈ ℝ)
54	48, 53	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → (𝑀 + 1) ∈ ℝ)
55	48	lep1d 9086	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑀 ≤ (𝑀 + 1))
56		eluzle 9742	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (ℤ≥‘(𝑀 + 1)) → (𝑀 + 1) ≤ 𝑥)
57	56	adantl 277	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → (𝑀 + 1) ≤ 𝑥)
58	48, 54, 49, 55, 57	letrd 8278	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑀 ≤ 𝑥)
59	44, 48, 49, 52, 58	letrd 8278	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝐾 ≤ 𝑥)
60		eluz2 9736	. . . . . . . . . 10 ⊢ (𝑥 ∈ (ℤ≥‘𝐾) ↔ (𝐾 ∈ ℤ ∧ 𝑥 ∈ ℤ ∧ 𝐾 ≤ 𝑥))
61	41, 43, 59, 60	syl3anbrc 1205	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → 𝑥 ∈ (ℤ≥‘𝐾))
62	38, 61, 33	syl2anc 411	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐹‘𝑥) ∈ 𝑆)
63	37, 62, 34	seq3-1 10692	. . . . . . 7 ⊢ (𝜑 → (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)) = (𝐹‘(𝑀 + 1)))
64	63	oveq2d 6023	. . . . . 6 ⊢ (𝜑 → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))))
65	35, 64	eqtr4d 2265	. . . . 5 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))
66	65	a1i13 24	. . . 4 ⊢ ((𝑀 + 1) ∈ ℤ → (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))))
67		peano2fzr 10241	. . . . . . . 8 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
68	67	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
69	68	expr 375	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → 𝑛 ∈ ((𝑀 + 1)...𝑁)))
70	69	imim1d 75	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘(𝑀 + 1))) → ((𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛))) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))))
71		oveq1 6014	. . . . . 6 ⊢ ((seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) → ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))) = (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))))
72		simprl 529	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (ℤ≥‘(𝑀 + 1)))
73		peano2uz 9786	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ≥‘𝐾) → (𝑀 + 1) ∈ (ℤ≥‘𝐾))
74	32, 73	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀 + 1) ∈ (ℤ≥‘𝐾))
75	74	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑀 + 1) ∈ (ℤ≥‘𝐾))
76		uztrn 9747	. . . . . . . . 9 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑀 + 1) ∈ (ℤ≥‘𝐾)) → 𝑛 ∈ (ℤ≥‘𝐾))
77	72, 75, 76	syl2anc 411	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (ℤ≥‘𝐾))
78	33	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → (𝐹‘𝑥) ∈ 𝑆)
79	34	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
80	77, 78, 79	seq3p1 10695	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
81	62	adantlr 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ 𝑥 ∈ (ℤ≥‘(𝑀 + 1))) → (𝐹‘𝑥) ∈ 𝑆)
82	72, 81, 79	seq3p1 10695	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)) = ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
83	82	oveq2d 6023	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
84		simpl 109	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝜑)
85		eqid 2229	. . . . . . . . . . . 12 ⊢ (ℤ≥‘𝐾) = (ℤ≥‘𝐾)
86	85, 40, 33, 34	seqf 10694	. . . . . . . . . . 11 ⊢ (𝜑 → seq𝐾( + , 𝐹):(ℤ≥‘𝐾)⟶𝑆)
87	86, 32	ffvelcdmd 5773	. . . . . . . . . 10 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘𝑀) ∈ 𝑆)
88	87	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq𝐾( + , 𝐹)‘𝑀) ∈ 𝑆)
89		eqid 2229	. . . . . . . . . . 11 ⊢ (ℤ≥‘(𝑀 + 1)) = (ℤ≥‘(𝑀 + 1))
90	37	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑀 + 1) ∈ ℤ)
91	89, 90, 81, 79	seqf 10694	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → seq(𝑀 + 1)( + , 𝐹):(ℤ≥‘(𝑀 + 1))⟶𝑆)
92	91, 72	ffvelcdmd 5773	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq(𝑀 + 1)( + , 𝐹)‘𝑛) ∈ 𝑆)
93		fveq2 5629	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑛 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑛 + 1)))
94	93	eleq1d 2298	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → ((𝐹‘𝑥) ∈ 𝑆 ↔ (𝐹‘(𝑛 + 1)) ∈ 𝑆))
95	33	ralrimiva 2603	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ (ℤ≥‘𝐾)(𝐹‘𝑥) ∈ 𝑆)
96	95	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ∀𝑥 ∈ (ℤ≥‘𝐾)(𝐹‘𝑥) ∈ 𝑆)
97		fzssuz 10269	. . . . . . . . . . . 12 ⊢ ((𝑀 + 1)...𝑁) ⊆ (ℤ≥‘(𝑀 + 1))
98		uzss 9751	. . . . . . . . . . . . 13 ⊢ ((𝑀 + 1) ∈ (ℤ≥‘𝐾) → (ℤ≥‘(𝑀 + 1)) ⊆ (ℤ≥‘𝐾))
99	74, 98	syl 14	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℤ≥‘(𝑀 + 1)) ⊆ (ℤ≥‘𝐾))
100	97, 99	sstrid 3235	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) ⊆ (ℤ≥‘𝐾))
101		simpr 110	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))
102		ssel2 3219	. . . . . . . . . . 11 ⊢ ((((𝑀 + 1)...𝑁) ⊆ (ℤ≥‘𝐾) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝑛 + 1) ∈ (ℤ≥‘𝐾))
103	100, 101, 102	syl2an 289	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑛 + 1) ∈ (ℤ≥‘𝐾))
104	94, 96, 103	rspcdva 2912	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
105		seq3split.2	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
106	105	caovassg 6170	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((seq𝐾( + , 𝐹)‘𝑀) ∈ 𝑆 ∧ (seq(𝑀 + 1)( + , 𝐹)‘𝑛) ∈ 𝑆 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑆)) → (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
107	84, 88, 92, 104, 106	syl13anc 1273	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
108	83, 107	eqtr4d 2265	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))) = (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))))
109	80, 108	eqeq12d 2244	. . . . . 6 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))) ↔ ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))) = (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1)))))
110	71, 109	imbitrrid 156	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))
111	70, 110	animpimp2impd 559	. . . 4 ⊢ (𝑛 ∈ (ℤ≥‘(𝑀 + 1)) → ((𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))) → (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))))
112	10, 17, 24, 31, 66, 111	uzind4 9791	. . 3 ⊢ (𝑁 ∈ (ℤ≥‘(𝑀 + 1)) → (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))))
113	1, 112	mpcom 36	. 2 ⊢ (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁))))
114	3, 113	mpd 13	1 ⊢ (𝜑 → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200  ∀wral 2508   ⊆ wss 3197   class class class wbr 4083  ‘cfv 5318  (class class class)co 6007  ℝcr 8006  1c1 8008   + caddc 8010   ≤ cle 8190  ℤcz 9454  ℤ_≥cuz 9730  ...cfz 10212  seqcseq 10677

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8098  ax-resscn 8099  ax-1cn 8100  ax-1re 8101  ax-icn 8102  ax-addcl 8103  ax-addrcl 8104  ax-mulcl 8105  ax-addcom 8107  ax-addass 8109  ax-distr 8111  ax-i2m1 8112  ax-0lt1 8113  ax-0id 8115  ax-rnegex 8116  ax-cnre 8118  ax-pre-ltirr 8119  ax-pre-ltwlin 8120  ax-pre-lttrn 8121  ax-pre-ltadd 8123

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-frec 6543  df-pnf 8191  df-mnf 8192  df-xr 8193  df-ltxr 8194  df-le 8195  df-sub 8327  df-neg 8328  df-inn 9119  df-n0 9378  df-z 9455  df-uz 9731  df-fz 10213  df-seqfrec 10678

This theorem is referenced by:  seq3-1p  10720  seq3f1olemqsumk  10742  seq3f1olemqsum  10743  bcval5  10993  clim2ser  11856  clim2ser2  11857  isumsplit  12010  cvgratnnlemseq  12045  clim2divap  12059  mulgnndir  13696