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 3965 | . . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐴 → 𝑦 ∈ ℝ)) |
3 | 2 | pm4.71rd 565 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
4 | recn 10626 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
5 | ovolshft.2 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
6 | 5 | recnd 10668 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
7 | subneg 10934 | . . . . . . . 8 ⊢ ((𝑦 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝑦 − -𝐶) = (𝑦 + 𝐶)) | |
8 | 4, 6, 7 | syl2anr 598 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑦 − -𝐶) = (𝑦 + 𝐶)) |
9 | ovolshft.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 = {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴}) | |
10 | 9 | adantr 483 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝐵 = {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴}) |
11 | 8, 10 | eleq12d 2907 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 − -𝐶) ∈ 𝐵 ↔ (𝑦 + 𝐶) ∈ {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴})) |
12 | id 22 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℝ) | |
13 | readdcl 10619 | . . . . . . . 8 ⊢ ((𝑦 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝑦 + 𝐶) ∈ ℝ) | |
14 | 12, 5, 13 | syl2anr 598 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑦 + 𝐶) ∈ ℝ) |
15 | oveq1 7162 | . . . . . . . . 9 ⊢ (𝑥 = (𝑦 + 𝐶) → (𝑥 − 𝐶) = ((𝑦 + 𝐶) − 𝐶)) | |
16 | 15 | eleq1d 2897 | . . . . . . . 8 ⊢ (𝑥 = (𝑦 + 𝐶) → ((𝑥 − 𝐶) ∈ 𝐴 ↔ ((𝑦 + 𝐶) − 𝐶) ∈ 𝐴)) |
17 | 16 | elrab3 3680 | . . . . . . 7 ⊢ ((𝑦 + 𝐶) ∈ ℝ → ((𝑦 + 𝐶) ∈ {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴} ↔ ((𝑦 + 𝐶) − 𝐶) ∈ 𝐴)) |
18 | 14, 17 | syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 + 𝐶) ∈ {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴} ↔ ((𝑦 + 𝐶) − 𝐶) ∈ 𝐴)) |
19 | pncan 10891 | . . . . . . . 8 ⊢ ((𝑦 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝑦 + 𝐶) − 𝐶) = 𝑦) | |
20 | 4, 6, 19 | syl2anr 598 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 + 𝐶) − 𝐶) = 𝑦) |
21 | 20 | eleq1d 2897 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (((𝑦 + 𝐶) − 𝐶) ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) |
22 | 11, 18, 21 | 3bitrd 307 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 − -𝐶) ∈ 𝐵 ↔ 𝑦 ∈ 𝐴)) |
23 | 22 | pm5.32da 581 | . . . 4 ⊢ (𝜑 → ((𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
24 | 3, 23 | bitr4d 284 | . . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ (𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵))) |
25 | 24 | abbi2dv 2950 | . 2 ⊢ (𝜑 → 𝐴 = {𝑦 ∣ (𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵)}) |
26 | df-rab 3147 | . 2 ⊢ {𝑦 ∈ ℝ ∣ (𝑦 − -𝐶) ∈ 𝐵} = {𝑦 ∣ (𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵)} | |
27 | 25, 26 | syl6eqr 2874 | 1 ⊢ (𝜑 → 𝐴 = {𝑦 ∈ ℝ ∣ (𝑦 − -𝐶) ∈ 𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 {cab 2799 {crab 3142 ⊆ wss 3935 (class class class)co 7155 ℂcc 10534 ℝcr 10535 + caddc 10539 − cmin 10869 -cneg 10870 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 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 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-po 5473 df-so 5474 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-ltxr 10679 df-sub 10871 df-neg 10872 |
This theorem is referenced by: ovolshft 24111 shftmbl 24138 |
Copyright terms: Public domain | W3C validator |