![]() |
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 2193 | . . . . 5 ⊢ (ℤ≥‘𝑀) = (ℤ≥‘𝑀) | |
2 | seq3fveq2.1 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝑀)) | |
3 | eluzel2 9600 | . . . . . 6 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
4 | 2, 3 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
5 | seq3fveq2.f | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆) | |
6 | seq3fveq2.pl | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) | |
7 | 1, 4, 5, 6 | seqf 10538 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹):(ℤ≥‘𝑀)⟶𝑆) |
8 | 7 | ffnd 5405 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) Fn (ℤ≥‘𝑀)) |
9 | uzss 9616 | . . . 4 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑀)) | |
10 | 2, 9 | syl 14 | . . 3 ⊢ (𝜑 → (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑀)) |
11 | fnssres 5368 | . . 3 ⊢ ((seq𝑀( + , 𝐹) Fn (ℤ≥‘𝑀) ∧ (ℤ≥‘𝐾) ⊆ (ℤ≥‘𝑀)) → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) Fn (ℤ≥‘𝐾)) | |
12 | 8, 10, 11 | syl2anc 411 | . 2 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) Fn (ℤ≥‘𝐾)) |
13 | eqid 2193 | . . . 4 ⊢ (ℤ≥‘𝐾) = (ℤ≥‘𝐾) | |
14 | eluzelz 9604 | . . . . 5 ⊢ (𝐾 ∈ (ℤ≥‘𝑀) → 𝐾 ∈ ℤ) | |
15 | 2, 14 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ ℤ) |
16 | seq3fveq2.g | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝐾)) → (𝐺‘𝑥) ∈ 𝑆) | |
17 | 13, 15, 16, 6 | seqf 10538 | . . 3 ⊢ (𝜑 → seq𝐾( + , 𝐺):(ℤ≥‘𝐾)⟶𝑆) |
18 | 17 | ffnd 5405 | . 2 ⊢ (𝜑 → seq𝐾( + , 𝐺) Fn (ℤ≥‘𝐾)) |
19 | fvres 5579 | . . . 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 10090 | . . . . . 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 10549 | . . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → (seq𝑀( + , 𝐹)‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) |
33 | 20, 32 | eqtrd 2226 | . 2 ⊢ ((𝜑 ∧ 𝑧 ∈ (ℤ≥‘𝐾)) → ((seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾))‘𝑧) = (seq𝐾( + , 𝐺)‘𝑧)) |
34 | 12, 18, 33 | eqfnfvd 5659 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ↾ (ℤ≥‘𝐾)) = seq𝐾( + , 𝐺)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 ⊆ wss 3154 ↾ cres 4662 Fn wfn 5250 ‘cfv 5255 (class class class)co 5919 1c1 7875 + caddc 7877 ℤcz 9320 ℤ≥cuz 9595 ...cfz 10077 seqcseq 10521 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-addcom 7974 ax-addass 7976 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-0id 7982 ax-rnegex 7983 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-ltadd 7990 |
This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-iord 4398 df-on 4400 df-ilim 4401 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-recs 6360 df-frec 6446 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-inn 8985 df-n0 9244 df-z 9321 df-uz 9596 df-fz 10078 df-seqfrec 10522 |
This theorem is referenced by: seq3id 10599 |
Copyright terms: Public domain | W3C validator |