P. 90 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 8901-9000   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	3t3e9 8901	3 times 3 equals 9. (Contributed by NM, 11-May-2004.)
|- ( 3 x. 3 ) = 9
Theorem	4t2e8 8902	4 times 2 equals 8. (Contributed by NM, 2-Aug-2004.)
|- ( 4 x. 2 ) = 8
Theorem	2t0e0 8903	2 times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.)
|- ( 2 x. 0 ) = 0
Theorem	4d2e2 8904	One half of four is two. (Contributed by NM, 3-Sep-1999.)
|- ( 4 / 2 ) = 2
Theorem	2nn 8905	2 is a positive integer. (Contributed by NM, 20-Aug-2001.)
|- 2 e. NN
Theorem	3nn 8906	3 is a positive integer. (Contributed by NM, 8-Jan-2006.)
|- 3 e. NN
Theorem	4nn 8907	4 is a positive integer. (Contributed by NM, 8-Jan-2006.)
|- 4 e. NN
Theorem	5nn 8908	5 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 5 e. NN
Theorem	6nn 8909	6 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 6 e. NN
Theorem	7nn 8910	7 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 7 e. NN
Theorem	8nn 8911	8 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 8 e. NN
Theorem	9nn 8912	9 is a positive integer. (Contributed by NM, 21-Oct-2012.)
|- 9 e. NN
Theorem	1lt2 8913	1 is less than 2. (Contributed by NM, 24-Feb-2005.)
|- 1 < 2
Theorem	2lt3 8914	2 is less than 3. (Contributed by NM, 26-Sep-2010.)
|- 2 < 3
Theorem	1lt3 8915	1 is less than 3. (Contributed by NM, 26-Sep-2010.)
|- 1 < 3
Theorem	3lt4 8916	3 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 3 < 4
Theorem	2lt4 8917	2 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 2 < 4
Theorem	1lt4 8918	1 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 1 < 4
Theorem	4lt5 8919	4 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 4 < 5
Theorem	3lt5 8920	3 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 3 < 5
Theorem	2lt5 8921	2 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 2 < 5
Theorem	1lt5 8922	1 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 1 < 5
Theorem	5lt6 8923	5 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 5 < 6
Theorem	4lt6 8924	4 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 4 < 6
Theorem	3lt6 8925	3 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 3 < 6
Theorem	2lt6 8926	2 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 2 < 6
Theorem	1lt6 8927	1 is less than 6. (Contributed by NM, 19-Oct-2012.)
|- 1 < 6
Theorem	6lt7 8928	6 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 6 < 7
Theorem	5lt7 8929	5 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 5 < 7
Theorem	4lt7 8930	4 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 4 < 7
Theorem	3lt7 8931	3 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 3 < 7
Theorem	2lt7 8932	2 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 2 < 7
Theorem	1lt7 8933	1 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 1 < 7
Theorem	7lt8 8934	7 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 7 < 8
Theorem	6lt8 8935	6 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 6 < 8
Theorem	5lt8 8936	5 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 5 < 8
Theorem	4lt8 8937	4 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 4 < 8
Theorem	3lt8 8938	3 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 3 < 8
Theorem	2lt8 8939	2 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 2 < 8
Theorem	1lt8 8940	1 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|- 1 < 8
Theorem	8lt9 8941	8 is less than 9. (Contributed by Mario Carneiro, 19-Feb-2014.)
|- 8 < 9
Theorem	7lt9 8942	7 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|- 7 < 9
Theorem	6lt9 8943	6 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|- 6 < 9
Theorem	5lt9 8944	5 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|- 5 < 9
Theorem	4lt9 8945	4 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|- 4 < 9
Theorem	3lt9 8946	3 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|- 3 < 9
Theorem	2lt9 8947	2 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|- 2 < 9
Theorem	1lt9 8948	1 is less than 9. (Contributed by NM, 19-Oct-2012.) (Revised by Mario Carneiro, 9-Mar-2015.)
|- 1 < 9
Theorem	0ne2 8949	0 is not equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.)
|- 0 =/= 2
Theorem	1ne2 8950	1 is not equal to 2. (Contributed by NM, 19-Oct-2012.)
|- 1 =/= 2
Theorem	1ap2 8951	1 is apart from 2. (Contributed by Jim Kingdon, 29-Oct-2022.)
|- 1 # 2
Theorem	1le2 8952	1 is less than or equal to 2 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
|- 1 <_ 2
Theorem	2cnne0 8953	2 is a nonzero complex number (common case). (Contributed by David A. Wheeler, 7-Dec-2018.)
|- ( 2 e. CC /\ 2 =/= 0 )
Theorem	2rene0 8954	2 is a nonzero real number (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
|- ( 2 e. RR /\ 2 =/= 0 )
Theorem	1le3 8955	1 is less than or equal to 3. (Contributed by David A. Wheeler, 8-Dec-2018.)
|- 1 <_ 3
Theorem	neg1mulneg1e1 8956	-u 1 x. -u 1 is 1 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
|- ( -u 1 x. -u 1 ) = 1
Theorem	halfre 8957	One-half is real. (Contributed by David A. Wheeler, 8-Dec-2018.)
|- ( 1 / 2 ) e. RR
Theorem	halfcn 8958	One-half is complex. (Contributed by David A. Wheeler, 8-Dec-2018.)
|- ( 1 / 2 ) e. CC
Theorem	halfgt0 8959	One-half is greater than zero. (Contributed by NM, 24-Feb-2005.)
|- 0 < ( 1 / 2 )
Theorem	halfge0 8960	One-half is not negative. (Contributed by AV, 7-Jun-2020.)
|- 0 <_ ( 1 / 2 )
Theorem	halflt1 8961	One-half is less than one. (Contributed by NM, 24-Feb-2005.)
|- ( 1 / 2 ) < 1
Theorem	1mhlfehlf 8962	Prove that 1 - 1/2 = 1/2. (Contributed by David A. Wheeler, 4-Jan-2017.)
|- ( 1 - ( 1 / 2 ) ) = ( 1 / 2 )
Theorem	8th4div3 8963	An eighth of four thirds is a sixth. (Contributed by Paul Chapman, 24-Nov-2007.)
|- ( ( 1 / 8 ) x. ( 4 / 3 ) ) = ( 1 / 6 )
Theorem	halfpm6th 8964	One half plus or minus one sixth. (Contributed by Paul Chapman, 17-Jan-2008.)
|- ( ( ( 1 / 2 ) - ( 1 / 6 ) ) = ( 1 / 3 ) /\ ( ( 1 / 2 ) + ( 1 / 6 ) ) = ( 2 / 3 ) )
Theorem	it0e0 8965	i times 0 equals 0 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
|- ( _i x. 0 ) = 0
Theorem	2mulicn 8966	( 2 x. _i ) e. CC (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
|- ( 2 x. _i ) e. CC
Theorem	iap0 8967	The imaginary unit _i is apart from zero. (Contributed by Jim Kingdon, 9-Mar-2020.)
|- _i # 0
Theorem	2muliap0 8968	2 x. _i is apart from zero. (Contributed by Jim Kingdon, 9-Mar-2020.)
|- ( 2 x. _i ) # 0
Theorem	2muline0 8969	( 2 x. _i ) =/= 0. See also 2muliap0 8968. (Contributed by David A. Wheeler, 8-Dec-2018.)
|- ( 2 x. _i ) =/= 0
4.4.5  Simple number properties
Theorem	halfcl 8970	Closure of half of a number (common case). (Contributed by NM, 1-Jan-2006.)
|- ( A e. CC -> ( A / 2 ) e. CC )
Theorem	rehalfcl 8971	Real closure of half. (Contributed by NM, 1-Jan-2006.)
|- ( A e. RR -> ( A / 2 ) e. RR )
Theorem	half0 8972	Half of a number is zero iff the number is zero. (Contributed by NM, 20-Apr-2006.)
|- ( A e. CC -> ( ( A / 2 ) = 0 <-> A = 0 ) )
Theorem	2halves 8973	Two halves make a whole. (Contributed by NM, 11-Apr-2005.)
|- ( A e. CC -> ( ( A / 2 ) + ( A / 2 ) ) = A )
Theorem	halfpos2 8974	A number is positive iff its half is positive. (Contributed by NM, 10-Apr-2005.)
|- ( A e. RR -> ( 0 < A <-> 0 < ( A / 2 ) ) )
Theorem	halfpos 8975	A positive number is greater than its half. (Contributed by NM, 28-Oct-2004.) (Proof shortened by Mario Carneiro, 27-May-2016.)
|- ( A e. RR -> ( 0 < A <-> ( A / 2 ) < A ) )
Theorem	halfnneg2 8976	A number is nonnegative iff its half is nonnegative. (Contributed by NM, 9-Dec-2005.)
|- ( A e. RR -> ( 0 <_ A <-> 0 <_ ( A / 2 ) ) )
Theorem	halfaddsubcl 8977	Closure of half-sum and half-difference. (Contributed by Paul Chapman, 12-Oct-2007.)
|- ( ( A e. CC /\ B e. CC ) -> ( ( ( A + B ) / 2 ) e. CC /\ ( ( A - B ) / 2 ) e. CC ) )
Theorem	halfaddsub 8978	Sum and difference of half-sum and half-difference. (Contributed by Paul Chapman, 12-Oct-2007.)
|- ( ( A e. CC /\ B e. CC ) -> ( ( ( ( A + B ) / 2 ) + ( ( A - B ) / 2 ) ) = A /\ ( ( ( A + B ) / 2 ) - ( ( A - B ) / 2 ) ) = B ) )
Theorem	lt2halves 8979	A sum is less than the whole if each term is less than half. (Contributed by NM, 13-Dec-2006.)
|- ( ( A e. RR /\ B e. RR /\ C e. RR ) -> ( ( A < ( C / 2 ) /\ B < ( C / 2 ) ) -> ( A + B ) < C ) )
Theorem	addltmul 8980	Sum is less than product for numbers greater than 2. (Contributed by Stefan Allan, 24-Sep-2010.)
|- ( ( ( A e. RR /\ B e. RR ) /\ ( 2 < A /\ 2 < B ) ) -> ( A + B ) < ( A x. B ) )
Theorem	nominpos 8981*	There is no smallest positive real number. (Contributed by NM, 28-Oct-2004.)
|- -. E. x e. RR ( 0 < x /\ -. E. y e. RR ( 0 < y /\ y < x ) )
Theorem	avglt1 8982	Ordering property for average. (Contributed by Mario Carneiro, 28-May-2014.)
|- ( ( A e. RR /\ B e. RR ) -> ( A < B <-> A < ( ( A + B ) / 2 ) ) )
Theorem	avglt2 8983	Ordering property for average. (Contributed by Mario Carneiro, 28-May-2014.)
|- ( ( A e. RR /\ B e. RR ) -> ( A < B <-> ( ( A + B ) / 2 ) < B ) )
Theorem	avgle1 8984	Ordering property for average. (Contributed by Mario Carneiro, 28-May-2014.)
|- ( ( A e. RR /\ B e. RR ) -> ( A <_ B <-> A <_ ( ( A + B ) / 2 ) ) )
Theorem	avgle2 8985	Ordering property for average. (Contributed by Jeff Hankins, 15-Sep-2013.) (Revised by Mario Carneiro, 28-May-2014.)
|- ( ( A e. RR /\ B e. RR ) -> ( A <_ B <-> ( ( A + B ) / 2 ) <_ B ) )
Theorem	2timesd 8986	Two times a number. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( 2 x. A ) = ( A + A ) )
Theorem	times2d 8987	A number times 2. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( A x. 2 ) = ( A + A ) )
Theorem	halfcld 8988	Closure of half of a number (frequently used special case). (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( A / 2 ) e. CC )
Theorem	2halvesd 8989	Two halves make a whole. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( ( A / 2 ) + ( A / 2 ) ) = A )
Theorem	rehalfcld 8990	Real closure of half. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. RR )   =>    |- ( ph -> ( A / 2 ) e. RR )
Theorem	lt2halvesd 8991	A sum is less than the whole if each term is less than half. (Contributed by Mario Carneiro, 27-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   &    |- ( ph -> A < ( C / 2 ) )   &    |- ( ph -> B < ( C / 2 ) )   =>    |- ( ph -> ( A + B ) < C )
Theorem	rehalfcli 8992	Half a real number is real. Inference form. (Contributed by David Moews, 28-Feb-2017.)
|- A e. RR   =>    |- ( A / 2 ) e. RR
Theorem	add1p1 8993	Adding two times 1 to a number. (Contributed by AV, 22-Sep-2018.)
|- ( N e. CC -> ( ( N + 1 ) + 1 ) = ( N + 2 ) )
Theorem	sub1m1 8994	Subtracting two times 1 from a number. (Contributed by AV, 23-Oct-2018.)
|- ( N e. CC -> ( ( N - 1 ) - 1 ) = ( N - 2 ) )
Theorem	cnm2m1cnm3 8995	Subtracting 2 and afterwards 1 from a number results in the difference between the number and 3. (Contributed by Alexander van der Vekens, 16-Sep-2018.)
|- ( A e. CC -> ( ( A - 2 ) - 1 ) = ( A - 3 ) )
Theorem	xp1d2m1eqxm1d2 8996	A complex number increased by 1, then divided by 2, then decreased by 1 equals the complex number decreased by 1 and then divided by 2. (Contributed by AV, 24-May-2020.)
|- ( X e. CC -> ( ( ( X + 1 ) / 2 ) - 1 ) = ( ( X - 1 ) / 2 ) )
Theorem	div4p1lem1div2 8997	An integer greater than 5, divided by 4 and increased by 1, is less than or equal to the half of the integer minus 1. (Contributed by AV, 8-Jul-2021.)
|- ( ( N e. RR /\ 6 <_ N ) -> ( ( N / 4 ) + 1 ) <_ ( ( N - 1 ) / 2 ) )
4.4.6  The Archimedean property
Theorem	arch 8998*	Archimedean property of real numbers. For any real number, there is an integer greater than it. Theorem I.29 of [Apostol] p. 26. (Contributed by NM, 21-Jan-1997.)
|- ( A e. RR -> E. n e. NN A < n )
Theorem	nnrecl 8999*	There exists a positive integer whose reciprocal is less than a given positive real. Exercise 3 of [Apostol] p. 28. (Contributed by NM, 8-Nov-2004.)
|- ( ( A e. RR /\ 0 < A ) -> E. n e. NN ( 1 / n ) < A )
Theorem	bndndx 9000*	A bounded real sequence A ( k ) is less than or equal to at least one of its indices. (Contributed by NM, 18-Jan-2008.)
|- ( E. x e. RR A. k e. NN ( A e. RR /\ A <_ x ) -> E. k e. NN A <_ k )