Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > add32d | Structured version Visualization version GIF version |
Description: Commutative/associative law that swaps the last two terms in a triple sum. (Contributed by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
addd.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
addd.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
addd.3 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
Ref | Expression |
---|---|
add32d | ⊢ (𝜑 → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | addd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
2 | addd.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
3 | addd.3 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
4 | add32 11239 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵)) | |
5 | 1, 2, 3, 4 | syl3anc 1371 | 1 ⊢ (𝜑 → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2104 (class class class)co 7307 ℂcc 10915 + caddc 10920 |
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 10974 ax-1cn 10975 ax-icn 10976 ax-addcl 10977 ax-addrcl 10978 ax-mulcl 10979 ax-mulrcl 10980 ax-mulcom 10981 ax-addass 10982 ax-mulass 10983 ax-distr 10984 ax-i2m1 10985 ax-1ne0 10986 ax-1rid 10987 ax-rnegex 10988 ax-rrecex 10989 ax-cnre 10990 ax-pre-lttri 10991 ax-pre-lttrn 10992 ax-pre-ltadd 10993 |
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-rab 3287 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-ov 7310 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-pnf 11057 df-mnf 11058 df-ltxr 11060 |
This theorem is referenced by: nppcan 11289 muladd 11453 fladdz 13591 zesq 13987 relexpaddnn 14807 abstri 15087 iseraltlem3 15440 sadadd2lem 16211 pythagtriplem1 16562 pythagtriplem12 16572 vdwlem2 16728 vdwlem6 16732 vdwlem8 16734 prmgaplem8 16804 tcphcphlem1 24444 uniioombllem5 24796 heron 26033 dcubic1 26040 lgamcvg2 26249 mulog2sumlem1 26727 chpdifbndlem1 26746 selberg34r 26764 pntlemr 26795 brbtwn2 27318 axpasch 27354 crctcshwlkn0lem4 28223 clwwisshclwwslemlem 28422 subfacval2 33194 lcmineqlem18 40096 sticksstones22 40166 sqrtcval 41287 fourierdlem19 43716 fourierdlem26 43723 carageniuncllem2 44110 cnapbmcpd 44845 opeoALTV 45194 |
Copyright terms: Public domain | W3C validator |