| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > shftval | GIF version | ||
| Description: Value of a sequence shifted by 𝐴. (Contributed by NM, 20-Jul-2005.) (Revised by Mario Carneiro, 4-Nov-2013.) |
| Ref | Expression |
|---|---|
| shftfval.1 | ⊢ 𝐹 ∈ V |
| Ref | Expression |
|---|---|
| shftval | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift 𝐴)‘𝐵) = (𝐹‘(𝐵 − 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | shftfval.1 | . . . . 5 ⊢ 𝐹 ∈ V | |
| 2 | 1 | shftfib 11406 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift 𝐴) “ {𝐵}) = (𝐹 “ {(𝐵 − 𝐴)})) |
| 3 | 2 | eleq2d 2300 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝑥 ∈ ((𝐹 shift 𝐴) “ {𝐵}) ↔ 𝑥 ∈ (𝐹 “ {(𝐵 − 𝐴)}))) |
| 4 | 3 | iotabidv 5311 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (℩𝑥𝑥 ∈ ((𝐹 shift 𝐴) “ {𝐵})) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐵 − 𝐴)}))) |
| 5 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 6 | dffv3g 5638 | . . 3 ⊢ (𝐵 ∈ ℂ → ((𝐹 shift 𝐴)‘𝐵) = (℩𝑥𝑥 ∈ ((𝐹 shift 𝐴) “ {𝐵}))) | |
| 7 | 5, 6 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift 𝐴)‘𝐵) = (℩𝑥𝑥 ∈ ((𝐹 shift 𝐴) “ {𝐵}))) |
| 8 | simpl 109 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 9 | 5, 8 | subcld 8495 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 − 𝐴) ∈ ℂ) |
| 10 | dffv3g 5638 | . . 3 ⊢ ((𝐵 − 𝐴) ∈ ℂ → (𝐹‘(𝐵 − 𝐴)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐵 − 𝐴)}))) | |
| 11 | 9, 10 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹‘(𝐵 − 𝐴)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐵 − 𝐴)}))) |
| 12 | 4, 7, 11 | 3eqtr4d 2273 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift 𝐴)‘𝐵) = (𝐹‘(𝐵 − 𝐴))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2201 Vcvv 2801 {csn 3670 “ cima 4730 ℩cio 5286 ‘cfv 5328 (class class class)co 6023 ℂcc 8035 − cmin 8355 shift cshi 11397 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-resscn 8129 ax-1cn 8130 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-addcom 8137 ax-addass 8139 ax-distr 8141 ax-i2m1 8142 ax-0id 8145 ax-rnegex 8146 ax-cnre 8148 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-ral 2514 df-rex 2515 df-reu 2516 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-sub 8357 df-shft 11398 |
| This theorem is referenced by: shftval2 11409 shftval4 11411 shftval5 11412 shftf 11413 shftvalg 11419 isumshft 12074 |
| Copyright terms: Public domain | W3C validator |