| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > climshft2 | GIF version | ||
| Description: A shifted function converges iff the original function converges. (Contributed by Paul Chapman, 21-Nov-2007.) (Revised by Mario Carneiro, 6-Feb-2014.) |
| Ref | Expression |
|---|---|
| climshft2.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| climshft2.2 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| climshft2.3 | ⊢ (𝜑 → 𝐾 ∈ ℤ) |
| climshft2.5 | ⊢ (𝜑 → 𝐹 ∈ 𝑊) |
| climshft2.6 | ⊢ (𝜑 → 𝐺 ∈ 𝑋) |
| climshft2.7 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘(𝑘 + 𝐾)) = (𝐹‘𝑘)) |
| Ref | Expression |
|---|---|
| climshft2 | ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ 𝐺 ⇝ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | climshft2.1 | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 2 | climshft2.6 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝑋) | |
| 3 | climshft2.3 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℤ) | |
| 4 | 3 | zcnd 9647 | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℂ) |
| 5 | 4 | negcld 8519 | . . . 4 ⊢ (𝜑 → -𝐾 ∈ ℂ) |
| 6 | ovshftex 11442 | . . . 4 ⊢ ((𝐺 ∈ 𝑋 ∧ -𝐾 ∈ ℂ) → (𝐺 shift -𝐾) ∈ V) | |
| 7 | 2, 5, 6 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝐺 shift -𝐾) ∈ V) |
| 8 | climshft2.5 | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑊) | |
| 9 | climshft2.2 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 10 | funi 5365 | . . . . . . . 8 ⊢ Fun I | |
| 11 | elex 2815 | . . . . . . . . . 10 ⊢ (𝐺 ∈ 𝑋 → 𝐺 ∈ V) | |
| 12 | 2, 11 | syl 14 | . . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ V) |
| 13 | dmi 4952 | . . . . . . . . 9 ⊢ dom I = V | |
| 14 | 12, 13 | eleqtrrdi 2325 | . . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ dom I ) |
| 15 | funfvex 5665 | . . . . . . . 8 ⊢ ((Fun I ∧ 𝐺 ∈ dom I ) → ( I ‘𝐺) ∈ V) | |
| 16 | 10, 14, 15 | sylancr 414 | . . . . . . 7 ⊢ (𝜑 → ( I ‘𝐺) ∈ V) |
| 17 | 16 | adantr 276 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ( I ‘𝐺) ∈ V) |
| 18 | 4 | adantr 276 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐾 ∈ ℂ) |
| 19 | eluzelz 9809 | . . . . . . . . 9 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → 𝑘 ∈ ℤ) | |
| 20 | 19, 1 | eleq2s 2326 | . . . . . . . 8 ⊢ (𝑘 ∈ 𝑍 → 𝑘 ∈ ℤ) |
| 21 | 20 | zcnd 9647 | . . . . . . 7 ⊢ (𝑘 ∈ 𝑍 → 𝑘 ∈ ℂ) |
| 22 | 21 | adantl 277 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ ℂ) |
| 23 | shftval4g 11460 | . . . . . 6 ⊢ ((( I ‘𝐺) ∈ V ∧ 𝐾 ∈ ℂ ∧ 𝑘 ∈ ℂ) → ((( I ‘𝐺) shift -𝐾)‘𝑘) = (( I ‘𝐺)‘(𝐾 + 𝑘))) | |
| 24 | 17, 18, 22, 23 | syl3anc 1274 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((( I ‘𝐺) shift -𝐾)‘𝑘) = (( I ‘𝐺)‘(𝐾 + 𝑘))) |
| 25 | fvi 5712 | . . . . . . . . 9 ⊢ (𝐺 ∈ 𝑋 → ( I ‘𝐺) = 𝐺) | |
| 26 | 2, 25 | syl 14 | . . . . . . . 8 ⊢ (𝜑 → ( I ‘𝐺) = 𝐺) |
| 27 | 26 | adantr 276 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ( I ‘𝐺) = 𝐺) |
| 28 | 27 | oveq1d 6043 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (( I ‘𝐺) shift -𝐾) = (𝐺 shift -𝐾)) |
| 29 | 28 | fveq1d 5650 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((( I ‘𝐺) shift -𝐾)‘𝑘) = ((𝐺 shift -𝐾)‘𝑘)) |
| 30 | addcom 8358 | . . . . . . 7 ⊢ ((𝐾 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐾 + 𝑘) = (𝑘 + 𝐾)) | |
| 31 | 4, 21, 30 | syl2an 289 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐾 + 𝑘) = (𝑘 + 𝐾)) |
| 32 | 27, 31 | fveq12d 5655 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (( I ‘𝐺)‘(𝐾 + 𝑘)) = (𝐺‘(𝑘 + 𝐾))) |
| 33 | 24, 29, 32 | 3eqtr3d 2272 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝐺 shift -𝐾)‘𝑘) = (𝐺‘(𝑘 + 𝐾))) |
| 34 | climshft2.7 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘(𝑘 + 𝐾)) = (𝐹‘𝑘)) | |
| 35 | 33, 34 | eqtrd 2264 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝐺 shift -𝐾)‘𝑘) = (𝐹‘𝑘)) |
| 36 | 1, 7, 8, 9, 35 | climeq 11922 | . 2 ⊢ (𝜑 → ((𝐺 shift -𝐾) ⇝ 𝐴 ↔ 𝐹 ⇝ 𝐴)) |
| 37 | 3 | znegcld 9648 | . . 3 ⊢ (𝜑 → -𝐾 ∈ ℤ) |
| 38 | climshft 11927 | . . 3 ⊢ ((-𝐾 ∈ ℤ ∧ 𝐺 ∈ 𝑋) → ((𝐺 shift -𝐾) ⇝ 𝐴 ↔ 𝐺 ⇝ 𝐴)) | |
| 39 | 37, 2, 38 | syl2anc 411 | . 2 ⊢ (𝜑 → ((𝐺 shift -𝐾) ⇝ 𝐴 ↔ 𝐺 ⇝ 𝐴)) |
| 40 | 36, 39 | bitr3d 190 | 1 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ 𝐺 ⇝ 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2202 Vcvv 2803 class class class wbr 4093 I cid 4391 dom cdm 4731 Fun wfun 5327 ‘cfv 5333 (class class class)co 6028 ℂcc 8073 + caddc 8078 -cneg 8393 ℤcz 9523 ℤ≥cuz 9799 shift cshi 11437 ⇝ cli 11901 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-inn 9186 df-n0 9445 df-z 9524 df-uz 9800 df-shft 11438 df-clim 11902 |
| This theorem is referenced by: trireciplem 12124 |
| Copyright terms: Public domain | W3C validator |