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 3969 | . . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐴 → 𝑦 ∈ ℝ)) |
3 | 2 | pm4.71rd 565 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
4 | recn 10630 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
5 | ovolshft.2 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
6 | 5 | recnd 10672 | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
7 | subneg 10938 | . . . . . . . 8 ⊢ ((𝑦 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝑦 − -𝐶) = (𝑦 + 𝐶)) | |
8 | 4, 6, 7 | syl2anr 598 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑦 − -𝐶) = (𝑦 + 𝐶)) |
9 | ovolshft.3 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 = {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴}) | |
10 | 9 | adantr 483 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → 𝐵 = {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴}) |
11 | 8, 10 | eleq12d 2910 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 − -𝐶) ∈ 𝐵 ↔ (𝑦 + 𝐶) ∈ {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴})) |
12 | id 22 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℝ) | |
13 | readdcl 10623 | . . . . . . . 8 ⊢ ((𝑦 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝑦 + 𝐶) ∈ ℝ) | |
14 | 12, 5, 13 | syl2anr 598 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (𝑦 + 𝐶) ∈ ℝ) |
15 | oveq1 7166 | . . . . . . . . 9 ⊢ (𝑥 = (𝑦 + 𝐶) → (𝑥 − 𝐶) = ((𝑦 + 𝐶) − 𝐶)) | |
16 | 15 | eleq1d 2900 | . . . . . . . 8 ⊢ (𝑥 = (𝑦 + 𝐶) → ((𝑥 − 𝐶) ∈ 𝐴 ↔ ((𝑦 + 𝐶) − 𝐶) ∈ 𝐴)) |
17 | 16 | elrab3 3684 | . . . . . . 7 ⊢ ((𝑦 + 𝐶) ∈ ℝ → ((𝑦 + 𝐶) ∈ {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴} ↔ ((𝑦 + 𝐶) − 𝐶) ∈ 𝐴)) |
18 | 14, 17 | syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 + 𝐶) ∈ {𝑥 ∈ ℝ ∣ (𝑥 − 𝐶) ∈ 𝐴} ↔ ((𝑦 + 𝐶) − 𝐶) ∈ 𝐴)) |
19 | pncan 10895 | . . . . . . . 8 ⊢ ((𝑦 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝑦 + 𝐶) − 𝐶) = 𝑦) | |
20 | 4, 6, 19 | syl2anr 598 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 + 𝐶) − 𝐶) = 𝑦) |
21 | 20 | eleq1d 2900 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (((𝑦 + 𝐶) − 𝐶) ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) |
22 | 11, 18, 21 | 3bitrd 307 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((𝑦 − -𝐶) ∈ 𝐵 ↔ 𝑦 ∈ 𝐴)) |
23 | 22 | pm5.32da 581 | . . . 4 ⊢ (𝜑 → ((𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝑦 ∈ 𝐴))) |
24 | 3, 23 | bitr4d 284 | . . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ (𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵))) |
25 | 24 | abbi2dv 2953 | . 2 ⊢ (𝜑 → 𝐴 = {𝑦 ∣ (𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵)}) |
26 | df-rab 3150 | . 2 ⊢ {𝑦 ∈ ℝ ∣ (𝑦 − -𝐶) ∈ 𝐵} = {𝑦 ∣ (𝑦 ∈ ℝ ∧ (𝑦 − -𝐶) ∈ 𝐵)} | |
27 | 25, 26 | syl6eqr 2877 | 1 ⊢ (𝜑 → 𝐴 = {𝑦 ∈ ℝ ∣ (𝑦 − -𝐶) ∈ 𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 {cab 2802 {crab 3145 ⊆ wss 3939 (class class class)co 7159 ℂcc 10538 ℝcr 10539 + caddc 10543 − cmin 10873 -cneg 10874 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-po 5477 df-so 5478 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-ltxr 10683 df-sub 10875 df-neg 10876 |
This theorem is referenced by: ovolshft 24115 shftmbl 24142 |
Copyright terms: Public domain | W3C validator |