Theorem axltadd 8395

Description: Ordering property of addition on reals. Axiom for real and complex numbers, derived from set theory. (This restates ax-pre-ltadd 8295 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

Step	Hyp	Ref	Expression
1		ax-pre-ltadd 8295	. 2 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <RR B -> ( C + A ) <RR ( C + B ) ) )
2		ltxrlt 8391	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( A < B <-> A <RR B ) )
3	2	3adant3 1048	. 2 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A < B <-> A <RR B ) )
4		readdcl 8305	. . . . 5 |- ( ( C e. RR /\ A e. RR ) -> ( C + A ) e. RR )
5		readdcl 8305	. . . . 5 |- ( ( C e. RR /\ B e. RR ) -> ( C + B ) e. RR )
6		ltxrlt 8391	. . . . 5 |- ( ( ( C + A ) e. RR /\ ( C + B ) e. RR ) -> ( ( C + A ) < ( C + B ) <-> ( C + A ) <RR ( C + B ) ) )
7	4, 5, 6	syl2an 289	. . . 4 |- ( ( ( C e. RR /\ A e. RR ) /\ ( C e. RR /\ B e. RR ) ) -> ( ( C + A ) < ( C + B ) <-> ( C + A ) <RR ( C + B ) ) )
8	7	3impdi 1334	. . 3 |- ( ( C e. RR /\ A e. RR /\ B e. RR ) -> ( ( C + A ) < ( C + B ) <-> ( C + A ) <RR ( C + B ) ) )
9	8	3coml 1241	. 2 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( C + A ) < ( C + B ) <-> ( C + A ) <RR ( C + B ) ) )
10	1, 3, 9	3imtr4d 203	1 |- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A < B -> ( C + A ) < ( C + B ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   RRcr 8178   + caddc 8182   <RR cltrr 8183   < clt 8360

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-addrcl 8276  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-xp 4780  df-pnf 8362  df-mnf 8363  df-ltxr 8365

This theorem is used by:  ltadd2  8747  nnge1  9327  ltoddhalfle  12660