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

Theorem add12i 7174
Description: Commutative/associative law that swaps the first two terms in a triple sum. (Contributed by NM, 21-Jan-1997.)
Hypotheses
Ref Expression
add.1  |-  A  e.  CC
add.2  |-  B  e.  CC
add.3  |-  C  e.  CC
Assertion
Ref Expression
add12i  |-  ( A  +  ( B  +  C ) )  =  ( B  +  ( A  +  C ) )

Proof of Theorem add12i
StepHypRef Expression
1 add.1 . 2  |-  A  e.  CC
2 add.2 . 2  |-  B  e.  CC
3 add.3 . 2  |-  C  e.  CC
4 add12 7169 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  +  ( B  +  C ) )  =  ( B  +  ( A  +  C ) ) )
51, 2, 3, 4mp3an 1232 1  |-  ( A  +  ( B  +  C ) )  =  ( B  +  ( A  +  C ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1243    e. wcel 1393  (class class class)co 5512   CCcc 6887    + caddc 6892
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-addcom 6984  ax-addass 6986
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312  df-v 2559  df-un 2922  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-iota 4867  df-fv 4910  df-ov 5515
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator