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

Theorem addcani 7937
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 7935 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  =  ( A  +  C )  <->  B  =  C ) )
51, 2, 3, 4mp3an 1315 1  |-  ( ( A  +  B )  =  ( A  +  C )  <->  B  =  C )
Colors of variables: wff set class
Syntax hints:    <-> wb 104    = wceq 1331    e. wcel 1480  (class class class)co 5767   CCcc 7611    + caddc 7616
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 2119  ax-resscn 7705  ax-1cn 7706  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-addcom 7713  ax-addass 7715  ax-distr 7717  ax-i2m1 7718  ax-0id 7721  ax-rnegex 7722  ax-cnre 7724
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-iota 5083  df-fv 5126  df-ov 5770
This theorem is referenced by:  negdii  8039  fsumrelem  11233
  Copyright terms: Public domain W3C validator