![]() |
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 10544 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵)) | |
5 | 1, 2, 3, 4 | syl3anc 1491 | 1 ⊢ (𝜑 → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1653 ∈ wcel 2157 (class class class)co 6878 ℂcc 10222 + caddc 10227 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-sep 4975 ax-nul 4983 ax-pow 5035 ax-pr 5097 ax-un 7183 ax-resscn 10281 ax-1cn 10282 ax-icn 10283 ax-addcl 10284 ax-addrcl 10285 ax-mulcl 10286 ax-mulrcl 10287 ax-mulcom 10288 ax-addass 10289 ax-mulass 10290 ax-distr 10291 ax-i2m1 10292 ax-1ne0 10293 ax-1rid 10294 ax-rnegex 10295 ax-rrecex 10296 ax-cnre 10297 ax-pre-lttri 10298 ax-pre-lttrn 10299 ax-pre-ltadd 10300 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3or 1109 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ne 2972 df-nel 3075 df-ral 3094 df-rex 3095 df-rab 3098 df-v 3387 df-sbc 3634 df-csb 3729 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-nul 4116 df-if 4278 df-pw 4351 df-sn 4369 df-pr 4371 df-op 4375 df-uni 4629 df-br 4844 df-opab 4906 df-mpt 4923 df-id 5220 df-po 5233 df-so 5234 df-xp 5318 df-rel 5319 df-cnv 5320 df-co 5321 df-dm 5322 df-rn 5323 df-res 5324 df-ima 5325 df-iota 6064 df-fun 6103 df-fn 6104 df-f 6105 df-f1 6106 df-fo 6107 df-f1o 6108 df-fv 6109 df-ov 6881 df-er 7982 df-en 8196 df-dom 8197 df-sdom 8198 df-pnf 10365 df-mnf 10366 df-ltxr 10368 |
This theorem is referenced by: nppcan 10595 muladd 10754 fladdz 12881 zesq 13241 relexpaddnn 14132 abstri 14411 iseraltlem3 14755 sadadd2lem 15516 pythagtriplem1 15854 pythagtriplem12 15864 vdwlem2 16019 vdwlem6 16023 vdwlem8 16025 prmgaplem8 16095 tcphcphlem1 23361 uniioombllem5 23695 heron 24917 dcubic1 24924 lgamcvg2 25133 mulog2sumlem1 25575 chpdifbndlem1 25594 selberg34r 25612 pntlemr 25643 brbtwn2 26142 axpasch 26178 crctcshwlkn0lem4 27064 clwwisshclwwslemlem 27315 subfacval2 31686 fourierdlem19 41086 fourierdlem26 41093 carageniuncllem2 41482 cnapbmcpd 42151 opeoALTV 42377 |
Copyright terms: Public domain | W3C validator |