![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > subsub2 | Structured version Visualization version GIF version |
Description: Law for double subtraction. (Contributed by NM, 30-Jun-2005.) (Revised by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
subsub2 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵 − 𝐶)) = (𝐴 + (𝐶 − 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | subcl 10732 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ) | |
2 | 1 | 3adant1 1123 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ) |
3 | simp1 1129 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ) | |
4 | simp3 1131 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
5 | simp2 1130 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ) | |
6 | subcl 10732 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐶 − 𝐵) ∈ ℂ) | |
7 | 4, 5, 6 | syl2anc 584 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐶 − 𝐵) ∈ ℂ) |
8 | 2, 3, 7 | add12d 10713 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + (𝐴 + (𝐶 − 𝐵))) = (𝐴 + ((𝐵 − 𝐶) + (𝐶 − 𝐵)))) |
9 | npncan2 10761 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + (𝐶 − 𝐵)) = 0) | |
10 | 9 | 3adant1 1123 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + (𝐶 − 𝐵)) = 0) |
11 | 10 | oveq2d 7032 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + ((𝐵 − 𝐶) + (𝐶 − 𝐵))) = (𝐴 + 0)) |
12 | 3 | addid1d 10687 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + 0) = 𝐴) |
13 | 8, 11, 12 | 3eqtrd 2835 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + (𝐴 + (𝐶 − 𝐵))) = 𝐴) |
14 | 3, 7 | addcld 10506 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + (𝐶 − 𝐵)) ∈ ℂ) |
15 | subadd 10736 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 − 𝐶) ∈ ℂ ∧ (𝐴 + (𝐶 − 𝐵)) ∈ ℂ) → ((𝐴 − (𝐵 − 𝐶)) = (𝐴 + (𝐶 − 𝐵)) ↔ ((𝐵 − 𝐶) + (𝐴 + (𝐶 − 𝐵))) = 𝐴)) | |
16 | 3, 2, 14, 15 | syl3anc 1364 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − (𝐵 − 𝐶)) = (𝐴 + (𝐶 − 𝐵)) ↔ ((𝐵 − 𝐶) + (𝐴 + (𝐶 − 𝐵))) = 𝐴)) |
17 | 13, 16 | mpbird 258 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − (𝐵 − 𝐶)) = (𝐴 + (𝐶 − 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ w3a 1080 = wceq 1522 ∈ wcel 2081 (class class class)co 7016 ℂcc 10381 0cc0 10383 + caddc 10386 − cmin 10717 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1777 ax-4 1791 ax-5 1888 ax-6 1947 ax-7 1992 ax-8 2083 ax-9 2091 ax-10 2112 ax-11 2126 ax-12 2141 ax-13 2344 ax-ext 2769 ax-sep 5094 ax-nul 5101 ax-pow 5157 ax-pr 5221 ax-un 7319 ax-resscn 10440 ax-1cn 10441 ax-icn 10442 ax-addcl 10443 ax-addrcl 10444 ax-mulcl 10445 ax-mulrcl 10446 ax-mulcom 10447 ax-addass 10448 ax-mulass 10449 ax-distr 10450 ax-i2m1 10451 ax-1ne0 10452 ax-1rid 10453 ax-rnegex 10454 ax-rrecex 10455 ax-cnre 10456 ax-pre-lttri 10457 ax-pre-lttrn 10458 ax-pre-ltadd 10459 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3or 1081 df-3an 1082 df-tru 1525 df-ex 1762 df-nf 1766 df-sb 2043 df-mo 2576 df-eu 2612 df-clab 2776 df-cleq 2788 df-clel 2863 df-nfc 2935 df-ne 2985 df-nel 3091 df-ral 3110 df-rex 3111 df-reu 3112 df-rab 3114 df-v 3439 df-sbc 3707 df-csb 3812 df-dif 3862 df-un 3864 df-in 3866 df-ss 3874 df-nul 4212 df-if 4382 df-pw 4455 df-sn 4473 df-pr 4475 df-op 4479 df-uni 4746 df-br 4963 df-opab 5025 df-mpt 5042 df-id 5348 df-po 5362 df-so 5363 df-xp 5449 df-rel 5450 df-cnv 5451 df-co 5452 df-dm 5453 df-rn 5454 df-res 5455 df-ima 5456 df-iota 6189 df-fun 6227 df-fn 6228 df-f 6229 df-f1 6230 df-fo 6231 df-f1o 6232 df-fv 6233 df-riota 6977 df-ov 7019 df-oprab 7020 df-mpo 7021 df-er 8139 df-en 8358 df-dom 8359 df-sdom 8360 df-pnf 10523 df-mnf 10524 df-ltxr 10526 df-sub 10719 |
This theorem is referenced by: nncan 10763 subsub 10764 subsub3 10766 ppncan 10776 subadd4 10778 subsub2d 10874 divalglem9 15585 ax5seglem7 26404 areaquad 39327 sub31 41117 |
Copyright terms: Public domain | W3C validator |