| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > resubidaddlidlem | Structured version Visualization version GIF version | ||
| Description: Lemma for resubidaddlid 42841. A special case of npncan 11406. (Contributed by Steven Nguyen, 8-Jan-2023.) |
| Ref | Expression |
|---|---|
| resubidaddridlem.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| resubidaddridlem.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| resubidaddridlem.c | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| resubidaddridlem.1 | ⊢ (𝜑 → (𝐴 −ℝ 𝐵) = (𝐵 −ℝ 𝐶)) |
| Ref | Expression |
|---|---|
| resubidaddlidlem | ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)) = (𝐴 −ℝ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resubidaddridlem.c | . 2 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 2 | resubidaddridlem.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 3 | resubidaddridlem.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 4 | rersubcl 42824 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 −ℝ 𝐵) ∈ ℝ) | |
| 5 | 2, 3, 4 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐴 −ℝ 𝐵) ∈ ℝ) |
| 6 | rersubcl 42824 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 −ℝ 𝐶) ∈ ℝ) | |
| 7 | 3, 1, 6 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐵 −ℝ 𝐶) ∈ ℝ) |
| 8 | 5, 7 | readdcld 11165 | . 2 ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)) ∈ ℝ) |
| 9 | resubidaddridlem.1 | . . . . . 6 ⊢ (𝜑 → (𝐴 −ℝ 𝐵) = (𝐵 −ℝ 𝐶)) | |
| 10 | 9 | eqcomd 2743 | . . . . 5 ⊢ (𝜑 → (𝐵 −ℝ 𝐶) = (𝐴 −ℝ 𝐵)) |
| 11 | 3, 1, 5 | resubaddd 42826 | . . . . 5 ⊢ (𝜑 → ((𝐵 −ℝ 𝐶) = (𝐴 −ℝ 𝐵) ↔ (𝐶 + (𝐴 −ℝ 𝐵)) = 𝐵)) |
| 12 | 10, 11 | mpbid 232 | . . . 4 ⊢ (𝜑 → (𝐶 + (𝐴 −ℝ 𝐵)) = 𝐵) |
| 13 | 12 | oveq1d 7375 | . . 3 ⊢ (𝜑 → ((𝐶 + (𝐴 −ℝ 𝐵)) + (𝐵 −ℝ 𝐶)) = (𝐵 + (𝐵 −ℝ 𝐶))) |
| 14 | 1 | recnd 11164 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 15 | 5 | recnd 11164 | . . . 4 ⊢ (𝜑 → (𝐴 −ℝ 𝐵) ∈ ℂ) |
| 16 | 7 | recnd 11164 | . . . 4 ⊢ (𝜑 → (𝐵 −ℝ 𝐶) ∈ ℂ) |
| 17 | 14, 15, 16 | addassd 11158 | . . 3 ⊢ (𝜑 → ((𝐶 + (𝐴 −ℝ 𝐵)) + (𝐵 −ℝ 𝐶)) = (𝐶 + ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)))) |
| 18 | 2, 3, 7 | resubaddd 42826 | . . . 4 ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) = (𝐵 −ℝ 𝐶) ↔ (𝐵 + (𝐵 −ℝ 𝐶)) = 𝐴)) |
| 19 | 9, 18 | mpbid 232 | . . 3 ⊢ (𝜑 → (𝐵 + (𝐵 −ℝ 𝐶)) = 𝐴) |
| 20 | 13, 17, 19 | 3eqtr3d 2780 | . 2 ⊢ (𝜑 → (𝐶 + ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶))) = 𝐴) |
| 21 | 1, 8, 20 | reladdrsub 42831 | 1 ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)) = (𝐴 −ℝ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 (class class class)co 7360 ℝcr 11028 + caddc 11032 −ℝ cresub 42811 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-resscn 11086 ax-addrcl 11090 ax-addass 11094 ax-rnegex 11100 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-ltxr 11175 df-resub 42812 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |