| 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 11564 | . . 3 ⊢ (𝐴 ∈ ℂ → (𝐹 shift 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)}) |
| 3 | 2 | dmeqd 4978 | . 2 ⊢ (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)}) |
| 4 | 19.42v 1962 | . . . . 5 ⊢ (∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦) ↔ (𝑥 ∈ ℂ ∧ ∃𝑦(𝑥 − 𝐴)𝐹𝑦)) | |
| 5 | simpr 110 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → 𝑥 ∈ ℂ) | |
| 6 | simpl 109 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 7 | 5, 6 | subcld 8627 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑥 − 𝐴) ∈ ℂ) |
| 8 | eldmg 4971 | . . . . . . 7 ⊢ ((𝑥 − 𝐴) ∈ ℂ → ((𝑥 − 𝐴) ∈ dom 𝐹 ↔ ∃𝑦(𝑥 − 𝐴)𝐹𝑦)) | |
| 9 | 7, 8 | syl 14 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → ((𝑥 − 𝐴) ∈ dom 𝐹 ↔ ∃𝑦(𝑥 − 𝐴)𝐹𝑦)) |
| 10 | 9 | pm5.32da 456 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹) ↔ (𝑥 ∈ ℂ ∧ ∃𝑦(𝑥 − 𝐴)𝐹𝑦))) |
| 11 | 4, 10 | bitr4id 199 | . . . 4 ⊢ (𝐴 ∈ ℂ → (∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦) ↔ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹))) |
| 12 | 11 | abbidv 2358 | . . 3 ⊢ (𝐴 ∈ ℂ → {𝑥 ∣ ∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹)}) |
| 13 | dmopab 4987 | . . 3 ⊢ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} | |
| 14 | df-rab 2537 | . . 3 ⊢ {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹} = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹)} | |
| 15 | 12, 13, 14 | 3eqtr4g 2296 | . 2 ⊢ (𝐴 ∈ ℂ → dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} = {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹}) |
| 16 | 3, 15 | eqtrd 2271 | 1 ⊢ (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∃wex 1545 ∈ wcel 2209 {cab 2224 {crab 2532 Vcvv 2821 class class class wbr 4125 {copab 4186 dom cdm 4769 (class class class)co 6075 ℂcc 8167 − cmin 8487 shift cshi 11557 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-resscn 8261 ax-1cn 8262 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-addass 8271 ax-distr 8273 ax-i2m1 8274 ax-0id 8277 ax-rnegex 8278 ax-cnre 8280 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-sub 8489 df-shft 11558 |
| This theorem is referenced by: shftfn 11567 |
| Copyright terms: Public domain | W3C validator |