![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ppncan | GIF version |
Description: Cancellation law for mixed addition and subtraction. (Contributed by NM, 30-Jun-2005.) |
Ref | Expression |
---|---|
ppncan | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + (𝐶 − 𝐵)) = (𝐴 + 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | addcom 8112 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) | |
2 | 1 | 3adant3 1019 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) |
3 | 2 | oveq1d 5906 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − (𝐵 − 𝐶)) = ((𝐵 + 𝐴) − (𝐵 − 𝐶))) |
4 | addcl 7954 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) | |
5 | 4 | 3adant3 1019 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ) |
6 | subsub2 8203 | . . 3 ⊢ (((𝐴 + 𝐵) ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − (𝐵 − 𝐶)) = ((𝐴 + 𝐵) + (𝐶 − 𝐵))) | |
7 | 5, 6 | syld3an1 1295 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − (𝐵 − 𝐶)) = ((𝐴 + 𝐵) + (𝐶 − 𝐵))) |
8 | pnncan 8216 | . . 3 ⊢ ((𝐵 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) − (𝐵 − 𝐶)) = (𝐴 + 𝐶)) | |
9 | 8 | 3com12 1209 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 + 𝐴) − (𝐵 − 𝐶)) = (𝐴 + 𝐶)) |
10 | 3, 7, 9 | 3eqtr3d 2230 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + (𝐶 − 𝐵)) = (𝐴 + 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 980 = wceq 1364 ∈ wcel 2160 (class class class)co 5891 ℂcc 7827 + caddc 7832 − cmin 8146 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2163 ax-ext 2171 ax-sep 4136 ax-pow 4189 ax-pr 4224 ax-setind 4551 ax-resscn 7921 ax-1cn 7922 ax-icn 7924 ax-addcl 7925 ax-addrcl 7926 ax-mulcl 7927 ax-addcom 7929 ax-addass 7931 ax-distr 7933 ax-i2m1 7934 ax-0id 7937 ax-rnegex 7938 ax-cnre 7940 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-ral 2473 df-rex 2474 df-reu 2475 df-rab 2477 df-v 2754 df-sbc 2978 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-br 4019 df-opab 4080 df-id 4308 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-iota 5193 df-fun 5233 df-fv 5239 df-riota 5847 df-ov 5894 df-oprab 5895 df-mpo 5896 df-sub 8148 |
This theorem is referenced by: ppncand 8326 halfaddsub 9171 pythagtriplem4 12286 pythagtriplem14 12295 ptolemy 14629 |
Copyright terms: Public domain | W3C validator |