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

Theorem axltadd 8864
Description: Ordering property of addition on reals. Axiom 20 of 22 for real and complex numbers, derived from ZF set theory. (This restates ax-pre-ltadd 8781 with ordering on the extended reals.) (Contributed by NM, 13-Oct-2005.)
Assertion
Ref Expression
axltadd  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  ->  ( C  +  A )  <  ( C  +  B
) ) )

Proof of Theorem axltadd
StepHypRef Expression
1 ax-pre-ltadd 8781 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <RR  B  ->  ( C  +  A )  <RR  ( C  +  B
) ) )
2 ltxrlt 8861 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  <  B  <->  A 
<RR  B ) )
323adant3 980 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  <  B  <->  A  <RR  B ) )
4 readdcl 8788 . . . . 5  |-  ( ( C  e.  RR  /\  A  e.  RR )  ->  ( C  +  A
)  e.  RR )
5 readdcl 8788 . . . . 5  |-  ( ( C  e.  RR  /\  B  e.  RR )  ->  ( C  +  B
)  e.  RR )
6 ltxrlt 8861 . . . . 5  |-  ( ( ( C  +  A
)  e.  RR  /\  ( C  +  B
)  e.  RR )  ->  ( ( C  +  A )  < 
( C  +  B
)  <->  ( C  +  A )  <RR  ( C  +  B ) ) )
74, 5, 6syl2an 465 . . . 4  |-  ( ( ( C  e.  RR  /\  A  e.  RR )  /\  ( C  e.  RR  /\  B  e.  RR ) )  -> 
( ( C  +  A )  <  ( C  +  B )  <->  ( C  +  A ) 
<RR  ( C  +  B
) ) )
873impdi 1242 . . 3  |-  ( ( C  e.  RR  /\  A  e.  RR  /\  B  e.  RR )  ->  (
( C  +  A
)  <  ( C  +  B )  <->  ( C  +  A )  <RR  ( C  +  B ) ) )
983coml 1163 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( C  +  A
)  <  ( C  +  B )  <->  ( C  +  A )  <RR  ( C  +  B ) ) )
101, 3, 93imtr4d 261 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 6    <-> wb 178    /\ wa 360    /\ w3a 939    e. wcel 1621   class class class wbr 3997  (class class class)co 5792   RRcr 8704    + caddc 8708    <RR cltrr 8709    < clt 8835
This theorem is referenced by:  ltadd2  8892  ltadd2i  8918  nnge1  9740  stoweidlem11  27095
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2239  ax-sep 4115  ax-nul 4123  ax-pow 4160  ax-pr 4186  ax-un 4484  ax-resscn 8762  ax-addrcl 8766  ax-pre-ltadd 8781
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2122  df-mo 2123  df-clab 2245  df-cleq 2251  df-clel 2254  df-nfc 2383  df-ne 2423  df-nel 2424  df-ral 2523  df-rex 2524  df-rab 2527  df-v 2765  df-sbc 2967  df-csb 3057  df-dif 3130  df-un 3132  df-in 3134  df-ss 3141  df-nul 3431  df-if 3540  df-pw 3601  df-sn 3620  df-pr 3621  df-op 3623  df-uni 3802  df-br 3998  df-opab 4052  df-mpt 4053  df-id 4281  df-xp 4675  df-rel 4676  df-cnv 4677  df-co 4678  df-dm 4679  df-rn 4680  df-res 4681  df-ima 4682  df-fun 4683  df-fn 4684  df-f 4685  df-f1 4686  df-fo 4687  df-f1o 4688  df-fv 4689  df-er 6628  df-en 6832  df-dom 6833  df-sdom 6834  df-pnf 8837  df-mnf 8838  df-ltxr 8840
  Copyright terms: Public domain W3C validator