P. 93 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 9201-9300   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	ge0div 9201	Division of a nonnegative number by a positive number. (Contributed by NM, 28-Sep-2005.)
|- ( ( A e. RR /\ B e. RR /\ 0 < B ) -> ( 0 <_ A <-> 0 <_ ( A / B ) ) )
Theorem	divgt0 9202	The ratio of two positive numbers is positive. (Contributed by NM, 12-Oct-1999.)
|- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) ) -> 0 < ( A / B ) )
Theorem	divge0 9203	The ratio of nonnegative and positive numbers is nonnegative. (Contributed by NM, 27-Sep-1999.)
|- ( ( ( A e. RR /\ 0 <_ A ) /\ ( B e. RR /\ 0 < B ) ) -> 0 <_ ( A / B ) )
Theorem	ltmuldiv 9204	'Less than' relationship between division and multiplication. (Contributed by NM, 12-Oct-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( A x. C ) < B <-> A < ( B / C ) ) )
Theorem	ltmuldiv2 9205	'Less than' relationship between division and multiplication. (Contributed by NM, 18-Nov-2004.)
|- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( C x. A ) < B <-> A < ( B / C ) ) )
Theorem	ltdivmul 9206	'Less than' relationship between division and multiplication. (Contributed by NM, 18-Nov-2004.)
|- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( A / C ) < B <-> A < ( C x. B ) ) )
Theorem	ledivmul 9207	'Less than or equal to' relationship between division and multiplication. (Contributed by NM, 9-Dec-2005.)
|- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( A / C ) <_ B <-> A <_ ( C x. B ) ) )
Theorem	ltdivmul2 9208	'Less than' relationship between division and multiplication. (Contributed by NM, 24-Feb-2005.)
|- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( A / C ) < B <-> A < ( B x. C ) ) )
Theorem	lt2mul2div 9209	'Less than' relationship between division and multiplication. (Contributed by NM, 8-Jan-2006.)
|- ( ( ( A e. RR /\ ( B e. RR /\ 0 < B ) ) /\ ( C e. RR /\ ( D e. RR /\ 0 < D ) ) ) -> ( ( A x. B ) < ( C x. D ) <-> ( A / D ) < ( C / B ) ) )
Theorem	ledivmul2 9210	'Less than or equal to' relationship between division and multiplication. (Contributed by NM, 9-Dec-2005.)
|- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( A / C ) <_ B <-> A <_ ( B x. C ) ) )
Theorem	lemuldiv 9211	'Less than or equal' relationship between division and multiplication. (Contributed by NM, 10-Mar-2006.)
|- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( A x. C ) <_ B <-> A <_ ( B / C ) ) )
Theorem	lemuldiv2 9212	'Less than or equal' relationship between division and multiplication. (Contributed by NM, 10-Mar-2006.)
|- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( C x. A ) <_ B <-> A <_ ( B / C ) ) )
Theorem	ltrec 9213	The reciprocal of both sides of 'less than'. (Contributed by NM, 26-Sep-1999.) (Revised by Mario Carneiro, 27-May-2016.)
|- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) ) -> ( A < B <-> ( 1 / B ) < ( 1 / A ) ) )
Theorem	lerec 9214	The reciprocal of both sides of 'less than or equal to'. (Contributed by NM, 3-Oct-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) ) -> ( A <_ B <-> ( 1 / B ) <_ ( 1 / A ) ) )
Theorem	lt2msq1 9215	Lemma for lt2msq 9216. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ( ( A e. RR /\ 0 <_ A ) /\ B e. RR /\ A < B ) -> ( A x. A ) < ( B x. B ) )
Theorem	lt2msq 9216	Two nonnegative numbers compare the same as their squares. (Contributed by Roy F. Longton, 8-Aug-2005.) (Revised by Mario Carneiro, 27-May-2016.)
|- ( ( ( A e. RR /\ 0 <_ A ) /\ ( B e. RR /\ 0 <_ B ) ) -> ( A < B <-> ( A x. A ) < ( B x. B ) ) )
Theorem	ltdiv2 9217	Division of a positive number by both sides of 'less than'. (Contributed by NM, 27-Apr-2005.)
|- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( A < B <-> ( C / B ) < ( C / A ) ) )
Theorem	ltrec1 9218	Reciprocal swap in a 'less than' relation. (Contributed by NM, 24-Feb-2005.)
|- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) ) -> ( ( 1 / A ) < B <-> ( 1 / B ) < A ) )
Theorem	lerec2 9219	Reciprocal swap in a 'less than or equal to' relation. (Contributed by NM, 24-Feb-2005.)
|- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) ) -> ( A <_ ( 1 / B ) <-> B <_ ( 1 / A ) ) )
Theorem	ledivdiv 9220	Invert ratios of positive numbers and swap their ordering. (Contributed by NM, 9-Jan-2006.)
|- ( ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) ) /\ ( ( C e. RR /\ 0 < C ) /\ ( D e. RR /\ 0 < D ) ) ) -> ( ( A / B ) <_ ( C / D ) <-> ( D / C ) <_ ( B / A ) ) )
Theorem	lediv2 9221	Division of a positive number by both sides of 'less than or equal to'. (Contributed by NM, 10-Jan-2006.)
|- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( A <_ B <-> ( C / B ) <_ ( C / A ) ) )
Theorem	ltdiv23 9222	Swap denominator with other side of 'less than'. (Contributed by NM, 3-Oct-1999.)
|- ( ( A e. RR /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( ( A / B ) < C <-> ( A / C ) < B ) )
Theorem	lediv23 9223	Swap denominator with other side of 'less than or equal to'. (Contributed by NM, 30-May-2005.)
|- ( ( A e. RR /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( ( A / B ) <_ C <-> ( A / C ) <_ B ) )
Theorem	lediv12a 9224	Comparison of ratio of two nonnegative numbers. (Contributed by NM, 31-Dec-2005.)
|- ( ( ( ( A e. RR /\ B e. RR ) /\ ( 0 <_ A /\ A <_ B ) ) /\ ( ( C e. RR /\ D e. RR ) /\ ( 0 < C /\ C <_ D ) ) ) -> ( A / D ) <_ ( B / C ) )
Theorem	lediv2a 9225	Division of both sides of 'less than or equal to' into a nonnegative number. (Contributed by Paul Chapman, 7-Sep-2007.)
|- ( ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 <_ C ) ) /\ A <_ B ) -> ( C / B ) <_ ( C / A ) )
Theorem	reclt1 9226	The reciprocal of a positive number less than 1 is greater than 1. (Contributed by NM, 23-Feb-2005.)
|- ( ( A e. RR /\ 0 < A ) -> ( A < 1 <-> 1 < ( 1 / A ) ) )
Theorem	recgt1 9227	The reciprocal of a positive number greater than 1 is less than 1. (Contributed by NM, 28-Dec-2005.)
|- ( ( A e. RR /\ 0 < A ) -> ( 1 < A <-> ( 1 / A ) < 1 ) )
Theorem	recgt1i 9228	The reciprocal of a number greater than 1 is positive and less than 1. (Contributed by NM, 23-Feb-2005.)
|- ( ( A e. RR /\ 1 < A ) -> ( 0 < ( 1 / A ) /\ ( 1 / A ) < 1 ) )
Theorem	recp1lt1 9229	Construct a number less than 1 from any nonnegative number. (Contributed by NM, 30-Dec-2005.)
|- ( ( A e. RR /\ 0 <_ A ) -> ( A / ( 1 + A ) ) < 1 )
Theorem	recreclt 9230	Given a positive number A, construct a new positive number less than both A and 1. (Contributed by NM, 28-Dec-2005.)
|- ( ( A e. RR /\ 0 < A ) -> ( ( 1 / ( 1 + ( 1 / A ) ) ) < 1 /\ ( 1 / ( 1 + ( 1 / A ) ) ) < A ) )
Theorem	le2msq 9231	The square function on nonnegative reals is monotonic. (Contributed by NM, 3-Aug-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( ( ( A e. RR /\ 0 <_ A ) /\ ( B e. RR /\ 0 <_ B ) ) -> ( A <_ B <-> ( A x. A ) <_ ( B x. B ) ) )
Theorem	msq11 9232	The square of a nonnegative number is a one-to-one function. (Contributed by NM, 29-Jul-1999.) (Revised by Mario Carneiro, 27-May-2016.)
|- ( ( ( A e. RR /\ 0 <_ A ) /\ ( B e. RR /\ 0 <_ B ) ) -> ( ( A x. A ) = ( B x. B ) <-> A = B ) )
Theorem	ledivp1 9233	Less-than-or-equal-to and division relation. (Lemma for computing upper bounds of products. The "+ 1" prevents division by zero.) (Contributed by NM, 28-Sep-2005.)
|- ( ( ( A e. RR /\ 0 <_ A ) /\ ( B e. RR /\ 0 <_ B ) ) -> ( ( A / ( B + 1 ) ) x. B ) <_ A )
Theorem	squeeze0 9234*	If a nonnegative number is less than any positive number, it is zero. (Contributed by NM, 11-Feb-2006.)
|- ( ( A e. RR /\ 0 <_ A /\ A. x e. RR ( 0 < x -> A < x ) ) -> A = 0 )
Theorem	ltp1i 9235	A number is less than itself plus 1. (Contributed by NM, 20-Aug-2001.)
|- A e. RR   =>    |- A < ( A + 1 )
Theorem	recgt0i 9236	The reciprocal of a positive number is positive. Exercise 4 of [Apostol] p. 21. (Contributed by NM, 15-May-1999.)
|- A e. RR   =>    |- ( 0 < A -> 0 < ( 1 / A ) )
Theorem	recgt0ii 9237	The reciprocal of a positive number is positive. Exercise 4 of [Apostol] p. 21. (Contributed by NM, 15-May-1999.)
|- A e. RR   &    |- 0 < A   =>    |- 0 < ( 1 / A )
Theorem	prodgt0i 9238	Infer that a multiplicand is positive from a nonnegative multiplier and positive product. (Contributed by NM, 15-May-1999.)
|- A e. RR   &    |- B e. RR   =>    |- ( ( 0 <_ A /\ 0 < ( A x. B ) ) -> 0 < B )
Theorem	prodge0i 9239	Infer that a multiplicand is nonnegative from a positive multiplier and nonnegative product. (Contributed by NM, 2-Jul-2005.)
|- A e. RR   &    |- B e. RR   =>    |- ( ( 0 < A /\ 0 <_ ( A x. B ) ) -> 0 <_ B )
Theorem	divgt0i 9240	The ratio of two positive numbers is positive. (Contributed by NM, 16-May-1999.)
|- A e. RR   &    |- B e. RR   =>    |- ( ( 0 < A /\ 0 < B ) -> 0 < ( A / B ) )
Theorem	divge0i 9241	The ratio of nonnegative and positive numbers is nonnegative. (Contributed by NM, 12-Aug-1999.)
|- A e. RR   &    |- B e. RR   =>    |- ( ( 0 <_ A /\ 0 < B ) -> 0 <_ ( A / B ) )
Theorem	ltreci 9242	The reciprocal of both sides of 'less than'. (Contributed by NM, 15-Sep-1999.)
|- A e. RR   &    |- B e. RR   =>    |- ( ( 0 < A /\ 0 < B ) -> ( A < B <-> ( 1 / B ) < ( 1 / A ) ) )
Theorem	lereci 9243	The reciprocal of both sides of 'less than or equal to'. (Contributed by NM, 16-Sep-1999.)
|- A e. RR   &    |- B e. RR   =>    |- ( ( 0 < A /\ 0 < B ) -> ( A <_ B <-> ( 1 / B ) <_ ( 1 / A ) ) )
Theorem	lt2msqi 9244	The square function on nonnegative reals is strictly monotonic. (Contributed by NM, 3-Aug-1999.)
|- A e. RR   &    |- B e. RR   =>    |- ( ( 0 <_ A /\ 0 <_ B ) -> ( A < B <-> ( A x. A ) < ( B x. B ) ) )
Theorem	le2msqi 9245	The square function on nonnegative reals is monotonic. (Contributed by NM, 2-Aug-1999.)
|- A e. RR   &    |- B e. RR   =>    |- ( ( 0 <_ A /\ 0 <_ B ) -> ( A <_ B <-> ( A x. A ) <_ ( B x. B ) ) )
Theorem	msq11i 9246	The square of a nonnegative number is a one-to-one function. (Contributed by NM, 29-Jul-1999.)
|- A e. RR   &    |- B e. RR   =>    |- ( ( 0 <_ A /\ 0 <_ B ) -> ( ( A x. A ) = ( B x. B ) <-> A = B ) )
Theorem	divgt0i2i 9247	The ratio of two positive numbers is positive. (Contributed by NM, 16-May-1999.)
|- A e. RR   &    |- B e. RR   &    |- 0 < B   =>    |- ( 0 < A -> 0 < ( A / B ) )
Theorem	ltrecii 9248	The reciprocal of both sides of 'less than'. (Contributed by NM, 15-Sep-1999.)
|- A e. RR   &    |- B e. RR   &    |- 0 < A   &    |- 0 < B   =>    |- ( A < B <-> ( 1 / B ) < ( 1 / A ) )
Theorem	divgt0ii 9249	The ratio of two positive numbers is positive. (Contributed by NM, 18-May-1999.)
|- A e. RR   &    |- B e. RR   &    |- 0 < A   &    |- 0 < B   =>    |- 0 < ( A / B )
Theorem	ltmul1i 9250	Multiplication of both sides of 'less than' by a positive number. Theorem I.19 of [Apostol] p. 20. (Contributed by NM, 16-May-1999.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   =>    |- ( 0 < C -> ( A < B <-> ( A x. C ) < ( B x. C ) ) )
Theorem	ltdiv1i 9251	Division of both sides of 'less than' by a positive number. (Contributed by NM, 16-May-1999.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   =>    |- ( 0 < C -> ( A < B <-> ( A / C ) < ( B / C ) ) )
Theorem	ltmuldivi 9252	'Less than' relationship between division and multiplication. (Contributed by NM, 12-Oct-1999.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   =>    |- ( 0 < C -> ( ( A x. C ) < B <-> A < ( B / C ) ) )
Theorem	ltmul2i 9253	Multiplication of both sides of 'less than' by a positive number. Theorem I.19 of [Apostol] p. 20. (Contributed by NM, 16-May-1999.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   =>    |- ( 0 < C -> ( A < B <-> ( C x. A ) < ( C x. B ) ) )
Theorem	lemul1i 9254	Multiplication of both sides of 'less than or equal to' by a positive number. (Contributed by NM, 2-Aug-1999.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   =>    |- ( 0 < C -> ( A <_ B <-> ( A x. C ) <_ ( B x. C ) ) )
Theorem	lemul2i 9255	Multiplication of both sides of 'less than or equal to' by a positive number. (Contributed by NM, 1-Aug-1999.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   =>    |- ( 0 < C -> ( A <_ B <-> ( C x. A ) <_ ( C x. B ) ) )
Theorem	ltdiv23i 9256	Swap denominator with other side of 'less than'. (Contributed by NM, 26-Sep-1999.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   =>    |- ( ( 0 < B /\ 0 < C ) -> ( ( A / B ) < C <-> ( A / C ) < B ) )
Theorem	ltdiv23ii 9257	Swap denominator with other side of 'less than'. (Contributed by NM, 26-Sep-1999.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   &    |- 0 < B   &    |- 0 < C   =>    |- ( ( A / B ) < C <-> ( A / C ) < B )
Theorem	ltmul1ii 9258	Multiplication of both sides of 'less than' by a positive number. Theorem I.19 of [Apostol] p. 20. (Contributed by NM, 16-May-1999.) (Proof shortened by Paul Chapman, 25-Jan-2008.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   &    |- 0 < C   =>    |- ( A < B <-> ( A x. C ) < ( B x. C ) )
Theorem	ltdiv1ii 9259	Division of both sides of 'less than' by a positive number. (Contributed by NM, 16-May-1999.)
|- A e. RR   &    |- B e. RR   &    |- C e. RR   &    |- 0 < C   =>    |- ( A < B <-> ( A / C ) < ( B / C ) )
Theorem	ltp1d 9260	A number is less than itself plus 1. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   =>    |- ( ph -> A < ( A + 1 ) )
Theorem	lep1d 9261	A number is less than or equal to itself plus 1. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   =>    |- ( ph -> A <_ ( A + 1 ) )
Theorem	ltm1d 9262	A number minus 1 is less than itself. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   =>    |- ( ph -> ( A - 1 ) < A )
Theorem	lem1d 9263	A number minus 1 is less than or equal to itself. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   =>    |- ( ph -> ( A - 1 ) <_ A )
Theorem	recgt0d 9264	The reciprocal of a positive number is positive. Exercise 4 of [Apostol] p. 21. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 0 < A )   =>    |- ( ph -> 0 < ( 1 / A ) )
Theorem	divgt0d 9265	The ratio of two positive numbers is positive. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> 0 < A )   &    |- ( ph -> 0 < B )   =>    |- ( ph -> 0 < ( A / B ) )
Theorem	mulgt1d 9266	The product of two numbers greater than 1 is greater than 1. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> 1 < A )   &    |- ( ph -> 1 < B )   =>    |- ( ph -> 1 < ( A x. B ) )
Theorem	lemulge11d 9267	Multiplication by a number greater than or equal to 1. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> 1 <_ B )   =>    |- ( ph -> A <_ ( A x. B ) )
Theorem	lemulge12d 9268	Multiplication by a number greater than or equal to 1. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> 1 <_ B )   =>    |- ( ph -> A <_ ( B x. A ) )
Theorem	lemul1ad 9269	Multiplication of both sides of 'less than or equal to' by a nonnegative number. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   &    |- ( ph -> 0 <_ C )   &    |- ( ph -> A <_ B )   =>    |- ( ph -> ( A x. C ) <_ ( B x. C ) )
Theorem	lemul2ad 9270	Multiplication of both sides of 'less than or equal to' by a nonnegative number. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   &    |- ( ph -> 0 <_ C )   &    |- ( ph -> A <_ B )   =>    |- ( ph -> ( C x. A ) <_ ( C x. B ) )
Theorem	ltmul12ad 9271	Comparison of product of two positive numbers. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   &    |- ( ph -> D e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> A < B )   &    |- ( ph -> 0 <_ C )   &    |- ( ph -> C < D )   =>    |- ( ph -> ( A x. C ) < ( B x. D ) )
Theorem	lemul12ad 9272	Comparison of product of two nonnegative numbers. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   &    |- ( ph -> D e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> 0 <_ C )   &    |- ( ph -> A <_ B )   &    |- ( ph -> C <_ D )   =>    |- ( ph -> ( A x. C ) <_ ( B x. D ) )
Theorem	lemul12bd 9273	Comparison of product of two nonnegative numbers. (Contributed by Mario Carneiro, 28-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   &    |- ( ph -> D e. RR )   &    |- ( ph -> 0 <_ A )   &    |- ( ph -> 0 <_ D )   &    |- ( ph -> A <_ B )   &    |- ( ph -> C <_ D )   =>    |- ( ph -> ( A x. C ) <_ ( B x. D ) )
Theorem	mulle0r 9274	Multiplying a nonnegative number by a nonpositive number yields a nonpositive number. (Contributed by Jim Kingdon, 28-Oct-2021.)
|- ( ( ( A e. RR /\ B e. RR ) /\ ( A <_ 0 /\ 0 <_ B ) ) -> ( A x. B ) <_ 0 )
4.3.10  Suprema
Theorem	lbreu 9275*	If a set of reals contains a lower bound, it contains a unique lower bound. (Contributed by NM, 9-Oct-2005.)
|- ( ( S C_ RR /\ E. x e. S A. y e. S x <_ y ) -> E! x e. S A. y e. S x <_ y )
Theorem	lbcl 9276*	If a set of reals contains a lower bound, it contains a unique lower bound that belongs to the set. (Contributed by NM, 9-Oct-2005.) (Revised by Mario Carneiro, 24-Dec-2016.)
|- ( ( S C_ RR /\ E. x e. S A. y e. S x <_ y ) -> ( iota_ x e. S A. y e. S x <_ y ) e. S )
Theorem	lble 9277*	If a set of reals contains a lower bound, the lower bound is less than or equal to all members of the set. (Contributed by NM, 9-Oct-2005.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)
|- ( ( S C_ RR /\ E. x e. S A. y e. S x <_ y /\ A e. S ) -> ( iota_ x e. S A. y e. S x <_ y ) <_ A )
Theorem	lbinf 9278*	If a set of reals contains a lower bound, the lower bound is its infimum. (Contributed by NM, 9-Oct-2005.) (Revised by AV, 4-Sep-2020.)
|- ( ( S C_ RR /\ E. x e. S A. y e. S x <_ y ) -> inf ( S , RR , < ) = ( iota_ x e. S A. y e. S x <_ y ) )
Theorem	lbinfcl 9279*	If a set of reals contains a lower bound, it contains its infimum. (Contributed by NM, 11-Oct-2005.) (Revised by AV, 4-Sep-2020.)
|- ( ( S C_ RR /\ E. x e. S A. y e. S x <_ y ) -> inf ( S , RR , < ) e. S )
Theorem	lbinfle 9280*	If a set of reals contains a lower bound, its infimum is less than or equal to all members of the set. (Contributed by NM, 11-Oct-2005.) (Revised by AV, 4-Sep-2020.)
|- ( ( S C_ RR /\ E. x e. S A. y e. S x <_ y /\ A e. S ) -> inf ( S , RR , < ) <_ A )
Theorem	suprubex 9281*	A member of a nonempty bounded set of reals is less than or equal to the set's upper bound. (Contributed by Jim Kingdon, 18-Jan-2022.)
|- ( ph -> E. x e. RR ( A. y e. A -. x < y /\ A. y e. RR ( y < x -> E. z e. A y < z ) ) )   &    |- ( ph -> A C_ RR )   &    |- ( ph -> B e. A )   =>    |- ( ph -> B <_ sup ( A , RR , < ) )
Theorem	suprlubex 9282*	The supremum of a nonempty bounded set of reals is the least upper bound. (Contributed by Jim Kingdon, 19-Jan-2022.)
|- ( ph -> E. x e. RR ( A. y e. A -. x < y /\ A. y e. RR ( y < x -> E. z e. A y < z ) ) )   &    |- ( ph -> A C_ RR )   &    |- ( ph -> B e. RR )   =>    |- ( ph -> ( B < sup ( A , RR , < ) <-> E. z e. A B < z ) )
Theorem	suprnubex 9283*	An upper bound is not less than the supremum of a nonempty bounded set of reals. (Contributed by Jim Kingdon, 19-Jan-2022.)
|- ( ph -> E. x e. RR ( A. y e. A -. x < y /\ A. y e. RR ( y < x -> E. z e. A y < z ) ) )   &    |- ( ph -> A C_ RR )   &    |- ( ph -> B e. RR )   =>    |- ( ph -> ( -. B < sup ( A , RR , < ) <-> A. z e. A -. B < z ) )
Theorem	suprleubex 9284*	The supremum of a nonempty bounded set of reals is less than or equal to an upper bound. (Contributed by NM, 18-Mar-2005.) (Revised by Mario Carneiro, 6-Sep-2014.)
|- ( ph -> E. x e. RR ( A. y e. A -. x < y /\ A. y e. RR ( y < x -> E. z e. A y < z ) ) )   &    |- ( ph -> A C_ RR )   &    |- ( ph -> B e. RR )   =>    |- ( ph -> ( sup ( A , RR , < ) <_ B <-> A. z e. A z <_ B ) )
Theorem	negiso 9285	Negation is an order anti-isomorphism of the real numbers, which is its own inverse. (Contributed by Mario Carneiro, 24-Dec-2016.)
|- F = ( x e. RR |-> -u x )   =>    |- ( F Isom < , `' < ( RR , RR ) /\ `' F = F )
Theorem	dfinfre 9286*	The infimum of a set of reals A. (Contributed by NM, 9-Oct-2005.) (Revised by AV, 4-Sep-2020.)
|- ( A C_ RR -> inf ( A , RR , < ) = U. { x e. RR | ( A. y e. A x <_ y /\ A. y e. RR ( x < y -> E. z e. A z < y ) ) } )
Theorem	sup3exmid 9287*	If any inhabited set of real numbers bounded from above has a supremum, excluded middle follows. (Contributed by Jim Kingdon, 2-Apr-2023.)
|- ( ( u C_ RR /\ E. w w e. u /\ E. x e. RR A. y e. u y <_ x ) -> E. x e. RR ( A. y e. u -. x < y /\ A. y e. RR ( y < x -> E. z e. u y < z ) ) )   =>    |- DECID ph
4.3.11  Imaginary and complex number properties
Theorem	crap0 9288	The real representation of complex numbers is apart from zero iff one of its terms is apart from zero. (Contributed by Jim Kingdon, 5-Mar-2020.)
|- ( ( A e. RR /\ B e. RR ) -> ( ( A # 0 \/ B # 0 ) <-> ( A + ( _i x. B ) ) # 0 ) )
Theorem	creur 9289*	The real part of a complex number is unique. Proposition 10-1.3 of [Gleason] p. 130. (Contributed by NM, 9-May-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( A e. CC -> E! x e. RR E. y e. RR A = ( x + ( _i x. y ) ) )
Theorem	creui 9290*	The imaginary part of a complex number is unique. Proposition 10-1.3 of [Gleason] p. 130. (Contributed by NM, 9-May-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( A e. CC -> E! y e. RR E. x e. RR A = ( x + ( _i x. y ) ) )
Theorem	cju 9291*	The complex conjugate of a complex number is unique. (Contributed by Mario Carneiro, 6-Nov-2013.)
|- ( A e. CC -> E! x e. CC ( ( A + x ) e. RR /\ ( _i x. ( A - x ) ) e. RR ) )
4.3.12  Function operation analogue theorems
Theorem	ofnegsub 9292	Function analogue of negsub 8574. (Contributed by Mario Carneiro, 24-Jul-2014.)
|- ( ( A e. V /\ F : A --> CC /\ G : A --> CC ) -> ( F oF + ( ( A X. { -u 1 } ) oF x. G ) ) = ( F oF - G ) )
4.3.13  Indicator Functions According to Wikipedia (https://en.wikipedia.org/wiki/Indicator_function, "Indicator function", 11-Apr-2026): "In mathematics, an indicator function or a characteristic function of a subset of a set is a function that maps elements of the subset to one, and all other elements to zero. That is, if A is a subset of some set X, then the indicator function of A is the function 𝟭A defined by 𝟭A ( x ) = 1 if x e. A, and 𝟭A ( x ) = 0 otherwise." See also definition in [Lang2] p. 3: "The characteristic function of a subset S' of S is the function ch such that ch(x) = 1 if x e. S' and ch(x) = 0 if x e/ S'".
Syntax	cind 9293	Extend class notation with the indicator function generator.
class 𝟭
Definition	df-ind 9294*	Define the indicator function generator. It generates an indicator function ( (𝟭 ` O ) ` A ) for a given domain O and a given subset A of the domain, see indval 9296. In contrast to the definitions and notations in Wikipedia and [Lang2] p. 3, the domain and the subset are always mentioned explicitly. (Contributed by Thierry Arnoux, 20-Jan-2017.)
|- 𝟭 = ( o e. _V |-> ( a e. ~P o |-> ( x e. o |-> if ( x e. a , 1 , 0 ) ) ) )
Theorem	indv 9295*	Value of the indicator function generator with domain O. (Contributed by Thierry Arnoux, 23-Aug-2017.)
|- ( O e. V -> (𝟭 ` O ) = ( a e. ~P O |-> ( x e. O |-> if ( x e. a , 1 , 0 ) ) ) )
Theorem	indval 9296*	Value of the indicator function generator for a set A and a domain O, i.e., an indicator function for a given domain O and a given subset A of the domain. (Contributed by Thierry Arnoux, 2-Feb-2017.)
|- ( ( O e. V /\ A C_ O ) -> ( (𝟭 ` O ) ` A ) = ( x e. O |-> if ( x e. A , 1 , 0 ) ) )
Theorem	indval0 9297	The indicator function generator does not generate a (meaningful) indicator function for a class which is not a subset of the domain. (Contributed by AV, 11-Apr-2026.)
|- ( -. A C_ O -> ( (𝟭 ` O ) ` A ) = (/) )
Theorem	indfdc 9298*	An indicator function as a function with domain and codomain. (Contributed by Thierry Arnoux, 13-Aug-2017.)
|- ( ( O e. V /\ A C_ O /\ A. x e. O DECID x e. A ) -> ( (𝟭 ` O ) ` A ) : O --> { 0 , 1 } )
Theorem	indfval 9299	Value of the indicator function. (Contributed by Thierry Arnoux, 13-Aug-2017.)
|- ( ( O e. V /\ A C_ O /\ X e. O ) -> ( ( (𝟭 ` O ) ` A ) ` X ) = if ( X e. A , 1 , 0 ) )
Theorem	ind1 9300	Value of the indicator function where it is 1. (Contributed by Thierry Arnoux, 14-Aug-2017.)
|- ( ( O e. V /\ A C_ O /\ X e. A ) -> ( ( (𝟭 ` O ) ` A ) ` X ) = 1 )