| 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 11324 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐹 ∈ 𝑉) → (𝐹 shift 𝐴) = {〈𝑧, 𝑤〉 ∣ (𝑧 ∈ ℂ ∧ (𝑧 − 𝐴)𝐹𝑤)}) | |
| 2 | 1 | ancoms 268 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) → (𝐹 shift 𝐴) = {〈𝑧, 𝑤〉 ∣ (𝑧 ∈ ℂ ∧ (𝑧 − 𝐴)𝐹𝑤)}) |
| 3 | cnex 8119 | . . . 4 ⊢ ℂ ∈ V | |
| 4 | 3 | a1i 9 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) → ℂ ∈ V) |
| 5 | rnexg 4988 | . . . . 5 ⊢ (𝐹 ∈ 𝑉 → ran 𝐹 ∈ V) | |
| 6 | 5 | ad2antrr 488 | . . . 4 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) ∧ 𝑧 ∈ ℂ) → ran 𝐹 ∈ V) |
| 7 | vex 2802 | . . . . . . . 8 ⊢ 𝑢 ∈ V | |
| 8 | breq2 4086 | . . . . . . . 8 ⊢ (𝑤 = 𝑢 → ((𝑧 − 𝐴)𝐹𝑤 ↔ (𝑧 − 𝐴)𝐹𝑢)) | |
| 9 | 7, 8 | elab 2947 | . . . . . . 7 ⊢ (𝑢 ∈ {𝑤 ∣ (𝑧 − 𝐴)𝐹𝑤} ↔ (𝑧 − 𝐴)𝐹𝑢) |
| 10 | simpr 110 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → 𝑧 ∈ ℂ) | |
| 11 | simpl 109 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 12 | 10, 11 | subcld 8453 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (𝑧 − 𝐴) ∈ ℂ) |
| 13 | brelrng 4954 | . . . . . . . . . 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 3230 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑧 ∈ ℂ) → {𝑤 ∣ (𝑧 − 𝐴)𝐹𝑤} ⊆ ran 𝐹) |
| 19 | 18 | adantll 476 | . . . 4 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) ∧ 𝑧 ∈ ℂ) → {𝑤 ∣ (𝑧 − 𝐴)𝐹𝑤} ⊆ ran 𝐹) |
| 20 | 6, 19 | ssexd 4223 | . . 3 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ) ∧ 𝑧 ∈ ℂ) → {𝑤 ∣ (𝑧 − 𝐴)𝐹𝑤} ∈ V) |
| 21 | 4, 20 | opabex3d 6264 | . 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 2799 ⊆ wss 3197 class class class wbr 4082 {copab 4143 ran crn 4719 (class class class)co 6000 ℂcc 7993 − cmin 8313 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-shft 11321 |
| This theorem is referenced by: 2shfti 11337 climshftlemg 11808 climshft 11810 climshft2 11812 eftlub 12196 |
| Copyright terms: Public domain | W3C validator |