| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > shftdm | GIF version | ||
| Description: Domain of a relation shifted by 𝐴. The set on the right is more commonly notated as (dom 𝐹 + 𝐴) (meaning add 𝐴 to every element of dom 𝐹). (Contributed by Mario Carneiro, 3-Nov-2013.) |
| Ref | Expression |
|---|---|
| shftfval.1 | ⊢ 𝐹 ∈ V |
| Ref | Expression |
|---|---|
| shftdm | ⊢ (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | shftfval.1 | . . . 4 ⊢ 𝐹 ∈ V | |
| 2 | 1 | shftfval 11347 | . . 3 ⊢ (𝐴 ∈ ℂ → (𝐹 shift 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)}) |
| 3 | 2 | dmeqd 4925 | . 2 ⊢ (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)}) |
| 4 | 19.42v 1953 | . . . . 5 ⊢ (∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦) ↔ (𝑥 ∈ ℂ ∧ ∃𝑦(𝑥 − 𝐴)𝐹𝑦)) | |
| 5 | simpr 110 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → 𝑥 ∈ ℂ) | |
| 6 | simpl 109 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 7 | 5, 6 | subcld 8468 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑥 − 𝐴) ∈ ℂ) |
| 8 | eldmg 4918 | . . . . . . 7 ⊢ ((𝑥 − 𝐴) ∈ ℂ → ((𝑥 − 𝐴) ∈ dom 𝐹 ↔ ∃𝑦(𝑥 − 𝐴)𝐹𝑦)) | |
| 9 | 7, 8 | syl 14 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → ((𝑥 − 𝐴) ∈ dom 𝐹 ↔ ∃𝑦(𝑥 − 𝐴)𝐹𝑦)) |
| 10 | 9 | pm5.32da 452 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹) ↔ (𝑥 ∈ ℂ ∧ ∃𝑦(𝑥 − 𝐴)𝐹𝑦))) |
| 11 | 4, 10 | bitr4id 199 | . . . 4 ⊢ (𝐴 ∈ ℂ → (∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦) ↔ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹))) |
| 12 | 11 | abbidv 2347 | . . 3 ⊢ (𝐴 ∈ ℂ → {𝑥 ∣ ∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹)}) |
| 13 | dmopab 4934 | . . 3 ⊢ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} | |
| 14 | df-rab 2517 | . . 3 ⊢ {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹} = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹)} | |
| 15 | 12, 13, 14 | 3eqtr4g 2287 | . 2 ⊢ (𝐴 ∈ ℂ → dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} = {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹}) |
| 16 | 3, 15 | eqtrd 2262 | 1 ⊢ (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∃wex 1538 ∈ wcel 2200 {cab 2215 {crab 2512 Vcvv 2799 class class class wbr 4083 {copab 4144 dom cdm 4719 (class class class)co 6007 ℂcc 8008 − cmin 8328 shift cshi 11340 |
| 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 4199 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-resscn 8102 ax-1cn 8103 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-addass 8112 ax-distr 8114 ax-i2m1 8115 ax-0id 8118 ax-rnegex 8119 ax-cnre 8121 |
| 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 3889 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-sub 8330 df-shft 11341 |
| This theorem is referenced by: shftfn 11350 |
| Copyright terms: Public domain | W3C validator |