| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > shftcan1 | 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 8342 | . . . . 5 ⊢ (𝐴 ∈ ℂ → -𝐴 ∈ ℂ) | |
| 2 | shftfval.1 | . . . . . 6 ⊢ 𝐹 ∈ V | |
| 3 | 2 | 2shfti 11337 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ -𝐴 ∈ ℂ) → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift (𝐴 + -𝐴))) |
| 4 | 1, 3 | mpdan 421 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift (𝐴 + -𝐴))) |
| 5 | negid 8389 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴 + -𝐴) = 0) | |
| 6 | 5 | oveq2d 6016 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐹 shift (𝐴 + -𝐴)) = (𝐹 shift 0)) |
| 7 | 4, 6 | eqtrd 2262 | . . 3 ⊢ (𝐴 ∈ ℂ → ((𝐹 shift 𝐴) shift -𝐴) = (𝐹 shift 0)) |
| 8 | 7 | fveq1d 5628 | . 2 ⊢ (𝐴 ∈ ℂ → (((𝐹 shift 𝐴) shift -𝐴)‘𝐵) = ((𝐹 shift 0)‘𝐵)) |
| 9 | 2 | shftidt 11339 | . 2 ⊢ (𝐵 ∈ ℂ → ((𝐹 shift 0)‘𝐵) = (𝐹‘𝐵)) |
| 10 | 8, 9 | sylan9eq 2282 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐹 shift 𝐴) shift -𝐴)‘𝐵) = (𝐹‘𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 Vcvv 2799 ‘cfv 5317 (class class class)co 6000 ℂcc 7993 0cc0 7995 + caddc 7998 -cneg 8314 shift cshi 11320 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4198 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-cnex 8086 ax-resscn 8087 ax-1cn 8088 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-addcom 8095 ax-addass 8097 ax-distr 8099 ax-i2m1 8100 ax-0id 8103 ax-rnegex 8104 ax-cnre 8106 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-iun 3966 df-br 4083 df-opab 4145 df-mpt 4146 df-id 4383 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-f1 5322 df-fo 5323 df-f1o 5324 df-fv 5325 df-riota 5953 df-ov 6003 df-oprab 6004 df-mpo 6005 df-sub 8315 df-neg 8316 df-shft 11321 |
| This theorem is referenced by: shftcan2 11341 climshft 11810 |
| Copyright terms: Public domain | W3C validator |