Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > addsub4d | Structured version Visualization version GIF version |
Description: Rearrangement of 4 terms in a mixed addition and subtraction. (Contributed by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
negidd.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
pncand.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
subaddd.3 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
addsub4d.4 | ⊢ (𝜑 → 𝐷 ∈ ℂ) |
Ref | Expression |
---|---|
addsub4d | ⊢ (𝜑 → ((𝐴 + 𝐵) − (𝐶 + 𝐷)) = ((𝐴 − 𝐶) + (𝐵 − 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | negidd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
2 | pncand.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
3 | subaddd.3 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
4 | addsub4d.4 | . 2 ⊢ (𝜑 → 𝐷 ∈ ℂ) | |
5 | addsub4 11314 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) − (𝐶 + 𝐷)) = ((𝐴 − 𝐶) + (𝐵 − 𝐷))) | |
6 | 1, 2, 3, 4, 5 | syl22anc 837 | 1 ⊢ (𝜑 → ((𝐴 + 𝐵) − (𝐶 + 𝐷)) = ((𝐴 − 𝐶) + (𝐵 − 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2104 (class class class)co 7307 ℂcc 10919 + caddc 10924 − cmin 11255 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-resscn 10978 ax-1cn 10979 ax-icn 10980 ax-addcl 10981 ax-addrcl 10982 ax-mulcl 10983 ax-mulrcl 10984 ax-mulcom 10985 ax-addass 10986 ax-mulass 10987 ax-distr 10988 ax-i2m1 10989 ax-1ne0 10990 ax-1rid 10991 ax-rnegex 10992 ax-rrecex 10993 ax-cnre 10994 ax-pre-lttri 10995 ax-pre-lttrn 10996 ax-pre-ltadd 10997 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3305 df-rab 3306 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-br 5082 df-opab 5144 df-mpt 5165 df-id 5500 df-po 5514 df-so 5515 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-riota 7264 df-ov 7310 df-oprab 7311 df-mpo 7312 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-pnf 11061 df-mnf 11062 df-ltxr 11064 df-sub 11257 |
This theorem is referenced by: cjadd 14901 sadaddlem 16222 bezoutlem3 16298 pcqmul 16603 mul4sqlem 16703 4sqlem14 16708 4sqlem15 16709 4sqlem16 16710 4sqlem17 16711 blcvx 24010 ovolicc2lem4 24733 itgaddlem2 25037 dvaddbr 25151 ang180lem2 26009 mcubic 26046 quart1lem 26054 atanlogsublem 26114 mumullem2 26378 2lgslem3c 26595 2lgslem3d 26596 2sqlem8 26623 chpdifbndlem1 26750 pntrlog2bndlem2 26775 axcontlem8 27388 ballotlemgun 32540 itgaddnclem2 35884 cntotbnd 36002 lcmineqlem18 40254 2np3bcnp1 40300 sticksstones12 40314 pellexlem6 40851 congadd 40984 subadd4b 43049 addlimc 43418 fourierdlem42 43919 smfmullem1 44559 |
Copyright terms: Public domain | W3C validator |