addsubass - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > addsubass		Structured version Visualization version GIF version

Theorem addsubass 10170

Description: Associative-type law for addition and subtraction. (Contributed by NM, 6-Aug-2003.) (Revised by Mario Carneiro, 27-May-2016.)

**Assertion**
Ref	Expression
addsubass	⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = (𝐴 + (𝐵 − 𝐶)))

**Proof of Theorem addsubass**
Step	Hyp	Ref	Expression
1		simp1 1054	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ)
2		subcl 10159	. . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ)
3	2	3adant1 1072	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 − 𝐶) ∈ ℂ)
4		simp3 1056	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ)
5	1, 3, 4	addassd 9941	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + (𝐵 − 𝐶)) + 𝐶) = (𝐴 + ((𝐵 − 𝐶) + 𝐶)))
6		npcan 10169	. . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + 𝐶) = 𝐵)
7	6	3adant1 1072	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐵 − 𝐶) + 𝐶) = 𝐵)
8	7	oveq2d 6565	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + ((𝐵 − 𝐶) + 𝐶)) = (𝐴 + 𝐵))
9	5, 8	eqtrd 2644	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + (𝐵 − 𝐶)) + 𝐶) = (𝐴 + 𝐵))
10	9	oveq1d 6564	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 + (𝐵 − 𝐶)) + 𝐶) − 𝐶) = ((𝐴 + 𝐵) − 𝐶))
11	1, 3	addcld 9938	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 + (𝐵 − 𝐶)) ∈ ℂ)
12		pncan 10166	. . 3 ⊢ (((𝐴 + (𝐵 − 𝐶)) ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 + (𝐵 − 𝐶)) + 𝐶) − 𝐶) = (𝐴 + (𝐵 − 𝐶)))
13	11, 4, 12	syl2anc 691	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((𝐴 + (𝐵 − 𝐶)) + 𝐶) − 𝐶) = (𝐴 + (𝐵 − 𝐶)))
14	10, 13	eqtr3d 2646	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) − 𝐶) = (𝐴 + (𝐵 − 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 (class class class)co 6549 ℂcc 9813 + caddc 9818 − cmin 10145

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-ltxr 9958 df-sub 10147

This theorem is referenced by: addsub 10171 subadd23 10172 addsubeq4 10175 npncan 10181 subsub 10190 subsub3 10192 addsub4 10203 negsub 10208 addsubassi 10251 addsubassd 10291 zeo 11339 fzen2 12630 fsumcube 14630 odd2np1 14903 chtub 24737 axcontlem2 25645 numclwwlkovf2ex 26613 numclwlk2lem2f 26630 dnibndlem3 31640 stoweidlem26 38919 av-numclwwlkovf2ex 41517 av-numclwlk2lem2f 41533

W3C validator