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

Theorem ltadd2 8658
Description: Addition to both sides of 'less than'. (Contributed by NM, 12-Nov-1999.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
ltadd2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  <->  ( C  +  A )  <  ( C  +  B )
) )

Proof of Theorem ltadd2
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 axltadd 8308 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  ->  ( C  +  A )  <  ( C  +  B
) ) )
2 ax-rnegex 8201 . . . 4  |-  ( C  e.  RR  ->  E. x  e.  RR  ( C  +  x )  =  0 )
323ad2ant3 1047 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  E. x  e.  RR  ( C  +  x )  =  0 )
4 simpl3 1029 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  C  e.  RR )
5 simpl1 1027 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  A  e.  RR )
64, 5readdcld 8268 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( C  +  A )  e.  RR )
7 simpl2 1028 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  B  e.  RR )
84, 7readdcld 8268 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( C  +  B )  e.  RR )
9 simprl 531 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  x  e.  RR )
10 axltadd 8308 . . . . . 6  |-  ( ( ( C  +  A
)  e.  RR  /\  ( C  +  B
)  e.  RR  /\  x  e.  RR )  ->  ( ( C  +  A )  <  ( C  +  B )  ->  ( x  +  ( C  +  A ) )  <  ( x  +  ( C  +  B ) ) ) )
116, 8, 9, 10syl3anc 1274 . . . . 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 ) ) ) )
129recnd 8267 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  x  e.  CC )
134recnd 8267 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  C  e.  CC )
145recnd 8267 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  A  e.  CC )
1512, 13, 14addassd 8261 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  A )  =  ( x  +  ( C  +  A ) ) )
167recnd 8267 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  B  e.  CC )
1712, 13, 16addassd 8261 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  B )  =  ( x  +  ( C  +  B ) ) )
1815, 17breq12d 4106 . . . . 5  |-  ( ( ( 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 ) ) ) )
1911, 18sylibrd 169 . . . 4  |-  ( ( ( 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
) ) )
20 simprr 533 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( C  +  x )  =  0 )
21 addcom 8375 . . . . . . . . . 10  |-  ( ( C  e.  CC  /\  x  e.  CC )  ->  ( C  +  x
)  =  ( x  +  C ) )
2221eqeq1d 2240 . . . . . . . . 9  |-  ( ( C  e.  CC  /\  x  e.  CC )  ->  ( ( C  +  x )  =  0  <-> 
( x  +  C
)  =  0 ) )
2313, 12, 22syl2anc 411 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( ( C  +  x )  =  0  <->  ( x  +  C )  =  0 ) )
2420, 23mpbid 147 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( x  +  C )  =  0 )
2524oveq1d 6043 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  A )  =  ( 0  +  A
) )
2614addlidd 8388 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( 0  +  A )  =  A )
2725, 26eqtrd 2264 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  A )  =  A )
2824oveq1d 6043 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  B )  =  ( 0  +  B
) )
2916addlidd 8388 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( 0  +  B )  =  B )
3028, 29eqtrd 2264 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  B )  =  B )
3127, 30breq12d 4106 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
( x  +  C
)  +  A )  <  ( ( x  +  C )  +  B )  <->  A  <  B ) )
3219, 31sylibd 149 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( ( C  +  A )  <  ( C  +  B
)  ->  A  <  B ) )
333, 32rexlimddv 2656 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( C  +  A
)  <  ( C  +  B )  ->  A  <  B ) )
341, 33impbid 129 1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  <->  ( C  +  A )  <  ( C  +  B )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2202   E.wrex 2512   class class class wbr 4093  (class class class)co 6028   CCcc 8090   RRcr 8091   0cc0 8092    + caddc 8095    < clt 8273
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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-i2m1 8197  ax-0id 8200  ax-rnegex 8201  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-xp 4737  df-iota 5293  df-fv 5341  df-ov 6031  df-pnf 8275  df-mnf 8276  df-ltxr 8278
This theorem is referenced by:  ltadd2i  8659  ltadd2d  8660  ltaddneg  8663  ltadd1  8668  ltaddpos  8691  ltsub2  8698  ltaddsublt  8810  avglt1  9442  flqbi2  10614
  Copyright terms: Public domain W3C validator