| 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 42827. A special case of npncan 11415. (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 42810 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 −ℝ 𝐵) ∈ ℝ) | |
| 5 | 2, 3, 4 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐴 −ℝ 𝐵) ∈ ℝ) |
| 6 | rersubcl 42810 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 −ℝ 𝐶) ∈ ℝ) | |
| 7 | 3, 1, 6 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐵 −ℝ 𝐶) ∈ ℝ) |
| 8 | 5, 7 | readdcld 11174 | . 2 ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)) ∈ ℝ) |
| 9 | resubidaddridlem.1 | . . . . . 6 ⊢ (𝜑 → (𝐴 −ℝ 𝐵) = (𝐵 −ℝ 𝐶)) | |
| 10 | 9 | eqcomd 2742 | . . . . 5 ⊢ (𝜑 → (𝐵 −ℝ 𝐶) = (𝐴 −ℝ 𝐵)) |
| 11 | 3, 1, 5 | resubaddd 42812 | . . . . 5 ⊢ (𝜑 → ((𝐵 −ℝ 𝐶) = (𝐴 −ℝ 𝐵) ↔ (𝐶 + (𝐴 −ℝ 𝐵)) = 𝐵)) |
| 12 | 10, 11 | mpbid 232 | . . . 4 ⊢ (𝜑 → (𝐶 + (𝐴 −ℝ 𝐵)) = 𝐵) |
| 13 | 12 | oveq1d 7382 | . . 3 ⊢ (𝜑 → ((𝐶 + (𝐴 −ℝ 𝐵)) + (𝐵 −ℝ 𝐶)) = (𝐵 + (𝐵 −ℝ 𝐶))) |
| 14 | 1 | recnd 11173 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 15 | 5 | recnd 11173 | . . . 4 ⊢ (𝜑 → (𝐴 −ℝ 𝐵) ∈ ℂ) |
| 16 | 7 | recnd 11173 | . . . 4 ⊢ (𝜑 → (𝐵 −ℝ 𝐶) ∈ ℂ) |
| 17 | 14, 15, 16 | addassd 11167 | . . 3 ⊢ (𝜑 → ((𝐶 + (𝐴 −ℝ 𝐵)) + (𝐵 −ℝ 𝐶)) = (𝐶 + ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)))) |
| 18 | 2, 3, 7 | resubaddd 42812 | . . . 4 ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) = (𝐵 −ℝ 𝐶) ↔ (𝐵 + (𝐵 −ℝ 𝐶)) = 𝐴)) |
| 19 | 9, 18 | mpbid 232 | . . 3 ⊢ (𝜑 → (𝐵 + (𝐵 −ℝ 𝐶)) = 𝐴) |
| 20 | 13, 17, 19 | 3eqtr3d 2779 | . 2 ⊢ (𝜑 → (𝐶 + ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶))) = 𝐴) |
| 21 | 1, 8, 20 | reladdrsub 42817 | 1 ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)) = (𝐴 −ℝ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 (class class class)co 7367 ℝcr 11037 + caddc 11041 −ℝ cresub 42797 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-resscn 11095 ax-addrcl 11099 ax-addass 11103 ax-rnegex 11109 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-po 5539 df-so 5540 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-ltxr 11184 df-resub 42798 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |