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

Theorem ltleadd 10035
Description: Adding both sides of two orderings. (Contributed by NM, 23-Dec-2007.)
Assertion
Ref Expression
ltleadd  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( ( A  < 
C  /\  B  <_  D )  ->  ( A  +  B )  <  ( C  +  D )
) )

Proof of Theorem ltleadd
StepHypRef Expression
1 ltadd1 10019 . . . . . 6  |-  ( ( A  e.  RR  /\  C  e.  RR  /\  B  e.  RR )  ->  ( A  <  C  <->  ( A  +  B )  <  ( C  +  B )
) )
213com23 1202 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  C  <->  ( A  +  B )  <  ( C  +  B )
) )
323expa 1196 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  C  e.  RR )  ->  ( A  < 
C  <->  ( A  +  B )  <  ( C  +  B )
) )
43adantrr 716 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( A  <  C  <->  ( A  +  B )  <  ( C  +  B ) ) )
5 leadd2 10021 . . . . . 6  |-  ( ( B  e.  RR  /\  D  e.  RR  /\  C  e.  RR )  ->  ( B  <_  D  <->  ( C  +  B )  <_  ( C  +  D )
) )
653com23 1202 . . . . 5  |-  ( ( B  e.  RR  /\  C  e.  RR  /\  D  e.  RR )  ->  ( B  <_  D  <->  ( C  +  B )  <_  ( C  +  D )
) )
763expb 1197 . . . 4  |-  ( ( B  e.  RR  /\  ( C  e.  RR  /\  D  e.  RR ) )  ->  ( B  <_  D  <->  ( C  +  B )  <_  ( C  +  D )
) )
87adantll 713 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( B  <_  D  <->  ( C  +  B )  <_  ( C  +  D ) ) )
94, 8anbi12d 710 . 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 )
) ) )
10 readdcl 9575 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  +  B
)  e.  RR )
1110adantr 465 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( A  +  B
)  e.  RR )
12 readdcl 9575 . . . . 5  |-  ( ( C  e.  RR  /\  B  e.  RR )  ->  ( C  +  B
)  e.  RR )
1312ancoms 453 . . . 4  |-  ( ( B  e.  RR  /\  C  e.  RR )  ->  ( C  +  B
)  e.  RR )
1413ad2ant2lr 747 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( C  +  B
)  e.  RR )
15 readdcl 9575 . . . 4  |-  ( ( C  e.  RR  /\  D  e.  RR )  ->  ( C  +  D
)  e.  RR )
1615adantl 466 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  D  e.  RR ) )  -> 
( C  +  D
)  e.  RR )
17 ltletr 9676 . . 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
) ) )
1811, 14, 16, 17syl3anc 1228 . 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 )
) )
199, 18sylbid 215 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 184    /\ wa 369    e. wcel 1767   class class class wbr 4447  (class class class)co 6284   RRcr 9491    + caddc 9495    < clt 9628    <_ cle 9629
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pow 4625  ax-pr 4686  ax-un 6576  ax-resscn 9549  ax-1cn 9550  ax-icn 9551  ax-addcl 9552  ax-addrcl 9553  ax-mulcl 9554  ax-mulrcl 9555  ax-mulcom 9556  ax-addass 9557  ax-mulass 9558  ax-distr 9559  ax-i2m1 9560  ax-1ne0 9561  ax-1rid 9562  ax-rnegex 9563  ax-rrecex 9564  ax-cnre 9565  ax-pre-lttri 9566  ax-pre-lttrn 9567  ax-pre-ltadd 9568
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-nel 2665  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-sbc 3332  df-csb 3436  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-pw 4012  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-opab 4506  df-mpt 4507  df-id 4795  df-po 4800  df-so 4801  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-res 5011  df-ima 5012  df-iota 5551  df-fun 5590  df-fn 5591  df-f 5592  df-f1 5593  df-fo 5594  df-f1o 5595  df-fv 5596  df-ov 6287  df-er 7311  df-en 7517  df-dom 7518  df-sdom 7519  df-pnf 9630  df-mnf 9631  df-xr 9632  df-ltxr 9633  df-le 9634
This theorem is referenced by:  leltadd  10036  addgtge0  10040  ltleaddd  10172  modaddmodup  12018  blcvx  21066
  Copyright terms: Public domain W3C validator