MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  le2add Structured version   Visualization version   Unicode version

Theorem le2add 10510
Description: Adding both sides of two 'less than or equal to' relations. (Contributed by NM, 17-Apr-2005.) (Proof shortened by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
le2add  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( ( A  <_  C  /\  B  <_  D
)  ->  ( A  +  B )  <_  ( C  +  D )
) )

Proof of Theorem le2add
StepHypRef Expression
1 simpll 790 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  ->  A  e.  RR )
2 simprl 794 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  ->  C  e.  RR )
3 simplr 792 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  ->  B  e.  RR )
4 leadd1 10496 . . . 4  |-  ( ( A  e.  RR  /\  C  e.  RR  /\  B  e.  RR )  ->  ( A  <_  C  <->  ( A  +  B )  <_  ( C  +  B )
) )
51, 2, 3, 4syl3anc 1326 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( A  <_  C  <->  ( A  +  B )  <_  ( C  +  B ) ) )
6 simprr 796 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  ->  D  e.  RR )
7 leadd2 10497 . . . 4  |-  ( ( B  e.  RR  /\  D  e.  RR  /\  C  e.  RR )  ->  ( B  <_  D  <->  ( C  +  B )  <_  ( C  +  D )
) )
83, 6, 2, 7syl3anc 1326 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( B  <_  D  <->  ( C  +  B )  <_  ( C  +  D ) ) )
95, 8anbi12d 747 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( ( A  <_  C  /\  B  <_  D
)  <->  ( ( A  +  B )  <_ 
( C  +  B
)  /\  ( C  +  B )  <_  ( C  +  D )
) ) )
101, 3readdcld 10069 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( A  +  B
)  e.  RR )
112, 3readdcld 10069 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( C  +  B
)  e.  RR )
122, 6readdcld 10069 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( C  +  D
)  e.  RR )
13 letr 10131 . . 3  |-  ( ( ( A  +  B
)  e.  RR  /\  ( C  +  B
)  e.  RR  /\  ( C  +  D
)  e.  RR )  ->  ( ( ( A  +  B )  <_  ( C  +  B )  /\  ( C  +  B )  <_  ( C  +  D
) )  ->  ( A  +  B )  <_  ( C  +  D
) ) )
1410, 11, 12, 13syl3anc 1326 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( ( ( A  +  B )  <_ 
( C  +  B
)  /\  ( C  +  B )  <_  ( C  +  D )
)  ->  ( A  +  B )  <_  ( C  +  D )
) )
159, 14sylbid 230 1  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( ( A  <_  C  /\  B  <_  D
)  ->  ( A  +  B )  <_  ( C  +  D )
) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    e. wcel 1990   class class class wbr 4653  (class class class)co 6650   RRcr 9935    + caddc 9939    <_ cle 10075
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-po 5035  df-so 5036  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080
This theorem is referenced by:  addge0  10517  le2addi  10591  le2addd  10646  fzadd2  12376  swrdccatin2  13487  cshwcsh2id  13574  sqrlem7  13989  lo1add  14357  climcndslem1  14581  climcndslem2  14582  mdegmullem  23838  mumullem2  24906  pntrsumbnd2  25256  pntlemf  25294  crctcshwlkn0  26713  ubthlem2  27727  nmoptrii  28953  cdj3i  29300  itg2addnc  33464  jm2.26lem3  37568  gbegt5  41649  gbowgt5  41650  gboge9  41652
  Copyright terms: Public domain W3C validator