| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > shft2rab | Structured version Visualization version GIF version | ||
| Description: If 𝐵 is a shift of 𝐴 by 𝐶, then 𝐴 is a shift of 𝐵 by -𝐶. (Contributed by Mario Carneiro, 22-Mar-2014.) (Revised by Mario Carneiro, 6-Apr-2015.) |
| Ref | Expression |
|---|---|
| ovolshft.1 | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
| ovolshft.2 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| ovolshft.3 | ⊢ (𝜑 → 𝐵 = {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴}) |
| Ref | Expression |
|---|---|
| shft2rab | ⊢ (𝜑 → 𝐴 = {𝑦 ∈ ℝ ∣ (𝑦 − -𝐶) ∈ 𝐵}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ovolshft.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 2 | 1 | sseld 3944 | . . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐴 → 𝑦 ∈ ℝ)) |
| 3 | 2 | pm4.71rd 571 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
| 4 | recn 11192 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
| 5 | ovolshft.2 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 6 | 5 | recnd 11239 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 7 | subneg 11509 | . . . . . . . 8 ⊢ ((𝑦 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝑦 − -𝐶) = (𝑦 + 𝐶)) | |
| 8 | 4, 6, 7 | syl2anr 608 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑦 − -𝐶) = (𝑦 + 𝐶)) |
| 9 | ovolshft.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 = {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴}) | |
| 10 | 9 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝐵 = {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴}) |
| 11 | 8, 10 | eleq12d 2863 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 − -𝐶) ∈ 𝐵 ↔ (𝑦 + 𝐶) ∈ {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴})) |
| 12 | id 23 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℝ) | |
| 13 | readdcl 11185 | . . . . . . . 8 ⊢ ((𝑦 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝑦 + 𝐶) ∈ ℝ) | |
| 14 | 12, 5, 13 | syl2anr 608 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑦 + 𝐶) ∈ ℝ) |
| 15 | oveq1 7420 | . . . . . . . . 9 ⊢ (𝑥 = (𝑦 + 𝐶) → (𝑥 − 𝐶) = ((𝑦 + 𝐶) − 𝐶)) | |
| 16 | 15 | eleq1d 2854 | . . . . . . . 8 ⊢ (𝑥 = (𝑦 + 𝐶) → ((𝑥 − 𝐶) ∈ 𝐴 ↔ ((𝑦 + 𝐶) − 𝐶) ∈ 𝐴)) |
| 17 | 16 | elrab3 3660 | . . . . . . 7 ⊢ ((𝑦 + 𝐶) ∈ ℝ → ((𝑦 + 𝐶) ∈ {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴} ↔ ((𝑦 + 𝐶) − 𝐶) ∈ 𝐴)) |
| 18 | 14, 17 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 + 𝐶) ∈ {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴} ↔ ((𝑦 + 𝐶) − 𝐶) ∈ 𝐴)) |
| 19 | pncan 11465 | . . . . . . . 8 ⊢ ((𝑦 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝑦 + 𝐶) − 𝐶) = 𝑦) | |
| 20 | 4, 6, 19 | syl2anr 608 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 + 𝐶) − 𝐶) = 𝑦) |
| 21 | 20 | eleq1d 2854 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (((𝑦 + 𝐶) − 𝐶) ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) |
| 22 | 11, 18, 21 | 3bitrd 308 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 − -𝐶) ∈ 𝐵 ↔ 𝑦 ∈ 𝐴)) |
| 23 | 22 | pm5.32da 589 | . . . 4 ⊢ (𝜑 → ((𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
| 24 | 3, 23 | bitr4d 285 | . . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ (𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵))) |
| 25 | 24 | eqabdv 2902 | . 2 ⊢ (𝜑 → 𝐴 = {𝑦 ∣ (𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵)}) |
| 26 | df-rab 3424 | . 2 ⊢ {𝑦 ∈ ℝ ∣ (𝑦 − -𝐶) ∈ 𝐵} = {𝑦 ∣ (𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵)} | |
| 27 | 25, 26 | eqtr4di 2822 | 1 ⊢ (𝜑 → 𝐴 = {𝑦 ∈ ℝ ∣ (𝑦 − -𝐶) ∈ 𝐵}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 {cab 2747 {crab 3423 ⊆ wss 3913 (class class class)co 7413 ℂcc 11100 ℝcr 11101 + caddc 11105 − cmin 11443 -cneg 11444 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5273 ax-pow 5339 ax-pr 5407 ax-un 7735 ax-resscn 11159 ax-1cn 11160 ax-icn 11161 ax-addcl 11162 ax-addrcl 11163 ax-mulcl 11164 ax-mulrcl 11165 ax-mulcom 11166 ax-addass 11167 ax-mulass 11168 ax-distr 11169 ax-i2m1 11170 ax-1ne0 11171 ax-1rid 11172 ax-rnegex 11173 ax-rrecex 11174 ax-cnre 11175 ax-pre-lttri 11176 ax-pre-lttrn 11177 ax-pre-ltadd 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5559 df-po 5572 df-so 5573 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-iota 6495 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11247 df-mnf 11248 df-ltxr 11250 df-sub 11445 df-neg 11446 |
| This theorem is referenced by: ovolshft 25641 shftmbl 25668 |
| Copyright terms: Public domain | W3C validator |