P. 112 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 11101-11200   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	sqrtgt0d 11101	The square root of a positive real is positive. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR+ )   =>    |- ( ph -> 0 < ( sqr ` A ) )
Theorem	absnidd 11102	A negative number is the negative of its own absolute value. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> A <_ 0 )   =>    |- ( ph -> ( abs ` A ) = -u A )
Theorem	leabsd 11103	A real number is less than or equal to its absolute value. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   =>    |- ( ph -> A <_ ( abs ` A ) )
Theorem	absred 11104	Absolute value of a real number. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   =>    |- ( ph -> ( abs ` A ) = ( sqr ` ( A ^ 2 ) ) )
Theorem	resqrtcld 11105	The square root of a nonnegative real is a real. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   =>    |- ( ph -> ( sqr ` A ) e. RR )
Theorem	sqrtmsqd 11106	Square root of square. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   =>    |- ( ph -> ( sqr ` ( A x. A ) ) = A )
Theorem	sqrtsqd 11107	Square root of square. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   =>    |- ( ph -> ( sqr ` ( A ^ 2 ) ) = A )
Theorem	sqrtge0d 11108	The square root of a nonnegative real is nonnegative. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   =>    |- ( ph -> 0 <_ ( sqr ` A ) )
Theorem	absidd 11109	A nonnegative number is its own absolute value. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   =>    |- ( ph -> ( abs ` A ) = A )
Theorem	sqrtdivd 11110	Square root distributes over division. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> B e. RR+ )   =>    |- ( ph -> ( sqr ` ( A / B ) ) = ( ( sqr ` A ) / ( sqr ` B ) ) )
Theorem	sqrtmuld 11111	Square root distributes over multiplication. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> B e. RR )   &    |- ( ph -> 0 <_ B )   =>    |- ( ph -> ( sqr ` ( A x. B ) ) = ( ( sqr ` A ) x. ( sqr ` B ) ) )
Theorem	sqrtsq2d 11112	Relationship between square root and squares. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> B e. RR )   &    |- ( ph -> 0 <_ B )   =>    |- ( ph -> ( ( sqr ` A ) = B <-> A = ( B ^ 2 ) ) )
Theorem	sqrtled 11113	Square root is monotonic. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> B e. RR )   &    |- ( ph -> 0 <_ B )   =>    |- ( ph -> ( A <_ B <-> ( sqr ` A ) <_ ( sqr ` B ) ) )
Theorem	sqrtltd 11114	Square root is strictly monotonic. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> B e. RR )   &    |- ( ph -> 0 <_ B )   =>    |- ( ph -> ( A < B <-> ( sqr ` A ) < ( sqr ` B ) ) )
Theorem	sqr11d 11115	The square root function is one-to-one. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> B e. RR )   &    |- ( ph -> 0 <_ B )   &    |- ( ph -> ( sqr ` A ) = ( sqr ` B ) )   =>    |- ( ph -> A = B )
Theorem	absltd 11116	Absolute value and 'less than' relation. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   =>    |- ( ph -> ( ( abs ` A ) < B <-> ( -u B < A /\ A < B ) ) )
Theorem	absled 11117	Absolute value and 'less than or equal to' relation. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   =>    |- ( ph -> ( ( abs ` A ) <_ B <-> ( -u B <_ A /\ A <_ B ) ) )
Theorem	abssubge0d 11118	Absolute value of a nonnegative difference. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> A <_ B )   =>    |- ( ph -> ( abs ` ( B - A ) ) = ( B - A ) )
Theorem	abssuble0d 11119	Absolute value of a nonpositive difference. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> A <_ B )   =>    |- ( ph -> ( abs ` ( A - B ) ) = ( B - A ) )
Theorem	absdifltd 11120	The absolute value of a difference and 'less than' relation. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   =>    |- ( ph -> ( ( abs ` ( A - B ) ) < C <-> ( ( B - C ) < A /\ A < ( B + C ) ) ) )
Theorem	absdifled 11121	The absolute value of a difference and 'less than or equal to' relation. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   =>    |- ( ph -> ( ( abs ` ( A - B ) ) <_ C <-> ( ( B - C ) <_ A /\ A <_ ( B + C ) ) ) )
Theorem	icodiamlt 11122	Two elements in a half-open interval have separation strictly less than the difference between the endpoints. (Contributed by Stefan O'Rear, 12-Sep-2014.)
|- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. ( A [,) B ) /\ D e. ( A [,) B ) ) ) -> ( abs ` ( C - D ) ) < ( B - A ) )
Theorem	abscld 11123	Real closure of absolute value. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( abs ` A ) e. RR )
Theorem	absvalsqd 11124	Square of value of absolute value function. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( ( abs ` A ) ^ 2 ) = ( A x. ( * ` A ) ) )
Theorem	absvalsq2d 11125	Square of value of absolute value function. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( ( abs ` A ) ^ 2 ) = ( ( ( Re ` A ) ^ 2 ) + ( ( Im ` A ) ^ 2 ) ) )
Theorem	absge0d 11126	Absolute value is nonnegative. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> 0 <_ ( abs ` A ) )
Theorem	absval2d 11127	Value of absolute value function. Definition 10.36 of [Gleason] p. 133. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( abs ` A ) = ( sqr ` ( ( ( Re ` A ) ^ 2 ) + ( ( Im ` A ) ^ 2 ) ) ) )
Theorem	abs00d 11128	The absolute value of a number is zero iff the number is zero. Proposition 10-3.7(c) of [Gleason] p. 133. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> ( abs ` A ) = 0 )   =>    |- ( ph -> A = 0 )
Theorem	absne0d 11129	The absolute value of a number is zero iff the number is zero. Proposition 10-3.7(c) of [Gleason] p. 133. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> A =/= 0 )   =>    |- ( ph -> ( abs ` A ) =/= 0 )
Theorem	absrpclapd 11130	The absolute value of a complex number apart from zero is a positive real. (Contributed by Jim Kingdon, 13-Aug-2021.)
|- ( ph -> A e. CC )   &    |- ( ph -> A # 0 )   =>    |- ( ph -> ( abs ` A ) e. RR+ )
Theorem	absnegd 11131	Absolute value of negative. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( abs ` -u A ) = ( abs ` A ) )
Theorem	abscjd 11132	The absolute value of a number and its conjugate are the same. Proposition 10-3.7(b) of [Gleason] p. 133. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( abs ` ( * ` A ) ) = ( abs ` A ) )
Theorem	releabsd 11133	The real part of a number is less than or equal to its absolute value. Proposition 10-3.7(d) of [Gleason] p. 133. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( Re ` A ) <_ ( abs ` A ) )
Theorem	absexpd 11134	Absolute value of positive integer exponentiation. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> N e. NN0 )   =>    |- ( ph -> ( abs ` ( A ^ N ) ) = ( ( abs ` A ) ^ N ) )
Theorem	abssubd 11135	Swapping order of subtraction doesn't change the absolute value. Example of [Apostol] p. 363. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( abs ` ( A - B ) ) = ( abs ` ( B - A ) ) )
Theorem	absmuld 11136	Absolute value distributes over multiplication. Proposition 10-3.7(f) of [Gleason] p. 133. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( abs ` ( A x. B ) ) = ( ( abs ` A ) x. ( abs ` B ) ) )
Theorem	absdivapd 11137	Absolute value distributes over division. (Contributed by Jim Kingdon, 13-Aug-2021.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> B # 0 )   =>    |- ( ph -> ( abs ` ( A / B ) ) = ( ( abs ` A ) / ( abs ` B ) ) )
Theorem	abstrid 11138	Triangle inequality for absolute value. Proposition 10-3.7(h) of [Gleason] p. 133. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( abs ` ( A + B ) ) <_ ( ( abs ` A ) + ( abs ` B ) ) )
Theorem	abs2difd 11139	Difference of absolute values. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( ( abs ` A ) - ( abs ` B ) ) <_ ( abs ` ( A - B ) ) )
Theorem	abs2dif2d 11140	Difference of absolute values. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( abs ` ( A - B ) ) <_ ( ( abs ` A ) + ( abs ` B ) ) )
Theorem	abs2difabsd 11141	Absolute value of difference of absolute values. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( abs ` ( ( abs ` A ) - ( abs ` B ) ) ) <_ ( abs ` ( A - B ) ) )
Theorem	abs3difd 11142	Absolute value of differences around common element. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( abs ` ( A - B ) ) <_ ( ( abs ` ( A - C ) ) + ( abs ` ( C - B ) ) ) )
Theorem	abs3lemd 11143	Lemma involving absolute value of differences. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. CC )   &    |- ( ph -> B e. CC )   &    |- ( ph -> C e. CC )   &    |- ( ph -> D e. RR )   &    |- ( ph -> ( abs ` ( A - C ) ) < ( D / 2 ) )   &    |- ( ph -> ( abs ` ( C - B ) ) < ( D / 2 ) )   =>    |- ( ph -> ( abs ` ( A - B ) ) < D )
Theorem	qdenre 11144*	The rational numbers are dense in RR: any real number can be approximated with arbitrary precision by a rational number. For order theoretic density, see qbtwnre 10192. (Contributed by BJ, 15-Oct-2021.)
|- ( ( A e. RR /\ B e. RR+ ) -> E. x e. QQ ( abs ` ( x - A ) ) < B )
4.7.5  The maximum of two real numbers
Theorem	maxcom 11145	The maximum of two reals is commutative. Lemma 3.9 of [Geuvers], p. 10. (Contributed by Jim Kingdon, 21-Dec-2021.)
|- sup ( { A , B } , RR , < ) = sup ( { B , A } , RR , < )
Theorem	maxabsle 11146	An upper bound for { A , B }. (Contributed by Jim Kingdon, 20-Dec-2021.)
|- ( ( A e. RR /\ B e. RR ) -> A <_ ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
Theorem	maxleim 11147	Value of maximum when we know which number is larger. (Contributed by Jim Kingdon, 21-Dec-2021.)
|- ( ( A e. RR /\ B e. RR ) -> ( A <_ B -> sup ( { A , B } , RR , < ) = B ) )
Theorem	maxabslemab 11148	Lemma for maxabs 11151. A variation of maxleim 11147- that is, if we know which of two real numbers is larger, we know the maximum of the two. (Contributed by Jim Kingdon, 21-Dec-2021.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> A < B )   =>    |- ( ph -> ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) = B )
Theorem	maxabslemlub 11149	Lemma for maxabs 11151. A least upper bound for { A , B }. (Contributed by Jim Kingdon, 20-Dec-2021.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   &    |- ( ph -> C < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )   =>    |- ( ph -> ( C < A \/ C < B ) )
Theorem	maxabslemval 11150*	Lemma for maxabs 11151. Value of the supremum. (Contributed by Jim Kingdon, 22-Dec-2021.)
|- ( ( A e. RR /\ B e. RR ) -> ( ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) e. RR /\ A. x e. { A , B } -. ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) < x /\ A. x e. RR ( x < ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) -> E. z e. { A , B } x < z ) ) )
Theorem	maxabs 11151	Maximum of two real numbers in terms of absolute value. (Contributed by Jim Kingdon, 20-Dec-2021.)
|- ( ( A e. RR /\ B e. RR ) -> sup ( { A , B } , RR , < ) = ( ( ( A + B ) + ( abs ` ( A - B ) ) ) / 2 ) )
Theorem	maxcl 11152	The maximum of two real numbers is a real number. (Contributed by Jim Kingdon, 22-Dec-2021.)
|- ( ( A e. RR /\ B e. RR ) -> sup ( { A , B } , RR , < ) e. RR )
Theorem	maxle1 11153	The maximum of two reals is no smaller than the first real. Lemma 3.10 of [Geuvers], p. 10. (Contributed by Jim Kingdon, 21-Dec-2021.)
|- ( ( A e. RR /\ B e. RR ) -> A <_ sup ( { A , B } , RR , < ) )
Theorem	maxle2 11154	The maximum of two reals is no smaller than the second real. Lemma 3.10 of [Geuvers], p. 10. (Contributed by Jim Kingdon, 21-Dec-2021.)
|- ( ( A e. RR /\ B e. RR ) -> B <_ sup ( { A , B } , RR , < ) )
Theorem	maxleast 11155	The maximum of two reals is a least upper bound. Lemma 3.11 of [Geuvers], p. 10. (Contributed by Jim Kingdon, 22-Dec-2021.)
|- ( ( ( A e. RR /\ B e. RR /\ C e. RR ) /\ ( A <_ C /\ B <_ C ) ) -> sup ( { A , B } , RR , < ) <_ C )
Theorem	maxleastb 11156	Two ways of saying the maximum of two numbers is less than or equal to a third. (Contributed by Jim Kingdon, 31-Jan-2022.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( sup ( { A , B } , RR , < ) <_ C <-> ( A <_ C /\ B <_ C ) ) )
Theorem	maxleastlt 11157	The maximum as a least upper bound, in terms of less than. (Contributed by Jim Kingdon, 9-Feb-2022.)
|- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ C < sup ( { A , B } , RR , < ) ) ) -> ( C < A \/ C < B ) )
Theorem	maxleb 11158	Equivalence of <_ and being equal to the maximum of two reals. Lemma 3.12 of [Geuvers], p. 10. (Contributed by Jim Kingdon, 21-Dec-2021.)
|- ( ( A e. RR /\ B e. RR ) -> ( A <_ B <-> sup ( { A , B } , RR , < ) = B ) )
Theorem	dfabsmax 11159	Absolute value of a real number in terms of maximum. Definition 3.13 of [Geuvers], p. 11. (Contributed by BJ and Jim Kingdon, 21-Dec-2021.)
|- ( A e. RR -> ( abs ` A ) = sup ( { A , -u A } , RR , < ) )
Theorem	maxltsup 11160	Two ways of saying the maximum of two numbers is less than a third. (Contributed by Jim Kingdon, 10-Feb-2022.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( sup ( { A , B } , RR , < ) < C <-> ( A < C /\ B < C ) ) )
Theorem	max0addsup 11161	The sum of the positive and negative part functions is the absolute value function over the reals. (Contributed by Jim Kingdon, 30-Jan-2022.)
|- ( A e. RR -> ( sup ( { A , 0 } , RR , < ) + sup ( { -u A , 0 } , RR , < ) ) = ( abs ` A ) )
Theorem	rexanre 11162*	Combine two different upper real properties into one. (Contributed by Mario Carneiro, 8-May-2016.)
|- ( A C_ RR -> ( E. j e. RR A. k e. A ( j <_ k -> ( ph /\ ps ) ) <-> ( E. j e. RR A. k e. A ( j <_ k -> ph ) /\ E. j e. RR A. k e. A ( j <_ k -> ps ) ) ) )
Theorem	rexico 11163*	Restrict the base of an upper real quantifier to an upper real set. (Contributed by Mario Carneiro, 12-May-2016.)
|- ( ( A C_ RR /\ B e. RR ) -> ( E. j e. ( B [,) +oo ) A. k e. A ( j <_ k -> ph ) <-> E. j e. RR A. k e. A ( j <_ k -> ph ) ) )
Theorem	maxclpr 11164	The maximum of two real numbers is one of those numbers if and only if dichotomy ( A <_ B \/ B <_ A) holds. For example, this can be combined with zletric 9235 if one is dealing with integers, but real number dichotomy in general does not follow from our axioms. (Contributed by Jim Kingdon, 1-Feb-2022.)
|- ( ( A e. RR /\ B e. RR ) -> ( sup ( { A , B } , RR , < ) e. { A , B } <-> ( A <_ B \/ B <_ A ) ) )
Theorem	rpmaxcl 11165	The maximum of two positive real numbers is a positive real number. (Contributed by Jim Kingdon, 10-Nov-2023.)
|- ( ( A e. RR+ /\ B e. RR+ ) -> sup ( { A , B } , RR , < ) e. RR+ )
Theorem	zmaxcl 11166	The maximum of two integers is an integer. (Contributed by Jim Kingdon, 27-Sep-2022.)
|- ( ( A e. ZZ /\ B e. ZZ ) -> sup ( { A , B } , RR , < ) e. ZZ )
Theorem	2zsupmax 11167	Two ways to express the maximum of two integers. Because order of integers is decidable, we have more flexibility than for real numbers. (Contributed by Jim Kingdon, 22-Jan-2023.)
|- ( ( A e. ZZ /\ B e. ZZ ) -> sup ( { A , B } , RR , < ) = if ( A <_ B , B , A ) )
Theorem	fimaxre2 11168*	A nonempty finite set of real numbers has an upper bound. (Contributed by Jeff Madsen, 27-May-2011.) (Revised by Mario Carneiro, 13-Feb-2014.)
|- ( ( A C_ RR /\ A e. Fin ) -> E. x e. RR A. y e. A y <_ x )
Theorem	negfi 11169*	The negation of a finite set of real numbers is finite. (Contributed by AV, 9-Aug-2020.)
|- ( ( A C_ RR /\ A e. Fin ) -> { n e. RR | -u n e. A } e. Fin )
4.7.6  The minimum of two real numbers
Theorem	mincom 11170	The minimum of two reals is commutative. (Contributed by Jim Kingdon, 8-Feb-2021.)
|- inf ( { A , B } , RR , < ) = inf ( { B , A } , RR , < )
Theorem	minmax 11171	Minimum expressed in terms of maximum. (Contributed by Jim Kingdon, 8-Feb-2021.)
|- ( ( A e. RR /\ B e. RR ) -> inf ( { A , B } , RR , < ) = -u sup ( { -u A , -u B } , RR , < ) )
Theorem	mincl 11172	The minumum of two real numbers is a real number. (Contributed by Jim Kingdon, 25-Apr-2023.)
|- ( ( A e. RR /\ B e. RR ) -> inf ( { A , B } , RR , < ) e. RR )
Theorem	min1inf 11173	The minimum of two numbers is less than or equal to the first. (Contributed by Jim Kingdon, 8-Feb-2021.)
|- ( ( A e. RR /\ B e. RR ) -> inf ( { A , B } , RR , < ) <_ A )
Theorem	min2inf 11174	The minimum of two numbers is less than or equal to the second. (Contributed by Jim Kingdon, 9-Feb-2021.)
|- ( ( A e. RR /\ B e. RR ) -> inf ( { A , B } , RR , < ) <_ B )
Theorem	lemininf 11175	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 <_ inf ( { B , C } , RR , < ) <-> ( A <_ B /\ A <_ C ) ) )
Theorem	ltmininf 11176	Two ways of saying a number is less than the minimum of two others. (Contributed by Jim Kingdon, 10-Feb-2022.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( A < inf ( { B , C } , RR , < ) <-> ( A < B /\ A < C ) ) )
Theorem	minabs 11177	The minimum of two real numbers in terms of absolute value. (Contributed by Jim Kingdon, 15-May-2023.)
|- ( ( A e. RR /\ B e. RR ) -> inf ( { A , B } , RR , < ) = ( ( ( A + B ) - ( abs ` ( A - B ) ) ) / 2 ) )
Theorem	minclpr 11178	The minimum of two real numbers is one of those numbers if and only if dichotomy ( A <_ B \/ B <_ A) holds. For example, this can be combined with zletric 9235 if one is dealing with integers, but real number dichotomy in general does not follow from our axioms. (Contributed by Jim Kingdon, 23-May-2023.)
|- ( ( A e. RR /\ B e. RR ) -> (inf ( { A , B } , RR , < ) e. { A , B } <-> ( A <_ B \/ B <_ A ) ) )
Theorem	rpmincl 11179	The minumum of two positive real numbers is a positive real number. (Contributed by Jim Kingdon, 25-Apr-2023.)
|- ( ( A e. RR+ /\ B e. RR+ ) -> inf ( { A , B } , RR , < ) e. RR+ )
Theorem	bdtrilem 11180	Lemma for bdtri 11181. (Contributed by Steven Nguyen and Jim Kingdon, 17-May-2023.)
|- ( ( ( A e. RR /\ 0 <_ A ) /\ ( B e. RR /\ 0 <_ B ) /\ C e. RR+ ) -> ( ( abs ` ( A - C ) ) + ( abs ` ( B - C ) ) ) <_ ( C + ( abs ` ( ( A + B ) - C ) ) ) )
Theorem	bdtri 11181	Triangle inequality for bounded values. (Contributed by Jim Kingdon, 15-May-2023.)
|- ( ( ( A e. RR /\ 0 <_ A ) /\ ( B e. RR /\ 0 <_ B ) /\ C e. RR+ ) -> inf ( { ( A + B ) , C } , RR , < ) <_ (inf ( { A , C } , RR , < ) + inf ( { B , C } , RR , < ) ) )
Theorem	mul0inf 11182	Equality of a product with zero. A bit of a curiosity, in the sense that theorems like abs00ap 11004 and mulap0bd 8554 may better express the ideas behind it. (Contributed by Jim Kingdon, 31-Jul-2023.)
|- ( ( A e. CC /\ B e. CC ) -> ( ( A x. B ) = 0 <-> inf ( { ( abs ` A ) , ( abs ` B ) } , RR , < ) = 0 ) )
Theorem	mingeb 11183	Equivalence of <_ and being equal to the minimum of two reals. (Contributed by Jim Kingdon, 14-Oct-2024.)
|- ( ( A e. RR /\ B e. RR ) -> ( A <_ B <-> inf ( { A , B } , RR , < ) = A ) )
Theorem	2zinfmin 11184	Two ways to express the minimum of two integers. Because order of integers is decidable, we have more flexibility than for real numbers. (Contributed by Jim Kingdon, 14-Oct-2024.)
|- ( ( A e. ZZ /\ B e. ZZ ) -> inf ( { A , B } , RR , < ) = if ( A <_ B , A , B ) )
4.7.7  The maximum of two extended reals
Theorem	xrmaxleim 11185	Value of maximum when we know which extended real is larger. (Contributed by Jim Kingdon, 25-Apr-2023.)
|- ( ( A e. RR* /\ B e. RR* ) -> ( A <_ B -> sup ( { A , B } , RR* , < ) = B ) )
Theorem	xrmaxiflemcl 11186	Lemma for xrmaxif 11192. Closure. (Contributed by Jim Kingdon, 29-Apr-2023.)
|- ( ( A e. RR* /\ B e. RR* ) -> if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) e. RR* )
Theorem	xrmaxifle 11187	An upper bound for { A , B } in the extended reals. (Contributed by Jim Kingdon, 26-Apr-2023.)
|- ( ( A e. RR* /\ B e. RR* ) -> A <_ if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) )
Theorem	xrmaxiflemab 11188	Lemma for xrmaxif 11192. A variation of xrmaxleim 11185- that is, if we know which of two real numbers is larger, we know the maximum of the two. (Contributed by Jim Kingdon, 26-Apr-2023.)
|- ( ph -> A e. RR* )   &    |- ( ph -> B e. RR* )   &    |- ( ph -> A < B )   =>    |- ( ph -> if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) = B )
Theorem	xrmaxiflemlub 11189	Lemma for xrmaxif 11192. A least upper bound for { A , B }. (Contributed by Jim Kingdon, 28-Apr-2023.)
|- ( ph -> A e. RR* )   &    |- ( ph -> B e. RR* )   &    |- ( ph -> C e. RR* )   &    |- ( ph -> C < if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) )   =>    |- ( ph -> ( C < A \/ C < B ) )
Theorem	xrmaxiflemcom 11190	Lemma for xrmaxif 11192. Commutativity of an expression which we will later show to be the supremum. (Contributed by Jim Kingdon, 29-Apr-2023.)
|- ( ( A e. RR* /\ B e. RR* ) -> if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) = if ( A = +oo , +oo , if ( A = -oo , B , if ( B = +oo , +oo , if ( B = -oo , A , sup ( { B , A } , RR , < ) ) ) ) ) )
Theorem	xrmaxiflemval 11191*	Lemma for xrmaxif 11192. Value of the supremum. (Contributed by Jim Kingdon, 29-Apr-2023.)
|- M = if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) )   =>    |- ( ( A e. RR* /\ B e. RR* ) -> ( M e. RR* /\ A. x e. { A , B } -. M < x /\ A. x e. RR* ( x < M -> E. z e. { A , B } x < z ) ) )
Theorem	xrmaxif 11192	Maximum of two extended reals in terms of if expressions. (Contributed by Jim Kingdon, 26-Apr-2023.)
|- ( ( A e. RR* /\ B e. RR* ) -> sup ( { A , B } , RR* , < ) = if ( B = +oo , +oo , if ( B = -oo , A , if ( A = +oo , +oo , if ( A = -oo , B , sup ( { A , B } , RR , < ) ) ) ) ) )
Theorem	xrmaxcl 11193	The maximum of two extended reals is an extended real. (Contributed by Jim Kingdon, 29-Apr-2023.)
|- ( ( A e. RR* /\ B e. RR* ) -> sup ( { A , B } , RR* , < ) e. RR* )
Theorem	xrmax1sup 11194	An extended real is less than or equal to the maximum of it and another. (Contributed by NM, 7-Feb-2007.) (Revised by Jim Kingdon, 30-Apr-2023.)
|- ( ( A e. RR* /\ B e. RR* ) -> A <_ sup ( { A , B } , RR* , < ) )
Theorem	xrmax2sup 11195	An extended real is less than or equal to the maximum of it and another. (Contributed by NM, 7-Feb-2007.) (Revised by Jim Kingdon, 30-Apr-2023.)
|- ( ( A e. RR* /\ B e. RR* ) -> B <_ sup ( { A , B } , RR* , < ) )
Theorem	xrmaxrecl 11196	The maximum of two real numbers is the same when taken as extended reals or as reals. (Contributed by Jim Kingdon, 30-Apr-2023.)
|- ( ( A e. RR /\ B e. RR ) -> sup ( { A , B } , RR* , < ) = sup ( { A , B } , RR , < ) )
Theorem	xrmaxleastlt 11197	The maximum as a least upper bound, in terms of less than. (Contributed by Jim Kingdon, 9-Feb-2022.)
|- ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ C < sup ( { A , B } , RR* , < ) ) ) -> ( C < A \/ C < B ) )
Theorem	xrltmaxsup 11198	The maximum as a least upper bound. (Contributed by Jim Kingdon, 10-May-2023.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( C < sup ( { A , B } , RR* , < ) <-> ( C < A \/ C < B ) ) )
Theorem	xrmaxltsup 11199	Two ways of saying the maximum of two numbers is less than a third. (Contributed by Jim Kingdon, 30-Apr-2023.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( sup ( { A , B } , RR* , < ) < C <-> ( A < C /\ B < C ) ) )
Theorem	xrmaxlesup 11200	Two ways of saying the maximum of two numbers is less than or equal to a third. (Contributed by Mario Carneiro, 18-Jun-2014.) (Revised by Jim Kingdon, 10-May-2023.)
|- ( ( A e. RR* /\ B e. RR* /\ C e. RR* ) -> ( sup ( { A , B } , RR* , < ) <_ C <-> ( A <_ C /\ B <_ C ) ) )