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

Theorem addcan 8099
Description: Cancellation law for addition. Theorem I.1 of [Apostol] p. 18. (Contributed by NM, 22-Nov-1994.) (Proof shortened by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
addcan  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  =  ( A  +  C )  <->  B  =  C ) )

Proof of Theorem addcan
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 cnegex2 8098 . . 3  |-  ( A  e.  CC  ->  E. x  e.  CC  ( x  +  A )  =  0 )
213ad2ant1 1013 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  E. x  e.  CC  ( x  +  A )  =  0 )
3 oveq2 5861 . . . 4  |-  ( ( A  +  B )  =  ( A  +  C )  ->  (
x  +  ( A  +  B ) )  =  ( x  +  ( A  +  C
) ) )
4 simprr 527 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( x  +  A )  =  0 )
54oveq1d 5868 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( (
x  +  A )  +  B )  =  ( 0  +  B
) )
6 simprl 526 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  x  e.  CC )
7 simpl1 995 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  A  e.  CC )
8 simpl2 996 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  B  e.  CC )
96, 7, 8addassd 7942 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( (
x  +  A )  +  B )  =  ( x  +  ( A  +  B ) ) )
10 addid2 8058 . . . . . . 7  |-  ( B  e.  CC  ->  (
0  +  B )  =  B )
118, 10syl 14 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( 0  +  B )  =  B )
125, 9, 113eqtr3d 2211 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( x  +  ( A  +  B ) )  =  B )
134oveq1d 5868 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( (
x  +  A )  +  C )  =  ( 0  +  C
) )
14 simpl3 997 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  C  e.  CC )
156, 7, 14addassd 7942 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( (
x  +  A )  +  C )  =  ( x  +  ( A  +  C ) ) )
16 addid2 8058 . . . . . . 7  |-  ( C  e.  CC  ->  (
0  +  C )  =  C )
1714, 16syl 14 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( 0  +  C )  =  C )
1813, 15, 173eqtr3d 2211 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( x  +  ( A  +  C ) )  =  C )
1912, 18eqeq12d 2185 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( (
x  +  ( A  +  B ) )  =  ( x  +  ( A  +  C
) )  <->  B  =  C ) )
203, 19syl5ib 153 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( ( A  +  B )  =  ( A  +  C )  ->  B  =  C ) )
21 oveq2 5861 . . 3  |-  ( B  =  C  ->  ( A  +  B )  =  ( A  +  C ) )
2220, 21impbid1 141 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( ( A  +  B )  =  ( A  +  C )  <->  B  =  C ) )
232, 22rexlimddv 2592 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  B
)  =  ( A  +  C )  <->  B  =  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 973    = wceq 1348    e. wcel 2141   E.wrex 2449  (class class class)co 5853   CCcc 7772   0cc0 7774    + caddc 7777
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-resscn 7866  ax-1cn 7867  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-iota 5160  df-fv 5206  df-ov 5856
This theorem is referenced by:  addcani  8101  addcand  8103  subcan  8174
  Copyright terms: Public domain W3C validator