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

Theorem addsubass 8100
Description: Associative-type law for addition and subtraction. (Contributed by NM, 6-Aug-2003.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
addsubass  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  -  C )  =  ( A  +  ( B  -  C
) ) )

Proof of Theorem addsubass
StepHypRef Expression
1 simp1 986 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  A  e.  CC )
2 subcl 8089 . . . . . 6  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( B  -  C
)  e.  CC )
323adant1 1004 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( B  -  C )  e.  CC )
4 simp3 988 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  C  e.  CC )
51, 3, 4addassd 7913 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  ( B  -  C ) )  +  C )  =  ( A  +  ( ( B  -  C )  +  C
) ) )
6 npcan 8099 . . . . . 6  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( ( B  -  C )  +  C
)  =  B )
763adant1 1004 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( B  -  C
)  +  C )  =  B )
87oveq2d 5853 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  +  ( ( B  -  C )  +  C ) )  =  ( A  +  B
) )
95, 8eqtrd 2197 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  ( B  -  C ) )  +  C )  =  ( A  +  B ) )
109oveq1d 5852 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( ( A  +  ( B  -  C
) )  +  C
)  -  C )  =  ( ( A  +  B )  -  C ) )
111, 3addcld 7910 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  +  ( B  -  C ) )  e.  CC )
12 pncan 8096 . . 3  |-  ( ( ( A  +  ( B  -  C ) )  e.  CC  /\  C  e.  CC )  ->  ( ( ( A  +  ( B  -  C ) )  +  C )  -  C
)  =  ( A  +  ( B  -  C ) ) )
1311, 4, 12syl2anc 409 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( ( A  +  ( B  -  C
) )  +  C
)  -  C )  =  ( A  +  ( B  -  C
) ) )
1410, 13eqtr3d 2199 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  -  C )  =  ( A  +  ( B  -  C
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 967    = wceq 1342    e. wcel 2135  (class class class)co 5837   CCcc 7743    + caddc 7748    - cmin 8061
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-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-14 2138  ax-ext 2146  ax-sep 4095  ax-pow 4148  ax-pr 4182  ax-setind 4509  ax-resscn 7837  ax-1cn 7838  ax-icn 7840  ax-addcl 7841  ax-addrcl 7842  ax-mulcl 7843  ax-addcom 7845  ax-addass 7847  ax-distr 7849  ax-i2m1 7850  ax-0id 7853  ax-rnegex 7854  ax-cnre 7856
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-ral 2447  df-rex 2448  df-reu 2449  df-rab 2451  df-v 2724  df-sbc 2948  df-dif 3114  df-un 3116  df-in 3118  df-ss 3125  df-pw 3556  df-sn 3577  df-pr 3578  df-op 3580  df-uni 3785  df-br 3978  df-opab 4039  df-id 4266  df-xp 4605  df-rel 4606  df-cnv 4607  df-co 4608  df-dm 4609  df-iota 5148  df-fun 5185  df-fv 5191  df-riota 5793  df-ov 5840  df-oprab 5841  df-mpo 5842  df-sub 8063
This theorem is referenced by:  addsub  8101  subadd23  8102  addsubeq4  8105  npncan  8111  subsub  8120  subsub3  8122  addsub4  8133  negsub  8138  addsubassi  8181  addsubassd  8221  zeo  9288  frecfzen2  10353  odd2np1  11799
  Copyright terms: Public domain W3C validator