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

Theorem addcani 8457
Description: Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by NM, 27-Oct-1999.) (Revised by Scott Fenton, 3-Jan-2013.)
Hypotheses
Ref Expression
addcani.1  |-  A  e.  CC
addcani.2  |-  B  e.  CC
addcani.3  |-  C  e.  CC
Assertion
Ref Expression
addcani  |-  ( ( A  +  B )  =  ( A  +  C )  <->  B  =  C )

Proof of Theorem addcani
StepHypRef Expression
1 addcani.1 . 2  |-  A  e.  CC
2 addcani.2 . 2  |-  B  e.  CC
3 addcani.3 . 2  |-  C  e.  CC
4 addcan 8455 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  =  ( A  +  C )  <->  B  =  C ) )
51, 2, 3, 4mp3an 1374 1  |-  ( ( A  +  B )  =  ( A  +  C )  <->  B  =  C )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    = wceq 1398    e. wcel 2205  (class class class)co 6052   CCcc 8127    + caddc 8132
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216  ax-resscn 8221  ax-1cn 8222  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-distr 8233  ax-i2m1 8234  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3217  df-in 3219  df-ss 3226  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-iota 5314  df-fv 5362  df-ov 6055
This theorem is referenced by:  negdii  8559  fsumrelem  12161  karatsuba  13132
  Copyright terms: Public domain W3C validator