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

Theorem add12d 8101
Description: Commutative/associative law that swaps the first two terms in a triple sum. (Contributed by Mario Carneiro, 27-May-2016.)
Hypotheses
Ref Expression
addd.1  |-  ( ph  ->  A  e.  CC )
addd.2  |-  ( ph  ->  B  e.  CC )
addd.3  |-  ( ph  ->  C  e.  CC )
Assertion
Ref Expression
add12d  |-  ( ph  ->  ( A  +  ( B  +  C ) )  =  ( B  +  ( A  +  C ) ) )

Proof of Theorem add12d
StepHypRef Expression
1 addd.1 . 2  |-  ( ph  ->  A  e.  CC )
2 addd.2 . 2  |-  ( ph  ->  B  e.  CC )
3 addd.3 . 2  |-  ( ph  ->  C  e.  CC )
4 add12 8092 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  +  ( B  +  C ) )  =  ( B  +  ( A  +  C ) ) )
51, 2, 3, 4syl3anc 1238 1  |-  ( ph  ->  ( A  +  ( B  +  C ) )  =  ( B  +  ( A  +  C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1353    e. wcel 2148  (class class class)co 5868   CCcc 7787    + caddc 7792
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159  ax-addcom 7889  ax-addass 7891
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-v 2739  df-un 3133  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-iota 5173  df-fv 5219  df-ov 5871
This theorem is referenced by:  subsub2  8162  bdtrilem  11218
  Copyright terms: Public domain W3C validator