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

Theorem seq3split 10478
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.
StepHypRef Expression
1 seq3split.3 . . 3 (𝜑𝑁 ∈ (ℤ‘(𝑀 + 1)))
2 eluzfz2 10031 . . 3 (𝑁 ∈ (ℤ‘(𝑀 + 1)) → 𝑁 ∈ ((𝑀 + 1)...𝑁))
31, 2syl 14 . 2 (𝜑𝑁 ∈ ((𝑀 + 1)...𝑁))
4 eleq1 2240 . . . . . 6 (𝑥 = (𝑀 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑀 + 1) ∈ ((𝑀 + 1)...𝑁)))
5 fveq2 5515 . . . . . . 7 (𝑥 = (𝑀 + 1) → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘(𝑀 + 1)))
6 fveq2 5515 . . . . . . . 8 (𝑥 = (𝑀 + 1) → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)))
76oveq2d 5890 . . . . . . 7 (𝑥 = (𝑀 + 1) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))
85, 7eqeq12d 2192 . . . . . 6 (𝑥 = (𝑀 + 1) → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)))))
94, 8imbi12d 234 . . . . 5 (𝑥 = (𝑀 + 1) → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))))
109imbi2d 230 . . . 4 (𝑥 = (𝑀 + 1) → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)))))))
11 eleq1 2240 . . . . . 6 (𝑥 = 𝑛 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑛 ∈ ((𝑀 + 1)...𝑁)))
12 fveq2 5515 . . . . . . 7 (𝑥 = 𝑛 → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘𝑛))
13 fveq2 5515 . . . . . . . 8 (𝑥 = 𝑛 → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘𝑛))
1413oveq2d 5890 . . . . . . 7 (𝑥 = 𝑛 → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))
1512, 14eqeq12d 2192 . . . . . 6 (𝑥 = 𝑛 → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛))))
1611, 15imbi12d 234 . . . . 5 (𝑥 = 𝑛 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ (𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))))
1716imbi2d 230 . . . 4 (𝑥 = 𝑛 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛))))))
18 eleq1 2240 . . . . . 6 (𝑥 = (𝑛 + 1) → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)))
19 fveq2 5515 . . . . . . 7 (𝑥 = (𝑛 + 1) → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘(𝑛 + 1)))
20 fveq2 5515 . . . . . . . 8 (𝑥 = (𝑛 + 1) → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))
2120oveq2d 5890 . . . . . . 7 (𝑥 = (𝑛 + 1) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))))
2219, 21eqeq12d 2192 . . . . . 6 (𝑥 = (𝑛 + 1) → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))
2318, 22imbi12d 234 . . . . 5 (𝑥 = (𝑛 + 1) → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))))))
2423imbi2d 230 . . . 4 (𝑥 = (𝑛 + 1) → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))))
25 eleq1 2240 . . . . . 6 (𝑥 = 𝑁 → (𝑥 ∈ ((𝑀 + 1)...𝑁) ↔ 𝑁 ∈ ((𝑀 + 1)...𝑁)))
26 fveq2 5515 . . . . . . 7 (𝑥 = 𝑁 → (seq𝐾( + , 𝐹)‘𝑥) = (seq𝐾( + , 𝐹)‘𝑁))
27 fveq2 5515 . . . . . . . 8 (𝑥 = 𝑁 → (seq(𝑀 + 1)( + , 𝐹)‘𝑥) = (seq(𝑀 + 1)( + , 𝐹)‘𝑁))
2827oveq2d 5890 . . . . . . 7 (𝑥 = 𝑁 → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))
2926, 28eqeq12d 2192 . . . . . 6 (𝑥 = 𝑁 → ((seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)) ↔ (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁))))
3025, 29imbi12d 234 . . . . 5 (𝑥 = 𝑁 → ((𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥))) ↔ (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))))
3130imbi2d 230 . . . 4 (𝑥 = 𝑁 → ((𝜑 → (𝑥 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑥) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑥)))) ↔ (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁))))))
32 seq3split.4 . . . . . . 7 (𝜑𝑀 ∈ (ℤ𝐾))
33 seq3split.5 . . . . . . 7 ((𝜑𝑥 ∈ (ℤ𝐾)) → (𝐹𝑥) ∈ 𝑆)
34 seq3split.1 . . . . . . 7 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
3532, 33, 34seq3p1 10461 . . . . . 6 (𝜑 → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))))
36 eluzel2 9532 . . . . . . . . 9 (𝑁 ∈ (ℤ‘(𝑀 + 1)) → (𝑀 + 1) ∈ ℤ)
371, 36syl 14 . . . . . . . 8 (𝜑 → (𝑀 + 1) ∈ ℤ)
38 simpl 109 . . . . . . . . 9 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝜑)
39 eluzel2 9532 . . . . . . . . . . . 12 (𝑀 ∈ (ℤ𝐾) → 𝐾 ∈ ℤ)
4032, 39syl 14 . . . . . . . . . . 11 (𝜑𝐾 ∈ ℤ)
4140adantr 276 . . . . . . . . . 10 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝐾 ∈ ℤ)
42 eluzelz 9536 . . . . . . . . . . 11 (𝑥 ∈ (ℤ‘(𝑀 + 1)) → 𝑥 ∈ ℤ)
4342adantl 277 . . . . . . . . . 10 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝑥 ∈ ℤ)
4441zred 9374 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝐾 ∈ ℝ)
45 eluzelz 9536 . . . . . . . . . . . . . 14 (𝑀 ∈ (ℤ𝐾) → 𝑀 ∈ ℤ)
4632, 45syl 14 . . . . . . . . . . . . 13 (𝜑𝑀 ∈ ℤ)
4746zred 9374 . . . . . . . . . . . 12 (𝜑𝑀 ∈ ℝ)
4847adantr 276 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝑀 ∈ ℝ)
4943zred 9374 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝑥 ∈ ℝ)
50 eluzle 9539 . . . . . . . . . . . . 13 (𝑀 ∈ (ℤ𝐾) → 𝐾𝑀)
5132, 50syl 14 . . . . . . . . . . . 12 (𝜑𝐾𝑀)
5251adantr 276 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝐾𝑀)
53 peano2re 8092 . . . . . . . . . . . . 13 (𝑀 ∈ ℝ → (𝑀 + 1) ∈ ℝ)
5448, 53syl 14 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → (𝑀 + 1) ∈ ℝ)
5548lep1d 8887 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝑀 ≤ (𝑀 + 1))
56 eluzle 9539 . . . . . . . . . . . . 13 (𝑥 ∈ (ℤ‘(𝑀 + 1)) → (𝑀 + 1) ≤ 𝑥)
5756adantl 277 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → (𝑀 + 1) ≤ 𝑥)
5848, 54, 49, 55, 57letrd 8080 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝑀𝑥)
5944, 48, 49, 52, 58letrd 8080 . . . . . . . . . 10 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝐾𝑥)
60 eluz2 9533 . . . . . . . . . 10 (𝑥 ∈ (ℤ𝐾) ↔ (𝐾 ∈ ℤ ∧ 𝑥 ∈ ℤ ∧ 𝐾𝑥))
6141, 43, 59, 60syl3anbrc 1181 . . . . . . . . 9 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → 𝑥 ∈ (ℤ𝐾))
6238, 61, 33syl2anc 411 . . . . . . . 8 ((𝜑𝑥 ∈ (ℤ‘(𝑀 + 1))) → (𝐹𝑥) ∈ 𝑆)
6337, 62, 34seq3-1 10459 . . . . . . 7 (𝜑 → (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1)) = (𝐹‘(𝑀 + 1)))
6463oveq2d 5890 . . . . . 6 (𝜑 → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + (𝐹‘(𝑀 + 1))))
6535, 64eqtr4d 2213 . . . . 5 (𝜑 → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))
6665a1i13 24 . . . 4 ((𝑀 + 1) ∈ ℤ → (𝜑 → ((𝑀 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑀 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑀 + 1))))))
67 peano2fzr 10036 . . . . . . . 8 ((𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
6867adantl 277 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ ((𝑀 + 1)...𝑁))
6968expr 375 . . . . . 6 ((𝜑𝑛 ∈ (ℤ‘(𝑀 + 1))) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → 𝑛 ∈ ((𝑀 + 1)...𝑁)))
7069imim1d 75 . . . . 5 ((𝜑𝑛 ∈ (ℤ‘(𝑀 + 1))) → ((𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛))) → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))))
71 oveq1 5881 . . . . . 6 ((seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) → ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))) = (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))))
72 simprl 529 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (ℤ‘(𝑀 + 1)))
73 peano2uz 9582 . . . . . . . . . . 11 (𝑀 ∈ (ℤ𝐾) → (𝑀 + 1) ∈ (ℤ𝐾))
7432, 73syl 14 . . . . . . . . . 10 (𝜑 → (𝑀 + 1) ∈ (ℤ𝐾))
7574adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑀 + 1) ∈ (ℤ𝐾))
76 uztrn 9543 . . . . . . . . 9 ((𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑀 + 1) ∈ (ℤ𝐾)) → 𝑛 ∈ (ℤ𝐾))
7772, 75, 76syl2anc 411 . . . . . . . 8 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝑛 ∈ (ℤ𝐾))
7833adantlr 477 . . . . . . . 8 (((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ 𝑥 ∈ (ℤ𝐾)) → (𝐹𝑥) ∈ 𝑆)
7934adantlr 477 . . . . . . . 8 (((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
8077, 78, 79seq3p1 10461 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
8162adantlr 477 . . . . . . . . . 10 (((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) ∧ 𝑥 ∈ (ℤ‘(𝑀 + 1))) → (𝐹𝑥) ∈ 𝑆)
8272, 81, 79seq3p1 10461 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)) = ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
8382oveq2d 5890 . . . . . . . 8 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
84 simpl 109 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → 𝜑)
85 eqid 2177 . . . . . . . . . . . 12 (ℤ𝐾) = (ℤ𝐾)
8685, 40, 33, 34seqf 10460 . . . . . . . . . . 11 (𝜑 → seq𝐾( + , 𝐹):(ℤ𝐾)⟶𝑆)
8786, 32ffvelcdmd 5652 . . . . . . . . . 10 (𝜑 → (seq𝐾( + , 𝐹)‘𝑀) ∈ 𝑆)
8887adantr 276 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq𝐾( + , 𝐹)‘𝑀) ∈ 𝑆)
89 eqid 2177 . . . . . . . . . . 11 (ℤ‘(𝑀 + 1)) = (ℤ‘(𝑀 + 1))
9037adantr 276 . . . . . . . . . . 11 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑀 + 1) ∈ ℤ)
9189, 90, 81, 79seqf 10460 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → seq(𝑀 + 1)( + , 𝐹):(ℤ‘(𝑀 + 1))⟶𝑆)
9291, 72ffvelcdmd 5652 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (seq(𝑀 + 1)( + , 𝐹)‘𝑛) ∈ 𝑆)
93 fveq2 5515 . . . . . . . . . . 11 (𝑥 = (𝑛 + 1) → (𝐹𝑥) = (𝐹‘(𝑛 + 1)))
9493eleq1d 2246 . . . . . . . . . 10 (𝑥 = (𝑛 + 1) → ((𝐹𝑥) ∈ 𝑆 ↔ (𝐹‘(𝑛 + 1)) ∈ 𝑆))
9533ralrimiva 2550 . . . . . . . . . . 11 (𝜑 → ∀𝑥 ∈ (ℤ𝐾)(𝐹𝑥) ∈ 𝑆)
9695adantr 276 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ∀𝑥 ∈ (ℤ𝐾)(𝐹𝑥) ∈ 𝑆)
97 fzssuz 10064 . . . . . . . . . . . 12 ((𝑀 + 1)...𝑁) ⊆ (ℤ‘(𝑀 + 1))
98 uzss 9547 . . . . . . . . . . . . 13 ((𝑀 + 1) ∈ (ℤ𝐾) → (ℤ‘(𝑀 + 1)) ⊆ (ℤ𝐾))
9974, 98syl 14 . . . . . . . . . . . 12 (𝜑 → (ℤ‘(𝑀 + 1)) ⊆ (ℤ𝐾))
10097, 99sstrid 3166 . . . . . . . . . . 11 (𝜑 → ((𝑀 + 1)...𝑁) ⊆ (ℤ𝐾))
101 simpr 110 . . . . . . . . . . 11 ((𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))
102 ssel2 3150 . . . . . . . . . . 11 ((((𝑀 + 1)...𝑁) ⊆ (ℤ𝐾) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁)) → (𝑛 + 1) ∈ (ℤ𝐾))
103100, 101, 102syl2an 289 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝑛 + 1) ∈ (ℤ𝐾))
10494, 96, 103rspcdva 2846 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
105 seq3split.2 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
106105caovassg 6032 . . . . . . . . 9 ((𝜑 ∧ ((seq𝐾( + , 𝐹)‘𝑀) ∈ 𝑆 ∧ (seq(𝑀 + 1)( + , 𝐹)‘𝑛) ∈ 𝑆 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑆)) → (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
10784, 88, 92, 104, 106syl13anc 1240 . . . . . . . 8 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))) = ((seq𝐾( + , 𝐹)‘𝑀) + ((seq(𝑀 + 1)( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
10883, 107eqtr4d 2213 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))) = (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1))))
10980, 108eqeq12d 2192 . . . . . 6 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1))) ↔ ((seq𝐾( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))) = (((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) + (𝐹‘(𝑛 + 1)))))
11071, 109imbitrrid 156 . . . . 5 ((𝜑 ∧ (𝑛 ∈ (ℤ‘(𝑀 + 1)) ∧ (𝑛 + 1) ∈ ((𝑀 + 1)...𝑁))) → ((seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))
11170, 110animpimp2impd 559 . . . 4 (𝑛 ∈ (ℤ‘(𝑀 + 1)) → ((𝜑 → (𝑛 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑛) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑛)))) → (𝜑 → ((𝑛 + 1) ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘(𝑛 + 1)) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘(𝑛 + 1)))))))
11210, 17, 24, 31, 66, 111uzind4 9587 . . 3 (𝑁 ∈ (ℤ‘(𝑀 + 1)) → (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))))
1131, 112mpcom 36 . 2 (𝜑 → (𝑁 ∈ ((𝑀 + 1)...𝑁) → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁))))
1143, 113mpd 13 1 (𝜑 → (seq𝐾( + , 𝐹)‘𝑁) = ((seq𝐾( + , 𝐹)‘𝑀) + (seq(𝑀 + 1)( + , 𝐹)‘𝑁)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 978   = wceq 1353  wcel 2148  wral 2455  wss 3129   class class class wbr 4003  cfv 5216  (class class class)co 5874  cr 7809  1c1 7811   + caddc 7813  cle 7992  cz 9252  cuz 9527  ...cfz 10007  seqcseq 10444
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4118  ax-sep 4121  ax-nul 4129  ax-pow 4174  ax-pr 4209  ax-un 4433  ax-setind 4536  ax-iinf 4587  ax-cnex 7901  ax-resscn 7902  ax-1cn 7903  ax-1re 7904  ax-icn 7905  ax-addcl 7906  ax-addrcl 7907  ax-mulcl 7908  ax-addcom 7910  ax-addass 7912  ax-distr 7914  ax-i2m1 7915  ax-0lt1 7916  ax-0id 7918  ax-rnegex 7919  ax-cnre 7921  ax-pre-ltirr 7922  ax-pre-ltwlin 7923  ax-pre-lttrn 7924  ax-pre-ltadd 7926
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4004  df-opab 4065  df-mpt 4066  df-tr 4102  df-id 4293  df-iord 4366  df-on 4368  df-ilim 4369  df-suc 4371  df-iom 4590  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-f1 5221  df-fo 5222  df-f1o 5223  df-fv 5224  df-riota 5830  df-ov 5877  df-oprab 5878  df-mpo 5879  df-1st 6140  df-2nd 6141  df-recs 6305  df-frec 6391  df-pnf 7993  df-mnf 7994  df-xr 7995  df-ltxr 7996  df-le 7997  df-sub 8129  df-neg 8130  df-inn 8919  df-n0 9176  df-z 9253  df-uz 9528  df-fz 10008  df-seqfrec 10445
This theorem is referenced by:  seq3-1p  10479  seq3f1olemqsumk  10498  seq3f1olemqsum  10499  bcval5  10742  clim2ser  11344  clim2ser2  11345  isumsplit  11498  cvgratnnlemseq  11533  clim2divap  11547  mulgnndir  13010
  Copyright terms: Public domain W3C validator