| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > resubeu | Structured version Visualization version GIF version | ||
| Description: Existential uniqueness of real differences. (Contributed by Steven Nguyen, 7-Jan-2023.) |
| Ref | Expression |
|---|---|
| resubeu | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ∃!𝑥 ∈ ℝ (𝐴 + 𝑥) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 2 | rernegcl 43247 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (0 −ℝ 𝐴) ∈ ℝ) | |
| 3 | 2 | adantr 486 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 −ℝ 𝐴) ∈ ℝ) |
| 4 | elre0re 43122 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 0 ∈ ℝ) | |
| 5 | 4, 4 | readdcld 11263 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (0 + 0) ∈ ℝ) |
| 6 | rernegcl 43247 | . . . . . . 7 ⊢ ((0 + 0) ∈ ℝ → (0 −ℝ (0 + 0)) ∈ ℝ) | |
| 7 | 5, 6 | syl 18 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (0 −ℝ (0 + 0)) ∈ ℝ) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 −ℝ (0 + 0)) ∈ ℝ) |
| 9 | simpr 490 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ) | |
| 10 | 8, 9 | readdcld 11263 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 −ℝ (0 + 0)) + 𝐵) ∈ ℝ) |
| 11 | 3, 10 | readdcld 11263 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)) ∈ ℝ) |
| 12 | resubeulem2 43252 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵))) = 𝐵) | |
| 13 | oveq2 7422 | . . . . 5 ⊢ (𝑥 = ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)) → (𝐴 + 𝑥) = (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)))) | |
| 14 | 13 | eqeq1d 2762 | . . . 4 ⊢ (𝑥 = ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)) → ((𝐴 + 𝑥) = 𝐵 ↔ (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵))) = 𝐵)) |
| 15 | 14 | rspcev 3576 | . . 3 ⊢ ((((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)) ∈ ℝ ∧ (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵))) = 𝐵) → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 𝐵) |
| 16 | 11, 12, 15 | syl2anc 596 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 𝐵) |
| 17 | 1, 16 | renegeulem 43245 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ∃!𝑥 ∈ ℝ (𝐴 + 𝑥) = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3086 ∃!wreu 3363 (class class class)co 7414 ℝcr 11124 0cc0 11125 + caddc 11128 −ℝ cresub 43241 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-resscn 11182 ax-addrcl 11186 ax-addass 11190 ax-rnegex 11196 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-er 8697 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11270 df-mnf 11271 df-ltxr 11273 df-resub 43242 |
| This theorem is used by: rersubcl 43254 resubadd 43255 resubeqsub 43306 |
| Copyright terms: Public domain | W3C validator |