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

Theorem ltadd2 8366
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 8017 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  ->  ( C  +  A )  <  ( C  +  B
) ) )
2 ax-rnegex 7911 . . . 4  |-  ( C  e.  RR  ->  E. x  e.  RR  ( C  +  x )  =  0 )
323ad2ant3 1020 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  E. x  e.  RR  ( C  +  x )  =  0 )
4 simpl3 1002 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  C  e.  RR )
5 simpl1 1000 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  A  e.  RR )
64, 5readdcld 7977 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( C  +  A )  e.  RR )
7 simpl2 1001 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  B  e.  RR )
84, 7readdcld 7977 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( C  +  B )  e.  RR )
9 simprl 529 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  x  e.  RR )
10 axltadd 8017 . . . . . 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 1238 . . . . 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 7976 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  x  e.  CC )
134recnd 7976 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  C  e.  CC )
145recnd 7976 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  A  e.  CC )
1512, 13, 14addassd 7970 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  A )  =  ( x  +  ( C  +  A ) ) )
167recnd 7976 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  B  e.  CC )
1712, 13, 16addassd 7970 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  B )  =  ( x  +  ( C  +  B ) ) )
1815, 17breq12d 4013 . . . . 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 531 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( C  +  x )  =  0 )
21 addcom 8084 . . . . . . . . . 10  |-  ( ( C  e.  CC  /\  x  e.  CC )  ->  ( C  +  x
)  =  ( x  +  C ) )
2221eqeq1d 2186 . . . . . . . . 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 5884 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  A )  =  ( 0  +  A
) )
2614addid2d 8097 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( 0  +  A )  =  A )
2725, 26eqtrd 2210 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  A )  =  A )
2824oveq1d 5884 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  B )  =  ( 0  +  B
) )
2916addid2d 8097 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( 0  +  B )  =  B )
3028, 29eqtrd 2210 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  ( x  e.  RR  /\  ( C  +  x
)  =  0 ) )  ->  ( (
x  +  C )  +  B )  =  B )
3127, 30breq12d 4013 . . . 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 2599 . 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 978    = wceq 1353    e. wcel 2148   E.wrex 2456   class class class wbr 4000  (class class class)co 5869   CCcc 7800   RRcr 7801   0cc0 7802    + caddc 7805    < clt 7982
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-cnex 7893  ax-resscn 7894  ax-1cn 7895  ax-icn 7897  ax-addcl 7898  ax-addrcl 7899  ax-mulcl 7900  ax-addcom 7902  ax-addass 7904  ax-i2m1 7907  ax-0id 7910  ax-rnegex 7911  ax-pre-ltadd 7918
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-xp 4629  df-iota 5174  df-fv 5220  df-ov 5872  df-pnf 7984  df-mnf 7985  df-ltxr 7987
This theorem is referenced by:  ltadd2i  8367  ltadd2d  8368  ltaddneg  8371  ltadd1  8376  ltaddpos  8399  ltsub2  8406  ltaddsublt  8518  avglt1  9146  flqbi2  10277
  Copyright terms: Public domain W3C validator