Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > resubidaddid1lem | Structured version Visualization version GIF version |
Description: Lemma for resubidaddid1 39245. A special case of npncan 10907. (Contributed by Steven Nguyen, 8-Jan-2023.) |
Ref | Expression |
---|---|
resubidaddid1lem.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
resubidaddid1lem.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
resubidaddid1lem.c | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
resubidaddid1lem.1 | ⊢ (𝜑 → (𝐴 −ℝ 𝐵) = (𝐵 −ℝ 𝐶)) |
Ref | Expression |
---|---|
resubidaddid1lem | ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)) = (𝐴 −ℝ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resubidaddid1lem.c | . 2 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
2 | resubidaddid1lem.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
3 | resubidaddid1lem.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
4 | rersubcl 39228 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 −ℝ 𝐵) ∈ ℝ) | |
5 | 2, 3, 4 | syl2anc 586 | . . 3 ⊢ (𝜑 → (𝐴 −ℝ 𝐵) ∈ ℝ) |
6 | rersubcl 39228 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 −ℝ 𝐶) ∈ ℝ) | |
7 | 3, 1, 6 | syl2anc 586 | . . 3 ⊢ (𝜑 → (𝐵 −ℝ 𝐶) ∈ ℝ) |
8 | 5, 7 | readdcld 10670 | . 2 ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)) ∈ ℝ) |
9 | resubidaddid1lem.1 | . . . . . 6 ⊢ (𝜑 → (𝐴 −ℝ 𝐵) = (𝐵 −ℝ 𝐶)) | |
10 | 9 | eqcomd 2827 | . . . . 5 ⊢ (𝜑 → (𝐵 −ℝ 𝐶) = (𝐴 −ℝ 𝐵)) |
11 | 3, 1, 5 | resubaddd 39230 | . . . . 5 ⊢ (𝜑 → ((𝐵 −ℝ 𝐶) = (𝐴 −ℝ 𝐵) ↔ (𝐶 + (𝐴 −ℝ 𝐵)) = 𝐵)) |
12 | 10, 11 | mpbid 234 | . . . 4 ⊢ (𝜑 → (𝐶 + (𝐴 −ℝ 𝐵)) = 𝐵) |
13 | 12 | oveq1d 7171 | . . 3 ⊢ (𝜑 → ((𝐶 + (𝐴 −ℝ 𝐵)) + (𝐵 −ℝ 𝐶)) = (𝐵 + (𝐵 −ℝ 𝐶))) |
14 | 1 | recnd 10669 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
15 | 5 | recnd 10669 | . . . 4 ⊢ (𝜑 → (𝐴 −ℝ 𝐵) ∈ ℂ) |
16 | 7 | recnd 10669 | . . . 4 ⊢ (𝜑 → (𝐵 −ℝ 𝐶) ∈ ℂ) |
17 | 14, 15, 16 | addassd 10663 | . . 3 ⊢ (𝜑 → ((𝐶 + (𝐴 −ℝ 𝐵)) + (𝐵 −ℝ 𝐶)) = (𝐶 + ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)))) |
18 | 2, 3, 7 | resubaddd 39230 | . . . 4 ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) = (𝐵 −ℝ 𝐶) ↔ (𝐵 + (𝐵 −ℝ 𝐶)) = 𝐴)) |
19 | 9, 18 | mpbid 234 | . . 3 ⊢ (𝜑 → (𝐵 + (𝐵 −ℝ 𝐶)) = 𝐴) |
20 | 13, 17, 19 | 3eqtr3d 2864 | . 2 ⊢ (𝜑 → (𝐶 + ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶))) = 𝐴) |
21 | 1, 8, 20 | reladdrsub 39235 | 1 ⊢ (𝜑 → ((𝐴 −ℝ 𝐵) + (𝐵 −ℝ 𝐶)) = (𝐴 −ℝ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 (class class class)co 7156 ℝcr 10536 + caddc 10540 −ℝ cresub 39215 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-resscn 10594 ax-addrcl 10598 ax-addass 10602 ax-rnegex 10608 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-po 5474 df-so 5475 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-ltxr 10680 df-resub 39216 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |