| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ovshftex | GIF version | ||
| Description: Existence of the result of applying shift. (Contributed by Jim Kingdon, 15-Aug-2021.) |
| Ref | Expression |
|---|---|
| ovshftex | ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) → (𝐹 shift 𝐴) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | shftfvalg 11369 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐹 ∈ 𝑉) → (𝐹 shift 𝐴) = {〈𝑧, 𝑤〉 ∣ (𝑧 ∈ ℂ ∧ (𝑧 − 𝐴)𝐹𝑤)}) | |
| 2 | 1 | ancoms 268 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) → (𝐹 shift 𝐴) = {〈𝑧, 𝑤〉 ∣ (𝑧 ∈ ℂ ∧ (𝑧 − 𝐴)𝐹𝑤)}) |
| 3 | cnex 8146 | . . . 4 ⊢ ℂ ∈ V | |
| 4 | 3 | a1i 9 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) → ℂ ∈ V) |
| 5 | rnexg 4995 | . . . . 5 ⊢ (𝐹 ∈ 𝑉 → ran 𝐹 ∈ V) | |
| 6 | 5 | ad2antrr 488 | . . . 4 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) ∧ 𝑧 ∈ ℂ) → ran 𝐹 ∈ V) |
| 7 | vex 2803 | . . . . . . . 8 ⊢ 𝑢 ∈ V | |
| 8 | breq2 4090 | . . . . . . . 8 ⊢ (𝑤 = 𝑢 → ((𝑧 − 𝐴)𝐹𝑤 ↔ (𝑧 − 𝐴)𝐹𝑢)) | |
| 9 | 7, 8 | elab 2948 | . . . . . . 7 ⊢ (𝑢 ∈ {𝑤 ∣ (𝑧 − 𝐴)𝐹𝑤} ↔ (𝑧 − 𝐴)𝐹𝑢) |
| 10 | simpr 110 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → 𝑧 ∈ ℂ) | |
| 11 | simpl 109 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 12 | 10, 11 | subcld 8480 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (𝑧 − 𝐴) ∈ ℂ) |
| 13 | brelrng 4961 | . . . . . . . . . 10 ⊢ (((𝑧 − 𝐴) ∈ ℂ ∧ 𝑢 ∈ V ∧ (𝑧 − 𝐴)𝐹𝑢) → 𝑢 ∈ ran 𝐹) | |
| 14 | 7, 13 | mp3an2 1359 | . . . . . . . . 9 ⊢ (((𝑧 − 𝐴) ∈ ℂ ∧ (𝑧 − 𝐴)𝐹𝑢) → 𝑢 ∈ ran 𝐹) |
| 15 | 12, 14 | sylan 283 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) ∧ (𝑧 − 𝐴)𝐹𝑢) → 𝑢 ∈ ran 𝐹) |
| 16 | 15 | ex 115 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → ((𝑧 − 𝐴)𝐹𝑢 → 𝑢 ∈ ran 𝐹)) |
| 17 | 9, 16 | biimtrid 152 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (𝑢 ∈ {𝑤 ∣ (𝑧 − 𝐴)𝐹𝑤} → 𝑢 ∈ ran 𝐹)) |
| 18 | 17 | ssrdv 3231 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → {𝑤 ∣ (𝑧 − 𝐴)𝐹𝑤} ⊆ ran 𝐹) |
| 19 | 18 | adantll 476 | . . . 4 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) ∧ 𝑧 ∈ ℂ) → {𝑤 ∣ (𝑧 − 𝐴)𝐹𝑤} ⊆ ran 𝐹) |
| 20 | 6, 19 | ssexd 4227 | . . 3 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) ∧ 𝑧 ∈ ℂ) → {𝑤 ∣ (𝑧 − 𝐴)𝐹𝑤} ∈ V) |
| 21 | 4, 20 | opabex3d 6278 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) → {〈𝑧, 𝑤〉 ∣ (𝑧 ∈ ℂ ∧ (𝑧 − 𝐴)𝐹𝑤)} ∈ V) |
| 22 | 2, 21 | eqeltrd 2306 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) → (𝐹 shift 𝐴) ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 {cab 2215 Vcvv 2800 ⊆ wss 3198 class class class wbr 4086 {copab 4147 ran crn 4724 (class class class)co 6013 ℂcc 8020 − cmin 8340 shift cshi 11365 |
| 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 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 |
| 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 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-sub 8342 df-shft 11366 |
| This theorem is referenced by: 2shfti 11382 climshftlemg 11853 climshft 11855 climshft2 11857 eftlub 12241 |
| Copyright terms: Public domain | W3C validator |