| 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 2232 | . . . . 5 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀) | |
| 2 | seq3fveq2.1 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝑀)) | |
| 3 | eluzel2 9858 | . . . . . 6 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 4 | 2, 3 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | seq3fveq2.f | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆) | |
| 6 | seq3fveq2.pl | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) | |
| 7 | 1, 4, 5, 6 | seqf 10826 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹):(ℤ≥‘𝑀)⟶𝑆) |
| 8 | 7 | ffnd 5509 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) Fn (ℤ≥‘𝑀)) |
| 9 | uzss 9875 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑀)) | |
| 10 | 2, 9 | syl 14 | . . 3 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑀)) |
| 11 | fnssres 5471 | . . 3 ⊢ ((seq𝑀( + , 𝐹) Fn (ℤ≥‘𝑀) ∧ (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) Fn (ℤ≥‘𝐾)) | |
| 12 | 8, 10, 11 | syl2anc 411 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) Fn (ℤ≥‘𝐾)) |
| 13 | eqid 2232 | . . . 4 ⊢ (ℤ≥‘𝐾) = (ℤ≥‘𝐾) | |
| 14 | eluzelz 9863 | . . . . 5 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝐾 ∈ ℤ) | |
| 15 | 2, 14 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
| 16 | seq3fveq2.g | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → (𝐺‘𝑥) ∈ 𝑆) | |
| 17 | 13, 15, 16, 6 | seqf 10826 | . . 3 ⊢ (𝜑 → seq𝐾( + , 𝐺):(ℤ≥‘𝐾)⟶𝑆) |
| 18 | 17 | ffnd 5509 | . 2 ⊢ (𝜑 → seq𝐾( + , 𝐺) Fn (ℤ≥‘𝐾)) |
| 19 | fvres 5694 | . . . 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 10355 | . . . . . 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 10837 | . . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) |
| 33 | 20, 32 | eqtrd 2265 | . 2 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾))‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) |
| 34 | 12, 18, 33 | eqfnfvd 5778 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) = seq𝐾( + , 𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 ⊆ wss 3211 ↾ cres 4751 Fn wfn 5347 ‘cfv 5352 (class class class)co 6050 1c1 8128 + caddc 8130 ℤcz 9577 ℤ≥cuz 9853 ...cfz 10342 seqcseq 10809 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-addass 8229 ax-distr 8231 ax-i2m1 8232 ax-0lt1 8233 ax-0id 8235 ax-rnegex 8236 ax-cnre 8238 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-ltadd 8243 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-id 4414 df-iord 4487 df-on 4489 df-ilim 4490 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-frec 6622 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-sub 8446 df-neg 8447 df-inn 9238 df-n0 9497 df-z 9578 df-uz 9854 df-fz 10343 df-seqfrec 10810 |
| This theorem is referenced by: seq3id 10887 |
| Copyright terms: Public domain | W3C validator |