Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > subaddeqd | Structured version Visualization version GIF version |
Description: Transfer two terms of a subtraction to an addition in an equality. (Contributed by Thierry Arnoux, 2-Feb-2020.) |
Ref | Expression |
---|---|
subaddeqd.a | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
subaddeqd.b | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
subaddeqd.c | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
subaddeqd.d | ⊢ (𝜑 → 𝐷 ∈ ℂ) |
subaddeqd.1 | ⊢ (𝜑 → (𝐴 + 𝐵) = (𝐶 + 𝐷)) |
Ref | Expression |
---|---|
subaddeqd | ⊢ (𝜑 → (𝐴 − 𝐷) = (𝐶 − 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | subaddeqd.1 | . . . 4 ⊢ (𝜑 → (𝐴 + 𝐵) = (𝐶 + 𝐷)) | |
2 | 1 | oveq1d 7185 | . . 3 ⊢ (𝜑 → ((𝐴 + 𝐵) − (𝐷 + 𝐵)) = ((𝐶 + 𝐷) − (𝐷 + 𝐵))) |
3 | subaddeqd.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
4 | subaddeqd.d | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ ℂ) | |
5 | 3, 4 | addcomd 10920 | . . . 4 ⊢ (𝜑 → (𝐶 + 𝐷) = (𝐷 + 𝐶)) |
6 | 5 | oveq1d 7185 | . . 3 ⊢ (𝜑 → ((𝐶 + 𝐷) − (𝐷 + 𝐵)) = ((𝐷 + 𝐶) − (𝐷 + 𝐵))) |
7 | 2, 6 | eqtrd 2773 | . 2 ⊢ (𝜑 → ((𝐴 + 𝐵) − (𝐷 + 𝐵)) = ((𝐷 + 𝐶) − (𝐷 + 𝐵))) |
8 | subaddeqd.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
9 | subaddeqd.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
10 | 8, 4, 9 | pnpcan2d 11113 | . 2 ⊢ (𝜑 → ((𝐴 + 𝐵) − (𝐷 + 𝐵)) = (𝐴 − 𝐷)) |
11 | 4, 3, 9 | pnpcand 11112 | . 2 ⊢ (𝜑 → ((𝐷 + 𝐶) − (𝐷 + 𝐵)) = (𝐶 − 𝐵)) |
12 | 7, 10, 11 | 3eqtr3d 2781 | 1 ⊢ (𝜑 → (𝐴 − 𝐷) = (𝐶 − 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 (class class class)co 7170 ℂcc 10613 + caddc 10618 − cmin 10948 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-sep 5167 ax-nul 5174 ax-pow 5232 ax-pr 5296 ax-un 7479 ax-resscn 10672 ax-1cn 10673 ax-icn 10674 ax-addcl 10675 ax-addrcl 10676 ax-mulcl 10677 ax-mulrcl 10678 ax-mulcom 10679 ax-addass 10680 ax-mulass 10681 ax-distr 10682 ax-i2m1 10683 ax-1ne0 10684 ax-1rid 10685 ax-rnegex 10686 ax-rrecex 10687 ax-cnre 10688 ax-pre-lttri 10689 ax-pre-lttrn 10690 ax-pre-ltadd 10691 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-nel 3039 df-ral 3058 df-rex 3059 df-reu 3060 df-rab 3062 df-v 3400 df-sbc 3681 df-csb 3791 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-nul 4212 df-if 4415 df-pw 4490 df-sn 4517 df-pr 4519 df-op 4523 df-uni 4797 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5429 df-po 5442 df-so 5443 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-iota 6297 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-riota 7127 df-ov 7173 df-oprab 7174 df-mpo 7175 df-er 8320 df-en 8556 df-dom 8557 df-sdom 8558 df-pnf 10755 df-mnf 10756 df-ltxr 10758 df-sub 10950 |
This theorem is referenced by: 2sqmod 26172 fmtnorec4 44555 |
Copyright terms: Public domain | W3C validator |