| 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 11501 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift 𝐴) “ {𝐵}) = (𝐹 “ {(𝐵 − 𝐴)})) |
| 3 | 2 | eleq2d 2302 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝑥 ∈ ((𝐹 shift 𝐴) “ {𝐵}) ↔ 𝑥 ∈ (𝐹 “ {(𝐵 − 𝐴)}))) |
| 4 | 3 | iotabidv 5334 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (℩𝑥𝑥 ∈ ((𝐹 shift 𝐴) “ {𝐵})) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐵 − 𝐴)}))) |
| 5 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 6 | dffv3g 5665 | . . 3 ⊢ (𝐵 ∈ ℂ → ((𝐹 shift 𝐴)‘𝐵) = (℩𝑥𝑥 ∈ ((𝐹 shift 𝐴) “ {𝐵}))) | |
| 7 | 5, 6 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift 𝐴)‘𝐵) = (℩𝑥𝑥 ∈ ((𝐹 shift 𝐴) “ {𝐵}))) |
| 8 | simpl 109 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 9 | 5, 8 | subcld 8580 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 − 𝐴) ∈ ℂ) |
| 10 | dffv3g 5665 | . . 3 ⊢ ((𝐵 − 𝐴) ∈ ℂ → (𝐹‘(𝐵 − 𝐴)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐵 − 𝐴)}))) | |
| 11 | 9, 10 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐹‘(𝐵 − 𝐴)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐵 − 𝐴)}))) |
| 12 | 4, 7, 11 | 3eqtr4d 2275 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐹 shift 𝐴)‘𝐵) = (𝐹‘(𝐵 − 𝐴))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 Vcvv 2812 {csn 3688 “ cima 4751 ℩cio 5309 ‘cfv 5351 (class class class)co 6049 ℂcc 8121 − cmin 8440 shift cshi 11492 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-resscn 8215 ax-1cn 8216 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-addcom 8223 ax-addass 8225 ax-distr 8227 ax-i2m1 8228 ax-0id 8231 ax-rnegex 8232 ax-cnre 8234 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-sub 8442 df-shft 11493 |
| This theorem is referenced by: shftval2 11504 shftval4 11506 shftval5 11507 shftf 11508 shftvalg 11514 isumshft 12169 |
| Copyright terms: Public domain | W3C validator |