ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  add32d GIF version

Theorem add32d 8076
Description: Commutative/associative law that swaps the last two terms in a triple sum. (Contributed by Mario Carneiro, 27-May-2016.)
Hypotheses
Ref Expression
addd.1 (𝜑𝐴 ∈ ℂ)
addd.2 (𝜑𝐵 ∈ ℂ)
addd.3 (𝜑𝐶 ∈ ℂ)
Assertion
Ref Expression
add32d (𝜑 → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))

Proof of Theorem add32d
StepHypRef Expression
1 addd.1 . 2 (𝜑𝐴 ∈ ℂ)
2 addd.2 . 2 (𝜑𝐵 ∈ ℂ)
3 addd.3 . 2 (𝜑𝐶 ∈ ℂ)
4 add32 8067 . 2 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))
51, 2, 3, 4syl3anc 1233 1 (𝜑 → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1348  wcel 2141  (class class class)co 5851  cc 7761   + caddc 7766
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-addcom 7863  ax-addass 7865
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-rex 2454  df-v 2732  df-un 3125  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-iota 5158  df-fv 5204  df-ov 5854
This theorem is referenced by:  nppcan  8130  muladd  8292  peano5uzti  9309  flqaddz  10242  seq3shft2  10418  zesq  10583  abstri  11057  bdtrilem  11191  pythagtriplem1  12208  pythagtriplem12  12218
  Copyright terms: Public domain W3C validator