![]() |
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 11401 | . . . . 5 ⊢ (𝐴 ∈ ℂ → -𝐴 ∈ ℂ) | |
2 | shftfval.1 | . . . . . 6 ⊢ 𝐹 ∈ V | |
3 | 2 | 2shfti 14965 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ -𝐴 ∈ ℂ) → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift (𝐴 + -𝐴))) |
4 | 1, 3 | mpdan 685 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift (𝐴 + -𝐴))) |
5 | negid 11448 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴 + -𝐴) = 0) | |
6 | 5 | oveq2d 7373 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐹 shift (𝐴 + -𝐴)) = (𝐹 shift 0)) |
7 | 4, 6 | eqtrd 2776 | . . 3 ⊢ (𝐴 ∈ ℂ → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift 0)) |
8 | 7 | fveq1d 6844 | . 2 ⊢ (𝐴 ∈ ℂ → (((𝐹 shift 𝐴) shift -𝐴)‘𝐵) = ((𝐹 shift 0)‘𝐵)) |
9 | 2 | shftidt 14967 | . 2 ⊢ (𝐵 ∈ ℂ → ((𝐹 shift 0)‘𝐵) = (𝐹‘𝐵)) |
10 | 8, 9 | sylan9eq 2796 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐹 shift 𝐴) shift -𝐴)‘𝐵) = (𝐹‘𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 Vcvv 3445 ‘cfv 6496 (class class class)co 7357 ℂcc 11049 0cc0 11051 + caddc 11054 -cneg 11386 shift cshi 14951 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-po 5545 df-so 5546 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-er 8648 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11191 df-mnf 11192 df-ltxr 11194 df-sub 11387 df-neg 11388 df-shft 14952 |
This theorem is referenced by: shftcan2 14969 climshft 15458 |
Copyright terms: Public domain | W3C validator |