P. 121 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 12001-12100   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	xrre2 12001	An extended real between two others is real. (Contributed by NM, 6-Feb-2007.)
|- ( ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) /\ ( A < B /\ B < C ) ) -> B e. RR )
Theorem	xrre3 12002	A way of proving that an extended real is real. (Contributed by FL, 29-May-2014.)
|- ( ( ( A e. RR* /\ B e. RR ) /\ ( B <_ A /\ A < +oo ) ) -> A e. RR )
Theorem	ge0gtmnf 12003	A nonnegative extended real is greater than negative infinity. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ 0 <_ A ) -> -oo < A )
Theorem	ge0nemnf 12004	A nonnegative extended real is greater than negative infinity. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ 0 <_ A ) -> A =/= -oo )
Theorem	xrrege0 12005	A nonnegative extended real that is less than a real bound is real. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( ( A e. RR* /\ B e. RR ) /\ ( 0 <_ A /\ A <_ B ) ) -> A e. RR )
Theorem	xrmax1 12006	An extended real is less than or equal to the maximum of it and another. (Contributed by NM, 7-Feb-2007.)
|- ( ( A e. RR* /\ B e. RR* ) -> A <_ if ( A <_ B , B , A ) )
Theorem	xrmax2 12007	An extended real is less than or equal to the maximum of it and another. (Contributed by NM, 7-Feb-2007.)
|- ( ( A e. RR* /\ B e. RR* ) -> B <_ if ( A <_ B , B , A ) )
Theorem	xrmin1 12008	The minimum of two extended reals is less than or equal to one of them. (Contributed by NM, 7-Feb-2007.)
|- ( ( A e. RR* /\ B e. RR* ) -> if ( A <_ B , A , B ) <_ A )
Theorem	xrmin2 12009	The minimum of two extended reals is less than or equal to one of them. (Contributed by NM, 7-Feb-2007.)
|- ( ( A e. RR* /\ B e. RR* ) -> if ( A <_ B , A , B ) <_ B )
Theorem	xrmaxeq 12010	The maximum of two extended reals is equal to the first if the first is bigger. (Contributed by Mario Carneiro, 25-Mar-2015.)
|- ( ( A e. RR* /\ B e. RR* /\ B <_ A ) -> if ( A <_ B , B , A ) = A )
Theorem	xrmineq 12011	The minimum of two extended reals is equal to the second if the first is bigger. (Contributed by Mario Carneiro, 25-Mar-2015.)
|- ( ( A e. RR* /\ B e. RR* /\ B <_ A ) -> if ( A <_ B , A , B ) = B )
Theorem	xrmaxlt 12012	Two ways of saying the maximum of two extended reals is less than a third. (Contributed by NM, 7-Feb-2007.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( if ( A <_ B , B , A ) < C <-> ( A < C /\ B < C ) ) )
Theorem	xrltmin 12013	Two ways of saying an extended real is less than the minimum of two others. (Contributed by NM, 7-Feb-2007.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( A < if ( B <_ C , B , C ) <-> ( A < B /\ A < C ) ) )
Theorem	xrmaxle 12014	Two ways of saying the maximum of two numbers is less than or equal to a third. (Contributed by Mario Carneiro, 18-Jun-2014.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( if ( A <_ B , B , A ) <_ C <-> ( A <_ C /\ B <_ C ) ) )
Theorem	xrlemin 12015	Two ways of saying a number is less than or equal to the minimum of two others. (Contributed by Mario Carneiro, 18-Jun-2014.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( A <_ if ( B <_ C , B , C ) <-> ( A <_ B /\ A <_ C ) ) )
Theorem	max1 12016	A number is less than or equal to the maximum of it and another. See also max1ALT 12017. (Contributed by NM, 3-Apr-2005.)
|- ( ( A e. RR /\ B e. RR ) -> A <_ if ( A <_ B , B , A ) )
Theorem	max1ALT 12017	A number is less than or equal to the maximum of it and another. This version of max1 12016 omits the B e. RR antecedent. Although it doesn't exploit undefined behavior, it is still considered poor style, and the use of max1 12016 is preferred. (Proof modification is discouraged.) (New usage is discouraged.) (Contributed by NM, 3-Apr-2005.)
|- ( A e. RR -> A <_ if ( A <_ B , B , A ) )
Theorem	max2 12018	A number is less than or equal to the maximum of it and another. (Contributed by NM, 3-Apr-2005.)
|- ( ( A e. RR /\ B e. RR ) -> B <_ if ( A <_ B , B , A ) )
Theorem	2resupmax 12019	The supremum of two real numbers is the maximum of these two numbers. (Contributed by AV, 8-Jun-2021.)
|- ( ( A e. RR /\ B e. RR ) -> sup ( { A , B } , RR , < ) = if ( A <_ B , B , A ) )
Theorem	min1 12020	The minimum of two numbers is less than or equal to the first. (Contributed by NM, 3-Aug-2007.)
|- ( ( A e. RR /\ B e. RR ) -> if ( A <_ B , A , B ) <_ A )
Theorem	min2 12021	The minimum of two numbers is less than or equal to the second. (Contributed by NM, 3-Aug-2007.)
|- ( ( A e. RR /\ B e. RR ) -> if ( A <_ B , A , B ) <_ B )
Theorem	maxle 12022	Two ways of saying the maximum of two numbers is less than or equal to a third. (Contributed by NM, 29-Sep-2005.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( if ( A <_ B , B , A ) <_ C <-> ( A <_ C /\ B <_ C ) ) )
Theorem	lemin 12023	Two ways of saying a number is less than or equal to the minimum of two others. (Contributed by NM, 3-Aug-2007.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A <_ if ( B <_ C , B , C ) <-> ( A <_ B /\ A <_ C ) ) )
Theorem	maxlt 12024	Two ways of saying the maximum of two numbers is less than a third. (Contributed by NM, 3-Aug-2007.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( if ( A <_ B , B , A ) < C <-> ( A < C /\ B < C ) ) )
Theorem	ltmin 12025	Two ways of saying a number is less than the minimum of two others. (Contributed by NM, 1-Sep-2006.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A < if ( B <_ C , B , C ) <-> ( A < B /\ A < C ) ) )
Theorem	lemaxle 12026	A real number which is less than or equal to a second real number is less than or equal to the maximum/supremum of the second real number and a third real number. (Contributed by AV, 8-Jun-2021.)
|- ( ( ( B e. RR /\ C e. RR ) /\ A e. RR /\ A <_ B ) -> A <_ if ( C <_ B , B , C ) )
Theorem	max0sub 12027	Decompose a real number into positive and negative parts. (Contributed by Mario Carneiro, 6-Aug-2014.)
|- ( A e. RR -> ( if ( 0 <_ A , A , 0 ) - if ( 0 <_ -u A , -u A , 0 ) ) = A )
Theorem	ifle 12028	An if statement transforms an implication into an inequality of terms. (Contributed by Mario Carneiro, 31-Aug-2014.)
|- ( ( ( A e. RR /\ B e. RR /\ B <_ A ) /\ ( ph -> ps ) ) -> if ( ph , A , B ) <_ if ( ps , A , B ) )
Theorem	z2ge 12029*	There exists an integer greater than or equal to any two others. (Contributed by NM, 28-Aug-2005.)
|- ( ( M e. ZZ /\ N e. ZZ ) -> E. k e. ZZ ( M <_ k /\ N <_ k ) )
Theorem	qbtwnre 12030*	The rational numbers are dense in RR: any two real numbers have a rational between them. Exercise 6 of [Apostol] p. 28. (Contributed by NM, 18-Nov-2004.) (Proof shortened by Mario Carneiro, 13-Jun-2014.)
|- ( ( A e. RR /\ B e. RR /\ A < B ) -> E. x e. QQ ( A < x /\ x < B ) )
Theorem	qbtwnxr 12031*	The rational numbers are dense in RR*: any two extended real numbers have a rational between them. (Contributed by NM, 6-Feb-2007.) (Proof shortened by Mario Carneiro, 23-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* /\ A < B ) -> E. x e. QQ ( A < x /\ x < B ) )
Theorem	qsqueeze 12032*	If a nonnegative real is less than any positive rational, it is zero. (Contributed by NM, 6-Feb-2007.)
|- ( ( A e. RR /\ 0 <_ A /\ A. x e. QQ ( 0 < x -> A < x ) ) -> A = 0 )
Theorem	qextltlem 12033*	Lemma for qextlt 12034 and qextle . (Contributed by Mario Carneiro, 3-Oct-2014.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A < B -> E. x e. QQ ( -. ( x < A <-> x < B ) /\ -. ( x <_ A <-> x <_ B ) ) ) )
Theorem	qextlt 12034*	An extensionality-like property for extended real ordering. (Contributed by Mario Carneiro, 3-Oct-2014.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A = B <-> A. x e. QQ ( x < A <-> x < B ) ) )
Theorem	qextle 12035*	An extensionality-like property for extended real ordering. (Contributed by Mario Carneiro, 3-Oct-2014.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A = B <-> A. x e. QQ ( x <_ A <-> x <_ B ) ) )
Theorem	xralrple 12036*	Show that A is less than B by showing that there is no positive bound on the difference. (Contributed by Mario Carneiro, 12-Jun-2014.)
|- ( ( A e. RR* /\ B e. RR ) -> ( A <_ B <-> A. x e. RR+ A <_ ( B + x ) ) )
Theorem	alrple 12037*	Show that A is less than B by showing that there is no positive bound on the difference. (Contributed by Mario Carneiro, 12-Jun-2014.)
|- ( ( A e. RR /\ B e. RR ) -> ( A <_ B <-> A. x e. RR+ A <_ ( B + x ) ) )
Theorem	xnegeq 12038	Equality of two extended numbers with -e in front of them. (Contributed by FL, 26-Dec-2011.) (Proof shortened by Mario Carneiro, 20-Aug-2015.)
|- ( A = B -> -e A = -e B )
Theorem	xnegex 12039	A negative extended real exists as a set. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- -e A e. _V
Theorem	xnegpnf 12040	Minus +oo. Remark of [BourbakiTop1] p. IV.15. (Contributed by FL, 26-Dec-2011.)
|- -e +oo = -oo
Theorem	xnegmnf 12041	Minus -oo. Remark of [BourbakiTop1] p. IV.15. (Contributed by FL, 26-Dec-2011.) (Revised by Mario Carneiro, 20-Aug-2015.)
|- -e -oo = +oo
Theorem	rexneg 12042	Minus a real number. Remark [BourbakiTop1] p. IV.15. (Contributed by FL, 26-Dec-2011.) (Proof shortened by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR -> -e A = -u A )
Theorem	xneg0 12043	The negative of zero. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- -e 0 = 0
Theorem	xnegcl 12044	Closure of extended real negative. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR* -> -e A e. RR* )
Theorem	xnegneg 12045	Extended real version of negneg 10331. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR* -> -e -e A = A )
Theorem	xneg11 12046	Extended real version of neg11 10332. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( -e A = -e B <-> A = B ) )
Theorem	xltnegi 12047	Forward direction of xltneg 12048. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* /\ A < B ) -> -e B < -e A )
Theorem	xltneg 12048	Extended real version of ltneg 10528. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A < B <-> -e B < -e A ) )
Theorem	xleneg 12049	Extended real version of leneg 10531. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A <_ B <-> -e B <_ -e A ) )
Theorem	xlt0neg1 12050	Extended real version of lt0neg1 10534. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR* -> ( A < 0 <-> 0 < -e A ) )
Theorem	xlt0neg2 12051	Extended real version of lt0neg2 10535. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR* -> ( 0 < A <-> -e A < 0 ) )
Theorem	xle0neg1 12052	Extended real version of le0neg1 10536. (Contributed by Mario Carneiro, 9-Sep-2015.)
|- ( A e. RR* -> ( A <_ 0 <-> 0 <_ -e A ) )
Theorem	xle0neg2 12053	Extended real version of le0neg2 10537. (Contributed by Mario Carneiro, 9-Sep-2015.)
|- ( A e. RR* -> ( 0 <_ A <-> -e A <_ 0 ) )
Theorem	xaddval 12054	Value of the extended real addition operation. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A +e B ) = if ( A = +oo , if ( B = -oo , 0 , +oo ) , if ( A = -oo , if ( B = +oo , 0 , -oo ) , if ( B = +oo , +oo , if ( B = -oo , -oo , ( A + B ) ) ) ) ) )
Theorem	xaddf 12055	The extended real addition operation is closed in extended reals. (Contributed by Mario Carneiro, 21-Aug-2015.)
|- +e : ( RR* X. RR* ) --> RR*
Theorem	xmulval 12056	Value of the extended real multiplication operation. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A xe B ) = if ( ( A = 0 \/ B = 0 ) , 0 , if ( ( ( ( 0 < B /\ A = +oo ) \/ ( B < 0 /\ A = -oo ) ) \/ ( ( 0 < A /\ B = +oo ) \/ ( A < 0 /\ B = -oo ) ) ) , +oo , if ( ( ( ( 0 < B /\ A = -oo ) \/ ( B < 0 /\ A = +oo ) ) \/ ( ( 0 < A /\ B = -oo ) \/ ( A < 0 /\ B = +oo ) ) ) , -oo , ( A x. B ) ) ) ) )
Theorem	xaddpnf1 12057	Addition of positive infinity on the right. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ A =/= -oo ) -> ( A +e +oo ) = +oo )
Theorem	xaddpnf2 12058	Addition of positive infinity on the left. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ A =/= -oo ) -> ( +oo +e A ) = +oo )
Theorem	xaddmnf1 12059	Addition of negative infinity on the right. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ A =/= +oo ) -> ( A +e -oo ) = -oo )
Theorem	xaddmnf2 12060	Addition of negative infinity on the left. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ A =/= +oo ) -> ( -oo +e A ) = -oo )
Theorem	pnfaddmnf 12061	Addition of positive and negative infinity. This is often taken to be a "null" value or out of the domain, but we define it (somewhat arbitrarily) to be zero so that the resulting function is total, which simplifies proofs. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( +oo +e -oo ) = 0
Theorem	mnfaddpnf 12062	Addition of negative and positive infinity. This is often taken to be a "null" value or out of the domain, but we define it (somewhat arbitrarily) to be zero so that the resulting function is total, which simplifies proofs. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( -oo +e +oo ) = 0
Theorem	rexadd 12063	The extended real addition operation when both arguments are real. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR /\ B e. RR ) -> ( A +e B ) = ( A + B ) )
Theorem	rexsub 12064	Extended real subtraction when both arguments are real. (Contributed by Mario Carneiro, 23-Aug-2015.)
|- ( ( A e. RR /\ B e. RR ) -> ( A +e -e B ) = ( A - B ) )
Theorem	rexaddd 12065	The extended real addition operation when both arguments are real. Deduction version of rexadd 12063. (Contributed by Glauco Siliprandi, 24-Dec-2020.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   =>    |- ( ph -> ( A +e B ) = ( A + B ) )
Theorem	xnn0xaddcl 12066	The extended nonnegative integers are closed under extended addition. (Contributed by AV, 10-Dec-2020.)
|- ( ( A e. NN0* /\ B e. NN0* ) -> ( A +e B ) e. NN0* )
Theorem	xaddnemnf 12067	Closure of extended real addition in the subset RR* / { -oo }. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( ( A e. RR* /\ A =/= -oo ) /\ ( B e. RR* /\ B =/= -oo ) ) -> ( A +e B ) =/= -oo )
Theorem	xaddnepnf 12068	Closure of extended real addition in the subset RR* / { +oo }. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( ( A e. RR* /\ A =/= +oo ) /\ ( B e. RR* /\ B =/= +oo ) ) -> ( A +e B ) =/= +oo )
Theorem	xnegid 12069	Extended real version of negid 10328. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR* -> ( A +e -e A ) = 0 )
Theorem	xaddcl 12070	The extended real addition operation is closed in extended reals. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A +e B ) e. RR* )
Theorem	xaddcom 12071	The extended real addition operation is commutative. (Contributed by NM, 26-Dec-2011.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A +e B ) = ( B +e A ) )
Theorem	xaddid1 12072	Extended real version of addid1 10216. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR* -> ( A +e 0 ) = A )
Theorem	xaddid2 12073	Extended real version of addid2 10219. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR* -> ( 0 +e A ) = A )
Theorem	xaddid1d 12074	0 is a right identity for extended real addition. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
|- ( ph -> A e. RR* )   =>    |- ( ph -> ( A +e 0 ) = A )
Theorem	xnn0lenn0nn0 12075	An extended nonnegative integer which is less than or equal to a nonnegative integer is a nonnegative integer. (Contributed by AV, 24-Nov-2021.)
|- ( ( M e. NN0* /\ N e. NN0 /\ M <_ N ) -> M e. NN0 )
Theorem	xnn0le2is012 12076	An extended nonnegative integer which is less than or equal to 2 is either 0 or 1 or 2. (Contributed by AV, 24-Nov-2021.)
|- ( ( N e. NN0* /\ N <_ 2 ) -> ( N = 0 \/ N = 1 \/ N = 2 ) )
Theorem	xnn0xadd0 12077	The sum of two extended nonnegative integers is 0 iff each of the two extended nonnegative integers is 0. (Contributed by AV, 14-Dec-2020.)
|- ( ( A e. NN0* /\ B e. NN0* ) -> ( ( A +e B ) = 0 <-> ( A = 0 /\ B = 0 ) ) )
Theorem	xnegdi 12078	Extended real version of xnegdi 12078. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> -e ( A +e B ) = ( -e A +e -e B ) )
Theorem	xaddass 12079	Associativity of extended real addition. The correct condition here is "it is not the case that both +oo and -oo appear as one of A , B , C, i.e. -. { +oo , -oo } C_ { A , B , C }", but this condition is difficult to work with, so we break the theorem into two parts: this one, where -oo is not present in A , B , C, and xaddass2 12080, where +oo is not present. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( ( A e. RR* /\ A =/= -oo ) /\ ( B e. RR* /\ B =/= -oo ) /\ ( C e. RR* /\ C =/= -oo ) ) -> ( ( A +e B ) +e C ) = ( A +e ( B +e C ) ) )
Theorem	xaddass2 12080	Associativity of extended real addition. See xaddass 12079 for notes on the hypotheses. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( ( A e. RR* /\ A =/= +oo ) /\ ( B e. RR* /\ B =/= +oo ) /\ ( C e. RR* /\ C =/= +oo ) ) -> ( ( A +e B ) +e C ) = ( A +e ( B +e C ) ) )
Theorem	xpncan 12081	Extended real version of pncan 10287. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR ) -> ( ( A +e B ) +e -e B ) = A )
Theorem	xnpcan 12082	Extended real version of npcan 10290. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR ) -> ( ( A +e -e B ) +e B ) = A )
Theorem	xleadd1a 12083	Extended real version of leadd1 10496; note that the converse implication is not true, unlike the real version (for example 0 < 1 but ( 1 +e +oo ) <_ ( 0 +e +oo )). (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) /\ A <_ B ) -> ( A +e C ) <_ ( B +e C ) )
Theorem	xleadd2a 12084	Commuted form of xleadd1a 12083. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) /\ A <_ B ) -> ( C +e A ) <_ ( C +e B ) )
Theorem	xleadd1 12085	Weakened version of xleadd1a 12083 under which the reverse implication is true. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR ) -> ( A <_ B <-> ( A +e C ) <_ ( B +e C ) ) )
Theorem	xltadd1 12086	Extended real version of ltadd1 10495. (Contributed by Mario Carneiro, 23-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR ) -> ( A < B <-> ( A +e C ) < ( B +e C ) ) )
Theorem	xltadd2 12087	Extended real version of ltadd2 10141. (Contributed by Mario Carneiro, 23-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR ) -> ( A < B <-> ( C +e A ) < ( C +e B ) ) )
Theorem	xaddge0 12088	The sum of nonnegative extended reals is nonnegative. (Contributed by Mario Carneiro, 21-Aug-2015.)
|- ( ( ( A e. RR* /\ B e. RR* ) /\ ( 0 <_ A /\ 0 <_ B ) ) -> 0 <_ ( A +e B ) )
Theorem	xle2add 12089	Extended real version of le2add 10510. (Contributed by Mario Carneiro, 23-Aug-2015.)
|- ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) -> ( ( A <_ C /\ B <_ D ) -> ( A +e B ) <_ ( C +e D ) ) )
Theorem	xlt2add 12090	Extended real version of lt2add 10513. Note that ltleadd 10511, which has weaker assumptions, is not true for the extended reals (since 0 + +oo < 1 + +oo fails). (Contributed by Mario Carneiro, 23-Aug-2015.)
|- ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) -> ( ( A < C /\ B < D ) -> ( A +e B ) < ( C +e D ) ) )
Theorem	xsubge0 12091	Extended real version of subge0 10541. (Contributed by Mario Carneiro, 24-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( 0 <_ ( A +e -e B ) <-> B <_ A ) )
Theorem	xposdif 12092	Extended real version of posdif 10521. (Contributed by Mario Carneiro, 24-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A < B <-> 0 < ( B +e -e A ) ) )
Theorem	xlesubadd 12093	Under certain conditions, the conclusion of lesubadd 10500 is true even in the extended reals. (Contributed by Mario Carneiro, 4-Sep-2015.)
|- ( ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) /\ ( 0 <_ A /\ B =/= -oo /\ 0 <_ C ) ) -> ( ( A +e -e B ) <_ C <-> A <_ ( C +e B ) ) )
Theorem	xmullem 12094	Lemma for rexmul 12101. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( ( ( ( A e. RR* /\ B e. RR* ) /\ -. ( A = 0 \/ B = 0 ) ) /\ -. ( ( ( 0 < B /\ A = +oo ) \/ ( B < 0 /\ A = -oo ) ) \/ ( ( 0 < A /\ B = +oo ) \/ ( A < 0 /\ B = -oo ) ) ) ) /\ -. ( ( ( 0 < B /\ A = -oo ) \/ ( B < 0 /\ A = +oo ) ) \/ ( ( 0 < A /\ B = -oo ) \/ ( A < 0 /\ B = +oo ) ) ) ) -> A e. RR )
Theorem	xmullem2 12095	Lemma for xmulneg1 12099. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( ( ( ( 0 < B /\ A = +oo ) \/ ( B < 0 /\ A = -oo ) ) \/ ( ( 0 < A /\ B = +oo ) \/ ( A < 0 /\ B = -oo ) ) ) -> -. ( ( ( 0 < B /\ A = -oo ) \/ ( B < 0 /\ A = +oo ) ) \/ ( ( 0 < A /\ B = -oo ) \/ ( A < 0 /\ B = +oo ) ) ) ) )
Theorem	xmulcom 12096	Extended real multiplication is commutative. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A xe B ) = ( B xe A ) )
Theorem	xmul01 12097	Extended real version of mul01 10215. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR* -> ( A xe 0 ) = 0 )
Theorem	xmul02 12098	Extended real version of mul02 10214. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( A e. RR* -> ( 0 xe A ) = 0 )
Theorem	xmulneg1 12099	Extended real version of mulneg1 10466. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( -e A xe B ) = -e ( A xe B ) )
Theorem	xmulneg2 12100	Extended real version of mulneg2 10467. (Contributed by Mario Carneiro, 20-Aug-2015.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A xe -e B ) = -e ( A xe B ) )