![]() |
Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > resubeulem2 | Structured version Visualization version GIF version |
Description: Lemma for resubeu 41996. A value which when added to 𝐴, results in 𝐵. (Contributed by Steven Nguyen, 7-Jan-2023.) |
Ref | Expression |
---|---|
resubeulem2 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵))) = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | renegid 41992 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 + (0 −ℝ 𝐴)) = 0) | |
2 | 1 | adantr 479 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + (0 −ℝ 𝐴)) = 0) |
3 | 2 | oveq1d 7430 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 + (0 −ℝ 𝐴)) + ((0 −ℝ (0 + 0)) + 𝐵)) = (0 + ((0 −ℝ (0 + 0)) + 𝐵))) |
4 | simpl 481 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℝ) | |
5 | 4 | recnd 11270 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℂ) |
6 | rernegcl 41990 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (0 −ℝ 𝐴) ∈ ℝ) | |
7 | 6 | adantr 479 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 −ℝ 𝐴) ∈ ℝ) |
8 | 7 | recnd 11270 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 −ℝ 𝐴) ∈ ℂ) |
9 | elre0re 41900 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 0 ∈ ℝ) | |
10 | 9, 9 | readdcld 11271 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → (0 + 0) ∈ ℝ) |
11 | rernegcl 41990 | . . . . . . 7 ⊢ ((0 + 0) ∈ ℝ → (0 −ℝ (0 + 0)) ∈ ℝ) | |
12 | 10, 11 | syl 17 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → (0 −ℝ (0 + 0)) ∈ ℝ) |
13 | id 22 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ) | |
14 | 12, 13 | readdcld 11271 | . . . . 5 ⊢ (𝐵 ∈ ℝ → ((0 −ℝ (0 + 0)) + 𝐵) ∈ ℝ) |
15 | 14 | adantl 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 −ℝ (0 + 0)) + 𝐵) ∈ ℝ) |
16 | 15 | recnd 11270 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 −ℝ (0 + 0)) + 𝐵) ∈ ℂ) |
17 | 5, 8, 16 | addassd 11264 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 + (0 −ℝ 𝐴)) + ((0 −ℝ (0 + 0)) + 𝐵)) = (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵)))) |
18 | resubeulem1 41994 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (0 + (0 −ℝ (0 + 0))) = (0 −ℝ 0)) | |
19 | 18 | oveq1d 7430 | . . . 4 ⊢ (𝐵 ∈ ℝ → ((0 + (0 −ℝ (0 + 0))) + 𝐵) = ((0 −ℝ 0) + 𝐵)) |
20 | 9 | recnd 11270 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 0 ∈ ℂ) |
21 | 12 | recnd 11270 | . . . . 5 ⊢ (𝐵 ∈ ℝ → (0 −ℝ (0 + 0)) ∈ ℂ) |
22 | recn 11226 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
23 | 20, 21, 22 | addassd 11264 | . . . 4 ⊢ (𝐵 ∈ ℝ → ((0 + (0 −ℝ (0 + 0))) + 𝐵) = (0 + ((0 −ℝ (0 + 0)) + 𝐵))) |
24 | reneg0addlid 41993 | . . . 4 ⊢ (𝐵 ∈ ℝ → ((0 −ℝ 0) + 𝐵) = 𝐵) | |
25 | 19, 23, 24 | 3eqtr3d 2773 | . . 3 ⊢ (𝐵 ∈ ℝ → (0 + ((0 −ℝ (0 + 0)) + 𝐵)) = 𝐵) |
26 | 25 | adantl 480 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 + ((0 −ℝ (0 + 0)) + 𝐵)) = 𝐵) |
27 | 3, 17, 26 | 3eqtr3d 2773 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + ((0 −ℝ 𝐴) + ((0 −ℝ (0 + 0)) + 𝐵))) = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 (class class class)co 7415 ℝcr 11135 0cc0 11136 + caddc 11139 −ℝ cresub 41984 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7737 ax-resscn 11193 ax-addrcl 11197 ax-addass 11201 ax-rnegex 11207 ax-pre-lttri 11210 ax-pre-lttrn 11211 ax-pre-ltadd 11212 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-br 5144 df-opab 5206 df-mpt 5227 df-id 5570 df-po 5584 df-so 5585 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7371 df-ov 7418 df-oprab 7419 df-mpo 7420 df-er 8721 df-en 8961 df-dom 8962 df-sdom 8963 df-pnf 11278 df-mnf 11279 df-ltxr 11281 df-resub 41985 |
This theorem is referenced by: resubeu 41996 |
Copyright terms: Public domain | W3C validator |