| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > shftcan1 | Structured version Visualization version GIF version | ||
| Description: Cancellation law for the shift operation. (Contributed by NM, 4-Aug-2005.) (Revised by Mario Carneiro, 5-Nov-2013.) |
| Ref | Expression |
|---|---|
| shftfval.1 | ⊢ 𝐹 ∈ V |
| Ref | Expression |
|---|---|
| shftcan1 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐹 shift 𝐴) shift -𝐴)‘𝐵) = (𝐹‘𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | negcl 11387 | . . . . 5 ⊢ (𝐴 ∈ ℂ → -𝐴 ∈ ℂ) | |
| 2 | shftfval.1 | . . . . . 6 ⊢ 𝐹 ∈ V | |
| 3 | 2 | 2shfti 15036 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ -𝐴 ∈ ℂ) → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift (𝐴 + -𝐴))) |
| 4 | 1, 3 | mpdan 688 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift (𝐴 + -𝐴))) |
| 5 | negid 11435 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴 + -𝐴) = 0) | |
| 6 | 5 | oveq2d 7377 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐹 shift (𝐴 + -𝐴)) = (𝐹 shift 0)) |
| 7 | 4, 6 | eqtrd 2772 | . . 3 ⊢ (𝐴 ∈ ℂ → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift 0)) |
| 8 | 7 | fveq1d 6837 | . 2 ⊢ (𝐴 ∈ ℂ → (((𝐹 shift 𝐴) shift -𝐴)‘𝐵) = ((𝐹 shift 0)‘𝐵)) |
| 9 | 2 | shftidt 15038 | . 2 ⊢ (𝐵 ∈ ℂ → ((𝐹 shift 0)‘𝐵) = (𝐹‘𝐵)) |
| 10 | 8, 9 | sylan9eq 2792 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐹 shift 𝐴) shift -𝐴)‘𝐵) = (𝐹‘𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ‘cfv 6493 (class class class)co 7361 ℂcc 11030 0cc0 11032 + caddc 11035 -cneg 11372 shift cshi 15022 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11175 df-mnf 11176 df-ltxr 11178 df-sub 11373 df-neg 11374 df-shft 15023 |
| This theorem is referenced by: shftcan2 15040 climshft 15532 |
| Copyright terms: Public domain | W3C validator |