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

Theorem readdcan 8059
Description: Cancellation law for addition over the reals. (Contributed by Scott Fenton, 3-Jan-2013.)
Assertion
Ref Expression
readdcan  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( C  +  A
)  =  ( C  +  B )  <->  A  =  B ) )

Proof of Theorem readdcan
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ax-rnegex 7883 . . . 4  |-  ( C  e.  RR  ->  E. x  e.  RR  ( C  +  x )  =  0 )
213ad2ant3 1015 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  E. x  e.  RR  ( C  +  x )  =  0 )
3 oveq2 5861 . . . . . . 7  |-  ( ( C  +  A )  =  ( C  +  B )  ->  (
x  +  ( C  +  A ) )  =  ( x  +  ( C  +  B
) ) )
43adantl 275 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
x  +  ( C  +  A ) )  =  ( x  +  ( C  +  B
) ) )
5 simprl 526 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  x  e.  RR )
65recnd 7948 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  x  e.  CC )
7 simpl3 997 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  C  e.  RR )
87recnd 7948 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  C  e.  CC )
9 simpl1 995 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  A  e.  RR )
109recnd 7948 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  A  e.  CC )
116, 8, 10addassd 7942 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  A )  =  ( x  +  ( C  +  A ) ) )
12 simpl2 996 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  B  e.  RR )
1312recnd 7948 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  B  e.  CC )
146, 8, 13addassd 7942 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  B )  =  ( x  +  ( C  +  B ) ) )
1511, 14eqeq12d 2185 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
( x  +  C
)  +  A )  =  ( ( x  +  C )  +  B )  <->  ( x  +  ( C  +  A ) )  =  ( x  +  ( C  +  B ) ) ) )
1615adantr 274 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
( ( x  +  C )  +  A
)  =  ( ( x  +  C )  +  B )  <->  ( x  +  ( C  +  A ) )  =  ( x  +  ( C  +  B ) ) ) )
174, 16mpbird 166 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
( x  +  C
)  +  A )  =  ( ( x  +  C )  +  B ) )
188adantr 274 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  C  e.  CC )
196adantr 274 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  x  e.  CC )
20 addcom 8056 . . . . . . . . 9  |-  ( ( C  e.  CC  /\  x  e.  CC )  ->  ( C  +  x
)  =  ( x  +  C ) )
2118, 19, 20syl2anc 409 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  ( C  +  x )  =  ( x  +  C ) )
22 simplrr 531 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  ( C  +  x )  =  0 )
2321, 22eqtr3d 2205 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
x  +  C )  =  0 )
2423oveq1d 5868 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
( x  +  C
)  +  A )  =  ( 0  +  A ) )
2510adantr 274 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  A  e.  CC )
26 addid2 8058 . . . . . . 7  |-  ( A  e.  CC  ->  (
0  +  A )  =  A )
2725, 26syl 14 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
0  +  A )  =  A )
2824, 27eqtrd 2203 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
( x  +  C
)  +  A )  =  A )
2923oveq1d 5868 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
( x  +  C
)  +  B )  =  ( 0  +  B ) )
3013adantr 274 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  B  e.  CC )
31 addid2 8058 . . . . . . 7  |-  ( B  e.  CC  ->  (
0  +  B )  =  B )
3230, 31syl 14 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
0  +  B )  =  B )
3329, 32eqtrd 2203 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  (
( x  +  C
)  +  B )  =  B )
3417, 28, 333eqtr3d 2211 . . . 4  |-  ( ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  (
x  e.  RR  /\  ( C  +  x
)  =  0 ) )  /\  ( C  +  A )  =  ( C  +  B
) )  ->  A  =  B )
3534ex 114 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( ( C  +  A )  =  ( C  +  B )  ->  A  =  B ) )
362, 35rexlimddv 2592 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( C  +  A
)  =  ( C  +  B )  ->  A  =  B )
)
37 oveq2 5861 . 2  |-  ( A  =  B  ->  ( C  +  A )  =  ( C  +  B ) )
3836, 37impbid1 141 1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( C  +  A
)  =  ( C  +  B )  <->  A  =  B ) )
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   RRcr 7773   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-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-i2m1 7879  ax-0id 7882  ax-rnegex 7883
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: (None)
  Copyright terms: Public domain W3C validator