![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > shftval3 | Structured version Visualization version GIF version |
Description: Value of a sequence shifted by 𝐴 − 𝐵. (Contributed by NM, 20-Jul-2005.) |
Ref | Expression |
---|---|
shftfval.1 | ⊢ 𝐹 ∈ V |
Ref | Expression |
---|---|
shftval3 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift (𝐴 − 𝐵))‘𝐴) = (𝐹‘𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0cn 11155 | . . 3 ⊢ 0 ∈ ℂ | |
2 | shftfval.1 | . . . 4 ⊢ 𝐹 ∈ V | |
3 | 2 | shftval2 14969 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 0 ∈ ℂ) → ((𝐹 shift (𝐴 − 𝐵))‘(𝐴 + 0)) = (𝐹‘(𝐵 + 0))) |
4 | 1, 3 | mp3an3 1451 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift (𝐴 − 𝐵))‘(𝐴 + 0)) = (𝐹‘(𝐵 + 0))) |
5 | addrid 11343 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐴 + 0) = 𝐴) | |
6 | 5 | adantr 482 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 0) = 𝐴) |
7 | 6 | fveq2d 6850 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift (𝐴 − 𝐵))‘(𝐴 + 0)) = ((𝐹 shift (𝐴 − 𝐵))‘𝐴)) |
8 | addrid 11343 | . . . 4 ⊢ (𝐵 ∈ ℂ → (𝐵 + 0) = 𝐵) | |
9 | 8 | adantl 483 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 + 0) = 𝐵) |
10 | 9 | fveq2d 6850 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹‘(𝐵 + 0)) = (𝐹‘𝐵)) |
11 | 4, 7, 10 | 3eqtr3d 2781 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift (𝐴 − 𝐵))‘𝐴) = (𝐹‘𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 Vcvv 3447 ‘cfv 6500 (class class class)co 7361 ℂcc 11057 0cc0 11059 + caddc 11062 − cmin 11393 shift cshi 14960 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5246 ax-sep 5260 ax-nul 5267 ax-pow 5324 ax-pr 5388 ax-un 7676 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3353 df-rab 3407 df-v 3449 df-sbc 3744 df-csb 3860 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4287 df-if 4491 df-pw 4566 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4870 df-br 5110 df-opab 5172 df-mpt 5193 df-id 5535 df-po 5549 df-so 5550 df-xp 5643 df-rel 5644 df-cnv 5645 df-co 5646 df-dm 5647 df-rn 5648 df-res 5649 df-ima 5650 df-iota 6452 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7317 df-ov 7364 df-oprab 7365 df-mpo 7366 df-er 8654 df-en 8890 df-dom 8891 df-sdom 8892 df-pnf 11199 df-mnf 11200 df-ltxr 11202 df-sub 11395 df-shft 14961 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |