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

Theorem addcan 7288
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 7287 . . 3  |-  ( A  e.  CC  ->  E. x  e.  CC  ( x  +  A )  =  0 )
213ad2ant1 959 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  E. x  e.  CC  ( x  +  A )  =  0 )
3 oveq2 5540 . . . 4  |-  ( ( A  +  B )  =  ( A  +  C )  ->  (
x  +  ( A  +  B ) )  =  ( x  +  ( A  +  C
) ) )
4 simprr 498 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( x  +  A )  =  0 )
54oveq1d 5547 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( (
x  +  A )  +  B )  =  ( 0  +  B
) )
6 simprl 497 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  x  e.  CC )
7 simpl1 941 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  A  e.  CC )
8 simpl2 942 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  B  e.  CC )
96, 7, 8addassd 7141 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( (
x  +  A )  +  B )  =  ( x  +  ( A  +  B ) ) )
10 addid2 7247 . . . . . . 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 2121 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( x  +  ( A  +  B ) )  =  B )
134oveq1d 5547 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( (
x  +  A )  +  C )  =  ( 0  +  C
) )
14 simpl3 943 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  C  e.  CC )
156, 7, 14addassd 7141 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( (
x  +  A )  +  C )  =  ( x  +  ( A  +  C ) ) )
16 addid2 7247 . . . . . . 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 2121 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( x  +  ( A  +  C ) )  =  C )
1912, 18eqeq12d 2095 . . . 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 152 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( ( A  +  B )  =  ( A  +  C )  ->  B  =  C ) )
21 oveq2 5540 . . 3  |-  ( B  =  C  ->  ( A  +  B )  =  ( A  +  C ) )
2220, 21impbid1 140 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( x  +  A
)  =  0 ) )  ->  ( ( A  +  B )  =  ( A  +  C )  <->  B  =  C ) )
232, 22rexlimddv 2481 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 102    <-> wb 103    /\ w3a 919    = wceq 1284    e. wcel 1433   E.wrex 2349  (class class class)co 5532   CCcc 6979   0cc0 6981    + caddc 6984
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-resscn 7068  ax-1cn 7069  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-addcom 7076  ax-addass 7078  ax-distr 7080  ax-i2m1 7081  ax-0id 7084  ax-rnegex 7085  ax-cnre 7087
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-iota 4887  df-fv 4930  df-ov 5535
This theorem is referenced by:  addcani  7290  addcand  7292  subcan  7363
  Copyright terms: Public domain W3C validator