| 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 482 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 2 | rernegcl 42568 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (0 −ℝ 𝐴) ∈ ℝ) | |
| 3 | 2 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 −ℝ 𝐴) ∈ ℝ) |
| 4 | elre0re 42451 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 0 ∈ ℝ) | |
| 5 | 4, 4 | readdcld 11159 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (0 + 0) ∈ ℝ) |
| 6 | rernegcl 42568 | . . . . . . 7 ⊢ ((0 + 0) ∈ ℝ → (0 −ℝ (0 + 0)) ∈ ℝ) | |
| 7 | 5, 6 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (0 −ℝ (0 + 0)) ∈ ℝ) |
| 8 | 7 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 −ℝ (0 + 0)) ∈ ℝ) |
| 9 | simpr 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐵 ∈ ℝ) | |
| 10 | 8, 9 | readdcld 11159 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 −ℝ (0 + 0)) + 𝐵) ∈ ℝ) |
| 11 | 3, 10 | readdcld 11159 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)) ∈ ℝ) |
| 12 | resubeulem2 42573 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵))) = 𝐵) | |
| 13 | oveq2 7364 | . . . . 5 ⊢ (𝑥 = ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)) → (𝐴 + 𝑥) = (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)))) | |
| 14 | 13 | eqeq1d 2736 | . . . 4 ⊢ (𝑥 = ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)) → ((𝐴 + 𝑥) = 𝐵 ↔ (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵))) = 𝐵)) |
| 15 | 14 | rspcev 3574 | . . 3 ⊢ ((((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)) ∈ ℝ ∧ (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵))) = 𝐵) → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 𝐵) |
| 16 | 11, 12, 15 | syl2anc 584 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 𝐵) |
| 17 | 1, 16 | renegeulem 42566 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ∃!𝑥 ∈ ℝ (𝐴 + 𝑥) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∃wrex 3058 ∃!wreu 3346 (class class class)co 7356 ℝcr 11023 0cc0 11024 + caddc 11027 −ℝ cresub 42562 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-resscn 11081 ax-addrcl 11085 ax-addass 11089 ax-rnegex 11095 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-po 5530 df-so 5531 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-ltxr 11169 df-resub 42563 |
| This theorem is referenced by: rersubcl 42575 resubadd 42576 resubeqsub 42627 |
| Copyright terms: Public domain | W3C validator |