Step | Hyp | Ref
| Expression |
1 | | seqshft2.1 |
. . 3
⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
2 | | eluzfz2 12220 |
. . 3
⊢ (𝑁 ∈
(ℤ≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁)) |
3 | 1, 2 | syl 17 |
. 2
⊢ (𝜑 → 𝑁 ∈ (𝑀...𝑁)) |
4 | | eleq1 2676 |
. . . . . 6
⊢ (𝑥 = 𝑀 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑀 ∈ (𝑀...𝑁))) |
5 | | fveq2 6103 |
. . . . . . 7
⊢ (𝑥 = 𝑀 → (seq𝑀( + , 𝐹)‘𝑥) = (seq𝑀( + , 𝐹)‘𝑀)) |
6 | | oveq1 6556 |
. . . . . . . 8
⊢ (𝑥 = 𝑀 → (𝑥 + 𝐾) = (𝑀 + 𝐾)) |
7 | 6 | fveq2d 6107 |
. . . . . . 7
⊢ (𝑥 = 𝑀 → (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑀 + 𝐾))) |
8 | 5, 7 | eqeq12d 2625 |
. . . . . 6
⊢ (𝑥 = 𝑀 → ((seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)) ↔ (seq𝑀( + , 𝐹)‘𝑀) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑀 + 𝐾)))) |
9 | 4, 8 | imbi12d 333 |
. . . . 5
⊢ (𝑥 = 𝑀 → ((𝑥 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾))) ↔ (𝑀 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑀) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑀 + 𝐾))))) |
10 | 9 | imbi2d 329 |
. . . 4
⊢ (𝑥 = 𝑀 → ((𝜑 → (𝑥 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)))) ↔ (𝜑 → (𝑀 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑀) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑀 + 𝐾)))))) |
11 | | eleq1 2676 |
. . . . . 6
⊢ (𝑥 = 𝑛 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑛 ∈ (𝑀...𝑁))) |
12 | | fveq2 6103 |
. . . . . . 7
⊢ (𝑥 = 𝑛 → (seq𝑀( + , 𝐹)‘𝑥) = (seq𝑀( + , 𝐹)‘𝑛)) |
13 | | oveq1 6556 |
. . . . . . . 8
⊢ (𝑥 = 𝑛 → (𝑥 + 𝐾) = (𝑛 + 𝐾)) |
14 | 13 | fveq2d 6107 |
. . . . . . 7
⊢ (𝑥 = 𝑛 → (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾))) |
15 | 12, 14 | eqeq12d 2625 |
. . . . . 6
⊢ (𝑥 = 𝑛 → ((seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)) ↔ (seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)))) |
16 | 11, 15 | imbi12d 333 |
. . . . 5
⊢ (𝑥 = 𝑛 → ((𝑥 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾))) ↔ (𝑛 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾))))) |
17 | 16 | imbi2d 329 |
. . . 4
⊢ (𝑥 = 𝑛 → ((𝜑 → (𝑥 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)))) ↔ (𝜑 → (𝑛 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)))))) |
18 | | eleq1 2676 |
. . . . . 6
⊢ (𝑥 = (𝑛 + 1) → (𝑥 ∈ (𝑀...𝑁) ↔ (𝑛 + 1) ∈ (𝑀...𝑁))) |
19 | | fveq2 6103 |
. . . . . . 7
⊢ (𝑥 = (𝑛 + 1) → (seq𝑀( + , 𝐹)‘𝑥) = (seq𝑀( + , 𝐹)‘(𝑛 + 1))) |
20 | | oveq1 6556 |
. . . . . . . 8
⊢ (𝑥 = (𝑛 + 1) → (𝑥 + 𝐾) = ((𝑛 + 1) + 𝐾)) |
21 | 20 | fveq2d 6107 |
. . . . . . 7
⊢ (𝑥 = (𝑛 + 1) → (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾))) |
22 | 19, 21 | eqeq12d 2625 |
. . . . . 6
⊢ (𝑥 = (𝑛 + 1) → ((seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)) ↔ (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾)))) |
23 | 18, 22 | imbi12d 333 |
. . . . 5
⊢ (𝑥 = (𝑛 + 1) → ((𝑥 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾))) ↔ ((𝑛 + 1) ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾))))) |
24 | 23 | imbi2d 329 |
. . . 4
⊢ (𝑥 = (𝑛 + 1) → ((𝜑 → (𝑥 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)))) ↔ (𝜑 → ((𝑛 + 1) ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾)))))) |
25 | | eleq1 2676 |
. . . . . 6
⊢ (𝑥 = 𝑁 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑁 ∈ (𝑀...𝑁))) |
26 | | fveq2 6103 |
. . . . . . 7
⊢ (𝑥 = 𝑁 → (seq𝑀( + , 𝐹)‘𝑥) = (seq𝑀( + , 𝐹)‘𝑁)) |
27 | | oveq1 6556 |
. . . . . . . 8
⊢ (𝑥 = 𝑁 → (𝑥 + 𝐾) = (𝑁 + 𝐾)) |
28 | 27 | fveq2d 6107 |
. . . . . . 7
⊢ (𝑥 = 𝑁 → (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑁 + 𝐾))) |
29 | 26, 28 | eqeq12d 2625 |
. . . . . 6
⊢ (𝑥 = 𝑁 → ((seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)) ↔ (seq𝑀( + , 𝐹)‘𝑁) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑁 + 𝐾)))) |
30 | 25, 29 | imbi12d 333 |
. . . . 5
⊢ (𝑥 = 𝑁 → ((𝑥 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾))) ↔ (𝑁 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑁) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑁 + 𝐾))))) |
31 | 30 | imbi2d 329 |
. . . 4
⊢ (𝑥 = 𝑁 → ((𝜑 → (𝑥 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑥) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑥 + 𝐾)))) ↔ (𝜑 → (𝑁 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑁) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑁 + 𝐾)))))) |
32 | | eluzfz1 12219 |
. . . . . . . . 9
⊢ (𝑁 ∈
(ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁)) |
33 | 1, 32 | syl 17 |
. . . . . . . 8
⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁)) |
34 | | seqshft2.3 |
. . . . . . . . 9
⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) = (𝐺‘(𝑘 + 𝐾))) |
35 | 34 | ralrimiva 2949 |
. . . . . . . 8
⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) = (𝐺‘(𝑘 + 𝐾))) |
36 | | fveq2 6103 |
. . . . . . . . . 10
⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀)) |
37 | | oveq1 6556 |
. . . . . . . . . . 11
⊢ (𝑘 = 𝑀 → (𝑘 + 𝐾) = (𝑀 + 𝐾)) |
38 | 37 | fveq2d 6107 |
. . . . . . . . . 10
⊢ (𝑘 = 𝑀 → (𝐺‘(𝑘 + 𝐾)) = (𝐺‘(𝑀 + 𝐾))) |
39 | 36, 38 | eqeq12d 2625 |
. . . . . . . . 9
⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) = (𝐺‘(𝑘 + 𝐾)) ↔ (𝐹‘𝑀) = (𝐺‘(𝑀 + 𝐾)))) |
40 | 39 | rspcv 3278 |
. . . . . . . 8
⊢ (𝑀 ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) = (𝐺‘(𝑘 + 𝐾)) → (𝐹‘𝑀) = (𝐺‘(𝑀 + 𝐾)))) |
41 | 33, 35, 40 | sylc 63 |
. . . . . . 7
⊢ (𝜑 → (𝐹‘𝑀) = (𝐺‘(𝑀 + 𝐾))) |
42 | | eluzel2 11568 |
. . . . . . . . 9
⊢ (𝑁 ∈
(ℤ≥‘𝑀) → 𝑀 ∈ ℤ) |
43 | 1, 42 | syl 17 |
. . . . . . . 8
⊢ (𝜑 → 𝑀 ∈ ℤ) |
44 | | seq1 12676 |
. . . . . . . 8
⊢ (𝑀 ∈ ℤ → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) |
45 | 43, 44 | syl 17 |
. . . . . . 7
⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹‘𝑀)) |
46 | | seqshft2.2 |
. . . . . . . . 9
⊢ (𝜑 → 𝐾 ∈ ℤ) |
47 | 43, 46 | zaddcld 11362 |
. . . . . . . 8
⊢ (𝜑 → (𝑀 + 𝐾) ∈ ℤ) |
48 | | seq1 12676 |
. . . . . . . 8
⊢ ((𝑀 + 𝐾) ∈ ℤ → (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑀 + 𝐾)) = (𝐺‘(𝑀 + 𝐾))) |
49 | 47, 48 | syl 17 |
. . . . . . 7
⊢ (𝜑 → (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑀 + 𝐾)) = (𝐺‘(𝑀 + 𝐾))) |
50 | 41, 45, 49 | 3eqtr4d 2654 |
. . . . . 6
⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑀 + 𝐾))) |
51 | 50 | a1d 25 |
. . . . 5
⊢ (𝜑 → (𝑀 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑀) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑀 + 𝐾)))) |
52 | 51 | a1i 11 |
. . . 4
⊢ (𝑀 ∈ ℤ → (𝜑 → (𝑀 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑀) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑀 + 𝐾))))) |
53 | | peano2fzr 12225 |
. . . . . . . . . 10
⊢ ((𝑛 ∈
(ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑛 ∈ (𝑀...𝑁)) |
54 | 53 | adantl 481 |
. . . . . . . . 9
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → 𝑛 ∈ (𝑀...𝑁)) |
55 | 54 | expr 641 |
. . . . . . . 8
⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝑛 + 1) ∈ (𝑀...𝑁) → 𝑛 ∈ (𝑀...𝑁))) |
56 | 55 | imim1d 80 |
. . . . . . 7
⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝑛 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾))) → ((𝑛 + 1) ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾))))) |
57 | | oveq1 6556 |
. . . . . . . . . 10
⊢
((seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) → ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))) = ((seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) + (𝐹‘(𝑛 + 1)))) |
58 | | simprl 790 |
. . . . . . . . . . . 12
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → 𝑛 ∈ (ℤ≥‘𝑀)) |
59 | | seqp1 12678 |
. . . . . . . . . . . 12
⊢ (𝑛 ∈
(ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) |
60 | 58, 59 | syl 17 |
. . . . . . . . . . 11
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) |
61 | 46 | adantr 480 |
. . . . . . . . . . . . . 14
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → 𝐾 ∈ ℤ) |
62 | | eluzadd 11592 |
. . . . . . . . . . . . . 14
⊢ ((𝑛 ∈
(ℤ≥‘𝑀) ∧ 𝐾 ∈ ℤ) → (𝑛 + 𝐾) ∈
(ℤ≥‘(𝑀 + 𝐾))) |
63 | 58, 61, 62 | syl2anc 691 |
. . . . . . . . . . . . 13
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → (𝑛 + 𝐾) ∈
(ℤ≥‘(𝑀 + 𝐾))) |
64 | | seqp1 12678 |
. . . . . . . . . . . . 13
⊢ ((𝑛 + 𝐾) ∈
(ℤ≥‘(𝑀 + 𝐾)) → (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 𝐾) + 1)) = ((seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) + (𝐺‘((𝑛 + 𝐾) + 1)))) |
65 | 63, 64 | syl 17 |
. . . . . . . . . . . 12
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 𝐾) + 1)) = ((seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) + (𝐺‘((𝑛 + 𝐾) + 1)))) |
66 | | eluzelz 11573 |
. . . . . . . . . . . . . . 15
⊢ (𝑛 ∈
(ℤ≥‘𝑀) → 𝑛 ∈ ℤ) |
67 | 58, 66 | syl 17 |
. . . . . . . . . . . . . 14
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → 𝑛 ∈ ℤ) |
68 | | zcn 11259 |
. . . . . . . . . . . . . . 15
⊢ (𝑛 ∈ ℤ → 𝑛 ∈
ℂ) |
69 | | zcn 11259 |
. . . . . . . . . . . . . . 15
⊢ (𝐾 ∈ ℤ → 𝐾 ∈
ℂ) |
70 | | ax-1cn 9873 |
. . . . . . . . . . . . . . . 16
⊢ 1 ∈
ℂ |
71 | | add32 10133 |
. . . . . . . . . . . . . . . 16
⊢ ((𝑛 ∈ ℂ ∧ 1 ∈
ℂ ∧ 𝐾 ∈
ℂ) → ((𝑛 + 1) +
𝐾) = ((𝑛 + 𝐾) + 1)) |
72 | 70, 71 | mp3an2 1404 |
. . . . . . . . . . . . . . 15
⊢ ((𝑛 ∈ ℂ ∧ 𝐾 ∈ ℂ) → ((𝑛 + 1) + 𝐾) = ((𝑛 + 𝐾) + 1)) |
73 | 68, 69, 72 | syl2an 493 |
. . . . . . . . . . . . . 14
⊢ ((𝑛 ∈ ℤ ∧ 𝐾 ∈ ℤ) → ((𝑛 + 1) + 𝐾) = ((𝑛 + 𝐾) + 1)) |
74 | 67, 61, 73 | syl2anc 691 |
. . . . . . . . . . . . 13
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → ((𝑛 + 1) + 𝐾) = ((𝑛 + 𝐾) + 1)) |
75 | 74 | fveq2d 6107 |
. . . . . . . . . . . 12
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 𝐾) + 1))) |
76 | | simprr 792 |
. . . . . . . . . . . . . . 15
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → (𝑛 + 1) ∈ (𝑀...𝑁)) |
77 | 35 | adantr 480 |
. . . . . . . . . . . . . . 15
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → ∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) = (𝐺‘(𝑘 + 𝐾))) |
78 | | fveq2 6103 |
. . . . . . . . . . . . . . . . 17
⊢ (𝑘 = (𝑛 + 1) → (𝐹‘𝑘) = (𝐹‘(𝑛 + 1))) |
79 | | oveq1 6556 |
. . . . . . . . . . . . . . . . . 18
⊢ (𝑘 = (𝑛 + 1) → (𝑘 + 𝐾) = ((𝑛 + 1) + 𝐾)) |
80 | 79 | fveq2d 6107 |
. . . . . . . . . . . . . . . . 17
⊢ (𝑘 = (𝑛 + 1) → (𝐺‘(𝑘 + 𝐾)) = (𝐺‘((𝑛 + 1) + 𝐾))) |
81 | 78, 80 | eqeq12d 2625 |
. . . . . . . . . . . . . . . 16
⊢ (𝑘 = (𝑛 + 1) → ((𝐹‘𝑘) = (𝐺‘(𝑘 + 𝐾)) ↔ (𝐹‘(𝑛 + 1)) = (𝐺‘((𝑛 + 1) + 𝐾)))) |
82 | 81 | rspcv 3278 |
. . . . . . . . . . . . . . 15
⊢ ((𝑛 + 1) ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) = (𝐺‘(𝑘 + 𝐾)) → (𝐹‘(𝑛 + 1)) = (𝐺‘((𝑛 + 1) + 𝐾)))) |
83 | 76, 77, 82 | sylc 63 |
. . . . . . . . . . . . . 14
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → (𝐹‘(𝑛 + 1)) = (𝐺‘((𝑛 + 1) + 𝐾))) |
84 | 74 | fveq2d 6107 |
. . . . . . . . . . . . . 14
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → (𝐺‘((𝑛 + 1) + 𝐾)) = (𝐺‘((𝑛 + 𝐾) + 1))) |
85 | 83, 84 | eqtrd 2644 |
. . . . . . . . . . . . 13
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → (𝐹‘(𝑛 + 1)) = (𝐺‘((𝑛 + 𝐾) + 1))) |
86 | 85 | oveq2d 6565 |
. . . . . . . . . . . 12
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → ((seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) + (𝐹‘(𝑛 + 1))) = ((seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) + (𝐺‘((𝑛 + 𝐾) + 1)))) |
87 | 65, 75, 86 | 3eqtr4d 2654 |
. . . . . . . . . . 11
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾)) = ((seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) + (𝐹‘(𝑛 + 1)))) |
88 | 60, 87 | eqeq12d 2625 |
. . . . . . . . . 10
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → ((seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾)) ↔ ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))) = ((seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) + (𝐹‘(𝑛 + 1))))) |
89 | 57, 88 | syl5ibr 235 |
. . . . . . . . 9
⊢ ((𝜑 ∧ (𝑛 ∈ (ℤ≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁))) → ((seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾)))) |
90 | 89 | expr 641 |
. . . . . . . 8
⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝑛 + 1) ∈ (𝑀...𝑁) → ((seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾))))) |
91 | 90 | a2d 29 |
. . . . . . 7
⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (((𝑛 + 1) ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾))) → ((𝑛 + 1) ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾))))) |
92 | 56, 91 | syld 46 |
. . . . . 6
⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝑛 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾))) → ((𝑛 + 1) ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾))))) |
93 | 92 | expcom 450 |
. . . . 5
⊢ (𝑛 ∈
(ℤ≥‘𝑀) → (𝜑 → ((𝑛 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾))) → ((𝑛 + 1) ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾)))))) |
94 | 93 | a2d 29 |
. . . 4
⊢ (𝑛 ∈
(ℤ≥‘𝑀) → ((𝜑 → (𝑛 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑛) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑛 + 𝐾)))) → (𝜑 → ((𝑛 + 1) ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = (seq(𝑀 + 𝐾)( + , 𝐺)‘((𝑛 + 1) + 𝐾)))))) |
95 | 10, 17, 24, 31, 52, 94 | uzind4 11622 |
. . 3
⊢ (𝑁 ∈
(ℤ≥‘𝑀) → (𝜑 → (𝑁 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑁) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑁 + 𝐾))))) |
96 | 1, 95 | mpcom 37 |
. 2
⊢ (𝜑 → (𝑁 ∈ (𝑀...𝑁) → (seq𝑀( + , 𝐹)‘𝑁) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑁 + 𝐾)))) |
97 | 3, 96 | mpd 15 |
1
⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) = (seq(𝑀 + 𝐾)( + , 𝐺)‘(𝑁 + 𝐾))) |