| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > seq3feq2 | GIF version | ||
| Description: Equality of sequences. (Contributed by Jim Kingdon, 3-Jun-2020.) |
| Ref | Expression |
|---|---|
| seq3fveq2.1 | ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝑀)) |
| seq3fveq2.2 | ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝐾) = (𝐺‘𝐾)) |
| seq3fveq2.f | ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆) |
| seq3fveq2.g | ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → (𝐺‘𝑥) ∈ 𝑆) |
| seq3fveq2.pl | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) |
| seq3feq2.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘(𝐾 + 1))) → (𝐹‘𝑘) = (𝐺‘𝑘)) |
| Ref | Expression |
|---|---|
| seq3feq2 | ⊢ (𝜑 → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) = seq𝐾( + , 𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2229 | . . . . 5 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀) | |
| 2 | seq3fveq2.1 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝑀)) | |
| 3 | eluzel2 9750 | . . . . . 6 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 4 | 2, 3 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | seq3fveq2.f | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆) | |
| 6 | seq3fveq2.pl | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) | |
| 7 | 1, 4, 5, 6 | seqf 10716 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹):(ℤ≥‘𝑀)⟶𝑆) |
| 8 | 7 | ffnd 5480 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) Fn (ℤ≥‘𝑀)) |
| 9 | uzss 9767 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑀)) | |
| 10 | 2, 9 | syl 14 | . . 3 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑀)) |
| 11 | fnssres 5442 | . . 3 ⊢ ((seq𝑀( + , 𝐹) Fn (ℤ≥‘𝑀) ∧ (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) Fn (ℤ≥‘𝐾)) | |
| 12 | 8, 10, 11 | syl2anc 411 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) Fn (ℤ≥‘𝐾)) |
| 13 | eqid 2229 | . . . 4 ⊢ (ℤ≥‘𝐾) = (ℤ≥‘𝐾) | |
| 14 | eluzelz 9755 | . . . . 5 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝐾 ∈ ℤ) | |
| 15 | 2, 14 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
| 16 | seq3fveq2.g | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → (𝐺‘𝑥) ∈ 𝑆) | |
| 17 | 13, 15, 16, 6 | seqf 10716 | . . 3 ⊢ (𝜑 → seq𝐾( + , 𝐺):(ℤ≥‘𝐾)⟶𝑆) |
| 18 | 17 | ffnd 5480 | . 2 ⊢ (𝜑 → seq𝐾( + , 𝐺) Fn (ℤ≥‘𝐾)) |
| 19 | fvres 5659 | . . . 4 ⊢ (𝑧 ∈ (ℤ≥‘𝐾) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾))‘𝑧) = (seq𝑀( + , 𝐹)‘𝑧)) | |
| 20 | 19 | adantl 277 | . . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾))‘𝑧) = (seq𝑀( + , 𝐹)‘𝑧)) |
| 21 | 2 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → 𝐾 ∈ (ℤ≥‘𝑀)) |
| 22 | seq3fveq2.2 | . . . . 5 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝐾) = (𝐺‘𝐾)) | |
| 23 | 22 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → (seq𝑀( + , 𝐹)‘𝐾) = (𝐺‘𝐾)) |
| 24 | 5 | adantlr 477 | . . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆) |
| 25 | 16 | adantlr 477 | . . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → (𝐺‘𝑥) ∈ 𝑆) |
| 26 | 6 | adantlr 477 | . . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) |
| 27 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → 𝑧 ∈ (ℤ≥‘𝐾)) | |
| 28 | elfzuz 10246 | . . . . . 6 ⊢ (𝑘 ∈ ((𝐾 + 1)...𝑧) → 𝑘 ∈ (ℤ≥‘(𝐾 + 1))) | |
| 29 | seq3feq2.4 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘(𝐾 + 1))) → (𝐹‘𝑘) = (𝐺‘𝑘)) | |
| 30 | 28, 29 | sylan2 286 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝐾 + 1)...𝑧)) → (𝐹‘𝑘) = (𝐺‘𝑘)) |
| 31 | 30 | adantlr 477 | . . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) ∧ 𝑘 ∈ ((𝐾 + 1)...𝑧)) → (𝐹‘𝑘) = (𝐺‘𝑘)) |
| 32 | 21, 23, 24, 25, 26, 27, 31 | seq3fveq2 10727 | . . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) |
| 33 | 20, 32 | eqtrd 2262 | . 2 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾))‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) |
| 34 | 12, 18, 33 | eqfnfvd 5743 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) = seq𝐾( + , 𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ⊆ wss 3198 ↾ cres 4725 Fn wfn 5319 ‘cfv 5324 (class class class)co 6013 1c1 8023 + caddc 8025 ℤcz 9469 ℤ≥cuz 9745 ...cfz 10233 seqcseq 10699 |
| 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 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-ltadd 8138 |
| 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 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-inn 9134 df-n0 9393 df-z 9470 df-uz 9746 df-fz 10234 df-seqfrec 10700 |
| This theorem is referenced by: seq3id 10777 |
| Copyright terms: Public domain | W3C validator |