Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > shftdm | Structured version Visualization version 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 14429 | . . 3 ⊢ (𝐴 ∈ ℂ → (𝐹 shift 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)}) |
3 | 2 | dmeqd 5774 | . 2 ⊢ (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)}) |
4 | 19.42v 1954 | . . . . 5 ⊢ (∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦) ↔ (𝑥 ∈ ℂ ∧ ∃𝑦(𝑥 − 𝐴)𝐹𝑦)) | |
5 | ovex 7189 | . . . . . . 7 ⊢ (𝑥 − 𝐴) ∈ V | |
6 | 5 | eldm 5769 | . . . . . 6 ⊢ ((𝑥 − 𝐴) ∈ dom 𝐹 ↔ ∃𝑦(𝑥 − 𝐴)𝐹𝑦) |
7 | 6 | anbi2i 624 | . . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹) ↔ (𝑥 ∈ ℂ ∧ ∃𝑦(𝑥 − 𝐴)𝐹𝑦)) |
8 | 4, 7 | bitr4i 280 | . . . 4 ⊢ (∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦) ↔ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹)) |
9 | 8 | abbii 2886 | . . 3 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹)} |
10 | dmopab 5784 | . . 3 ⊢ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} | |
11 | df-rab 3147 | . . 3 ⊢ {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹} = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴) ∈ dom 𝐹)} | |
12 | 9, 10, 11 | 3eqtr4i 2854 | . 2 ⊢ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} = {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹} |
13 | 3, 12 | syl6eq 2872 | 1 ⊢ (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = {𝑥 ∈ ℂ ∣ (𝑥 − 𝐴) ∈ dom 𝐹}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∃wex 1780 ∈ wcel 2114 {cab 2799 {crab 3142 Vcvv 3494 class class class wbr 5066 {copab 5128 dom cdm 5555 (class class class)co 7156 ℂcc 10535 − cmin 10870 shift cshi 14425 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-po 5474 df-so 5475 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-ltxr 10680 df-sub 10872 df-shft 14426 |
This theorem is referenced by: shftfn 14432 |
Copyright terms: Public domain | W3C validator |