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

Theorem add32d 7937
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 7928 . 2 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))
51, 2, 3, 4syl3anc 1216 1 (𝜑 → ((𝐴 + 𝐵) + 𝐶) = ((𝐴 + 𝐶) + 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1331  wcel 1480  (class class class)co 5774  cc 7625   + caddc 7630
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-addcom 7727  ax-addass 7729
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-rex 2422  df-v 2688  df-un 3075  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-iota 5088  df-fv 5131  df-ov 5777
This theorem is referenced by:  nppcan  7991  muladd  8153  peano5uzti  9166  flqaddz  10077  seq3shft2  10253  zesq  10417  abstri  10883  bdtrilem  11017
  Copyright terms: Public domain W3C validator