![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > iser3shft | GIF version |
Description: Index shift of the limit of an infinite series. (Contributed by Mario Carneiro, 6-Sep-2013.) (Revised by Jim Kingdon, 17-Oct-2022.) |
Ref | Expression |
---|---|
iser3shft.ex | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
iser3shft.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
iser3shft.n | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
iser3shft.fm | ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆) |
iser3shft.pl | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) |
Ref | Expression |
---|---|
iser3shft | ⊢ (𝜑 → (seq𝑀( + , 𝐹) ⇝ 𝐴 ↔ seq(𝑀 + 𝑁)( + , (𝐹 shift 𝑁)) ⇝ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iser3shft.ex | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
2 | iser3shft.m | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
3 | iser3shft.n | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
4 | 2, 3 | zaddcld 9446 | . . . . 5 ⊢ (𝜑 → (𝑀 + 𝑁) ∈ ℤ) |
5 | 2 | zcnd 9443 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℂ) |
6 | 3 | zcnd 9443 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
7 | 5, 6 | pncand 8333 | . . . . . . . . 9 ⊢ (𝜑 → ((𝑀 + 𝑁) − 𝑁) = 𝑀) |
8 | 7 | fveq2d 5559 | . . . . . . . 8 ⊢ (𝜑 → (ℤ≥‘((𝑀 + 𝑁) − 𝑁)) = (ℤ≥‘𝑀)) |
9 | 8 | eleq2d 2263 | . . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (ℤ≥‘((𝑀 + 𝑁) − 𝑁)) ↔ 𝑥 ∈ (ℤ≥‘𝑀))) |
10 | 9 | pm5.32i 454 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘((𝑀 + 𝑁) − 𝑁))) ↔ (𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀))) |
11 | iser3shft.fm | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑥) ∈ 𝑆) | |
12 | 10, 11 | sylbi 121 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ≥‘((𝑀 + 𝑁) − 𝑁))) → (𝐹‘𝑥) ∈ 𝑆) |
13 | iser3shft.pl | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) | |
14 | 1, 4, 3, 12, 13 | seq3shft 10985 | . . . 4 ⊢ (𝜑 → seq(𝑀 + 𝑁)( + , (𝐹 shift 𝑁)) = (seq((𝑀 + 𝑁) − 𝑁)( + , 𝐹) shift 𝑁)) |
15 | 7 | seqeq1d 10527 | . . . . 5 ⊢ (𝜑 → seq((𝑀 + 𝑁) − 𝑁)( + , 𝐹) = seq𝑀( + , 𝐹)) |
16 | 15 | oveq1d 5934 | . . . 4 ⊢ (𝜑 → (seq((𝑀 + 𝑁) − 𝑁)( + , 𝐹) shift 𝑁) = (seq𝑀( + , 𝐹) shift 𝑁)) |
17 | 14, 16 | eqtrd 2226 | . . 3 ⊢ (𝜑 → seq(𝑀 + 𝑁)( + , (𝐹 shift 𝑁)) = (seq𝑀( + , 𝐹) shift 𝑁)) |
18 | 17 | breq1d 4040 | . 2 ⊢ (𝜑 → (seq(𝑀 + 𝑁)( + , (𝐹 shift 𝑁)) ⇝ 𝐴 ↔ (seq𝑀( + , 𝐹) shift 𝑁) ⇝ 𝐴)) |
19 | seqex 10523 | . . 3 ⊢ seq𝑀( + , 𝐹) ∈ V | |
20 | climshft 11450 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ seq𝑀( + , 𝐹) ∈ V) → ((seq𝑀( + , 𝐹) shift 𝑁) ⇝ 𝐴 ↔ seq𝑀( + , 𝐹) ⇝ 𝐴)) | |
21 | 3, 19, 20 | sylancl 413 | . 2 ⊢ (𝜑 → ((seq𝑀( + , 𝐹) shift 𝑁) ⇝ 𝐴 ↔ seq𝑀( + , 𝐹) ⇝ 𝐴)) |
22 | 18, 21 | bitr2d 189 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ⇝ 𝐴 ↔ seq(𝑀 + 𝑁)( + , (𝐹 shift 𝑁)) ⇝ 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2164 Vcvv 2760 class class class wbr 4030 ‘cfv 5255 (class class class)co 5919 + caddc 7877 − cmin 8192 ℤcz 9320 ℤ≥cuz 9595 seqcseq 10521 shift cshi 10961 ⇝ cli 11424 |
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-apti 7989 ax-pre-ltadd 7990 |
This theorem depends on definitions: df-bi 117 df-dc 836 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-if 3559 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 df-shft 10962 df-clim 11425 |
This theorem is referenced by: isumshft 11636 |
Copyright terms: Public domain | W3C validator |