ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  readdcan Unicode version
Theorem readdcan 8211
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 8033 . . . 4 |- ( C e. RR -> E. x e. RR ( C + x ) = 0 )
213ad2ant3 1022 . . 3 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> E. x e. RR ( C + x ) = 0 )
3 oveq2 5951 . . . . . . 7 |- ( ( C + A ) = ( C + B ) -> ( x + ( C + A ) ) = ( x + ( C + B ) ) )
43adantl 277 . . . . . 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 529 . . . . . . . . . 10 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> x e. RR )
65recnd 8100 . . . . . . . . 9 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> x e. CC )
7 simpl3 1004 . . . . . . . . . 10 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> C e. RR )
87recnd 8100 . . . . . . . . 9 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> C e. CC )
9 simpl1 1002 . . . . . . . . . 10 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> A e. RR )
109recnd 8100 . . . . . . . . 9 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> A e. CC )
116, 8, 10addassd 8094 . . . . . . . 8 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> ( ( x + C ) + A ) = ( x + ( C + A ) ) )
12 simpl2 1003 . . . . . . . . . 10 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> B e. RR )
1312recnd 8100 . . . . . . . . 9 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> B e. CC )
146, 8, 13addassd 8094 . . . . . . . 8 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> ( ( x + C ) + B ) = ( x + ( C + B ) ) )
1511, 14eqeq12d 2219 . . . . . . 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 276 . . . . . 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 167 . . . . 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 276 . . . . . . . . 9 |- ( ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) /\ ( C + A ) = ( C + B ) ) -> C e. CC )
196adantr 276 . . . . . . . . 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 8208 . . . . . . . . 9 |- ( ( C e. CC /\ x e. CC ) -> ( C + x ) = ( x + C ) )
2118, 19, 20syl2anc 411 . . . . . . . 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 536 . . . . . . . 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 2239 . . . . . . 7 |- ( ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) /\ ( C + A ) = ( C + B ) ) -> ( x + C ) = 0 )
2423oveq1d 5958 . . . . . 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 276 . . . . . . 7 |- ( ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) /\ ( C + A ) = ( C + B ) ) -> A e. CC )
26 addlid 8210 . . . . . . 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 2237 . . . . 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 5958 . . . . . 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 276 . . . . . . 7 |- ( ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) /\ ( C + A ) = ( C + B ) ) -> B e. CC )
31 addlid 8210 . . . . . . 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 2237 . . . . 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 2245 . . . 4 |- ( ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) /\ ( C + A ) = ( C + B ) ) -> A = B )
3534ex 115 . . 3 |- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( x e. RR /\ ( C + x ) = 0 ) ) -> ( ( C + A ) = ( C + B ) -> A = B ) )
362, 35rexlimddv 2627 . 2 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( C + A ) = ( C + B ) -> A = B ) )
37 oveq2 5951 . 2 |- ( A = B -> ( C + A ) = ( C + B ) )
3836, 37impbid1 142 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 104   <-> wb 105   /\ w3a 980   = wceq 1372   e. wcel 2175   E.wrex 2484  (class class class)co 5943   CCcc 7922   RRcr 7923   0cc0 7924   + caddc 7927
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186  ax-resscn 8016  ax-1cn 8017  ax-icn 8019  ax-addcl 8020  ax-mulcl 8022  ax-addcom 8024  ax-addass 8026  ax-i2m1 8029  ax-0id 8032  ax-rnegex 8033
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-un 3169  df-in 3171  df-ss 3178  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-iota 5231  df-fv 5278  df-ov 5946
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator