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

Theorem addcan2 7724
Description: Cancellation law for addition. (Contributed by NM, 30-Jul-2004.) (Revised by Scott Fenton, 3-Jan-2013.)
Assertion
Ref Expression
addcan2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  C
)  =  ( B  +  C )  <->  A  =  B ) )

Proof of Theorem addcan2
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 cnegex 7721 . . 3  |-  ( C  e.  CC  ->  E. x  e.  CC  ( C  +  x )  =  0 )
213ad2ant3 967 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  E. x  e.  CC  ( C  +  x )  =  0 )
3 oveq1 5673 . . . 4  |-  ( ( A  +  C )  =  ( B  +  C )  ->  (
( A  +  C
)  +  x )  =  ( ( B  +  C )  +  x ) )
4 simpl1 947 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  A  e.  CC )
5 simpl3 949 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  C  e.  CC )
6 simprl 499 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  x  e.  CC )
74, 5, 6addassd 7571 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( ( A  +  C )  +  x )  =  ( A  +  ( C  +  x ) ) )
8 simprr 500 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( C  +  x )  =  0 )
98oveq2d 5682 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( A  +  ( C  +  x ) )  =  ( A  +  0 ) )
10 addid1 7681 . . . . . . 7  |-  ( A  e.  CC  ->  ( A  +  0 )  =  A )
114, 10syl 14 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( A  +  0 )  =  A )
127, 9, 113eqtrd 2125 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( ( A  +  C )  +  x )  =  A )
13 simpl2 948 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  B  e.  CC )
1413, 5, 6addassd 7571 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( ( B  +  C )  +  x )  =  ( B  +  ( C  +  x ) ) )
158oveq2d 5682 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( B  +  ( C  +  x ) )  =  ( B  +  0 ) )
16 addid1 7681 . . . . . . 7  |-  ( B  e.  CC  ->  ( B  +  0 )  =  B )
1713, 16syl 14 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( B  +  0 )  =  B )
1814, 15, 173eqtrd 2125 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( ( B  +  C )  +  x )  =  B )
1912, 18eqeq12d 2103 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( (
( A  +  C
)  +  x )  =  ( ( B  +  C )  +  x )  <->  A  =  B ) )
203, 19syl5ib 153 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( ( A  +  C )  =  ( B  +  C )  ->  A  =  B ) )
21 oveq1 5673 . . 3  |-  ( A  =  B  ->  ( A  +  C )  =  ( B  +  C ) )
2220, 21impbid1 141 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  /\  ( x  e.  CC  /\  ( C  +  x
)  =  0 ) )  ->  ( ( A  +  C )  =  ( B  +  C )  <->  A  =  B ) )
232, 22rexlimddv 2494 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  C
)  =  ( B  +  C )  <->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 925    = wceq 1290    e. wcel 1439   E.wrex 2361  (class class class)co 5666   CCcc 7409   0cc0 7411    + caddc 7414
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-resscn 7498  ax-1cn 7499  ax-icn 7501  ax-addcl 7502  ax-addrcl 7503  ax-mulcl 7504  ax-addcom 7506  ax-addass 7508  ax-distr 7510  ax-i2m1 7511  ax-0id 7514  ax-rnegex 7515  ax-cnre 7517
This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-nf 1396  df-sb 1694  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ral 2365  df-rex 2366  df-v 2622  df-un 3004  df-in 3006  df-ss 3013  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-br 3852  df-iota 4993  df-fv 5036  df-ov 5669
This theorem is referenced by:  addcan2i  7726  addcan2d  7728  muleqadd  8198
  Copyright terms: Public domain W3C validator