| 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 11564 | . . . . 5 ⊢ (𝐴 ∈ ℂ → -𝐴 ∈ ℂ) | |
| 2 | shftfval.1 | . . . . . 6 ⊢ 𝐹 ∈ V | |
| 3 | 2 | 2shfti 15242 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ -𝐴 ∈ ℂ) → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift (𝐴 + -𝐴))) |
| 4 | 1, 3 | mpdan 700 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift (𝐴 + -𝐴))) |
| 5 | negid 11612 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴 + -𝐴) = 0) | |
| 6 | 5 | oveq2d 7440 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐹 shift (𝐴 + -𝐴)) = (𝐹 shift 0)) |
| 7 | 4, 6 | eqtrd 2795 | . . 3 ⊢ (𝐴 ∈ ℂ → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift 0)) |
| 8 | 7 | fveq1d 6892 | . 2 ⊢ (𝐴 ∈ ℂ → (((𝐹 shift 𝐴) shift -𝐴)‘𝐵) = ((𝐹 shift 0)‘𝐵)) |
| 9 | 2 | shftidt 15244 | . 2 ⊢ (𝐵 ∈ ℂ → ((𝐹 shift 0)‘𝐵) = (𝐹‘𝐵)) |
| 10 | 8, 9 | sylan9eq 2815 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐹 shift 𝐴) shift -𝐴)‘𝐵) = (𝐹‘𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ‘cfv 6543 (class class class)co 7424 ℂcc 11205 0cc0 11207 + caddc 11210 -cneg 11549 shift cshi 15228 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-pnf 11352 df-mnf 11353 df-ltxr 11355 df-sub 11550 df-neg 11551 df-shft 15229 |
| This theorem is used by: shftcan2 15246 climshft 15752 |
| Copyright terms: Public domain | W3C validator |