P. 86 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 8501-8600   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	eluzadd 8501	Membership in a later upper set of integers. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( ( N e. ( ZZ>= ` M ) /\ K e. ZZ ) -> ( N + K ) e. ( ZZ>= ` ( M + K ) ) )
Theorem	eluzsub 8502	Membership in an earlier upper set of integers. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( ( M e. ZZ /\ K e. ZZ /\ N e. ( ZZ>= ` ( M + K ) ) ) -> ( N - K ) e. ( ZZ>= ` M ) )
Theorem	uzm1 8503	Choices for an element of an upper interval of integers. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( N e. ( ZZ>= ` M ) -> ( N = M \/ ( N - 1 ) e. ( ZZ>= ` M ) ) )
Theorem	uznn0sub 8504	The nonnegative difference of integers is a nonnegative integer. (Contributed by NM, 4-Sep-2005.)
|- ( N e. ( ZZ>= ` M ) -> ( N - M ) e. NN0 )
Theorem	uzin 8505	Intersection of two upper intervals of integers. (Contributed by Mario Carneiro, 24-Dec-2013.)
|- ( ( M e. ZZ /\ N e. ZZ ) -> ( ( ZZ>= ` M ) i^i ( ZZ>= ` N ) ) = ( ZZ>= ` if ( M <_ N , N , M ) ) )
Theorem	uzp1 8506	Choices for an element of an upper interval of integers. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( N e. ( ZZ>= ` M ) -> ( N = M \/ N e. ( ZZ>= ` ( M + 1 ) ) ) )
Theorem	nn0uz 8507	Nonnegative integers expressed as an upper set of integers. (Contributed by NM, 2-Sep-2005.)
|- NN0 = ( ZZ>= ` 0 )
Theorem	nnuz 8508	Positive integers expressed as an upper set of integers. (Contributed by NM, 2-Sep-2005.)
|- NN = ( ZZ>= ` 1 )
Theorem	elnnuz 8509	A positive integer expressed as a member of an upper set of integers. (Contributed by NM, 6-Jun-2006.)
|- ( N e. NN <-> N e. ( ZZ>= ` 1 ) )
Theorem	elnn0uz 8510	A nonnegative integer expressed as a member an upper set of integers. (Contributed by NM, 6-Jun-2006.)
|- ( N e. NN0 <-> N e. ( ZZ>= ` 0 ) )
Theorem	eluz2nn 8511	An integer is greater than or equal to 2 is a positive integer. (Contributed by AV, 3-Nov-2018.)
|- ( A e. ( ZZ>= ` 2 ) -> A e. NN )
Theorem	eluzge2nn0 8512	If an integer is greater than or equal to 2, then it is a nonnegative integer. (Contributed by AV, 27-Aug-2018.) (Proof shortened by AV, 3-Nov-2018.)
|- ( N e. ( ZZ>= ` 2 ) -> N e. NN0 )
Theorem	uzuzle23 8513	An integer in the upper set of integers starting at 3 is element of the upper set of integers starting at 2. (Contributed by Alexander van der Vekens, 17-Sep-2018.)
|- ( A e. ( ZZ>= ` 3 ) -> A e. ( ZZ>= ` 2 ) )
Theorem	eluzge3nn 8514	If an integer is greater than 3, then it is a positive integer. (Contributed by Alexander van der Vekens, 17-Sep-2018.)
|- ( N e. ( ZZ>= ` 3 ) -> N e. NN )
Theorem	uz3m2nn 8515	An integer greater than or equal to 3 decreased by 2 is a positive integer. (Contributed by Alexander van der Vekens, 17-Sep-2018.)
|- ( N e. ( ZZ>= ` 3 ) -> ( N - 2 ) e. NN )
Theorem	1eluzge0 8516	1 is an integer greater than or equal to 0. (Contributed by Alexander van der Vekens, 8-Jun-2018.)
|- 1 e. ( ZZ>= ` 0 )
Theorem	2eluzge0 8517	2 is an integer greater than or equal to 0. (Contributed by Alexander van der Vekens, 8-Jun-2018.) (Proof shortened by OpenAI, 25-Mar-2020.)
|- 2 e. ( ZZ>= ` 0 )
Theorem	2eluzge0OLD 8518	2 is an integer greater than or equal to 0. (Contributed by Alexander van der Vekens, 8-Jun-2018.) Obsolete version of 2eluzge0 8517 as of 25-Mar-2020. (New usage is discouraged.) (Proof modification is discouraged.)
|- 2 e. ( ZZ>= ` 0 )
Theorem	2eluzge1 8519	2 is an integer greater than or equal to 1. (Contributed by Alexander van der Vekens, 8-Jun-2018.)
|- 2 e. ( ZZ>= ` 1 )
Theorem	uznnssnn 8520	The upper integers starting from a natural are a subset of the naturals. (Contributed by Scott Fenton, 29-Jun-2013.)
|- ( N e. NN -> ( ZZ>= ` N ) C_ NN )
Theorem	raluz 8521*	Restricted universal quantification in an upper set of integers. (Contributed by NM, 9-Sep-2005.)
|- ( M e. ZZ -> ( A. n e. ( ZZ>= ` M ) ph <-> A. n e. ZZ ( M <_ n -> ph ) ) )
Theorem	raluz2 8522*	Restricted universal quantification in an upper set of integers. (Contributed by NM, 9-Sep-2005.)
|- ( A. n e. ( ZZ>= ` M ) ph <-> ( M e. ZZ -> A. n e. ZZ ( M <_ n -> ph ) ) )
Theorem	rexuz 8523*	Restricted existential quantification in an upper set of integers. (Contributed by NM, 9-Sep-2005.)
|- ( M e. ZZ -> ( E. n e. ( ZZ>= ` M ) ph <-> E. n e. ZZ ( M <_ n /\ ph ) ) )
Theorem	rexuz2 8524*	Restricted existential quantification in an upper set of integers. (Contributed by NM, 9-Sep-2005.)
|- ( E. n e. ( ZZ>= ` M ) ph <-> ( M e. ZZ /\ E. n e. ZZ ( M <_ n /\ ph ) ) )
Theorem	2rexuz 8525*	Double existential quantification in an upper set of integers. (Contributed by NM, 3-Nov-2005.)
|- ( E. m E. n e. ( ZZ>= ` m ) ph <-> E. m e. ZZ E. n e. ZZ ( m <_ n /\ ph ) )
Theorem	peano2uz 8526	Second Peano postulate for an upper set of integers. (Contributed by NM, 7-Sep-2005.)
|- ( N e. ( ZZ>= ` M ) -> ( N + 1 ) e. ( ZZ>= ` M ) )
Theorem	peano2uzs 8527	Second Peano postulate for an upper set of integers. (Contributed by Mario Carneiro, 26-Dec-2013.)
|- Z = ( ZZ>= ` M )   =>    |- ( N e. Z -> ( N + 1 ) e. Z )
Theorem	peano2uzr 8528	Reversed second Peano axiom for upper integers. (Contributed by NM, 2-Jan-2006.)
|- ( ( M e. ZZ /\ N e. ( ZZ>= ` ( M + 1 ) ) ) -> N e. ( ZZ>= ` M ) )
Theorem	uzaddcl 8529	Addition closure law for an upper set of integers. (Contributed by NM, 4-Jun-2006.)
|- ( ( N e. ( ZZ>= ` M ) /\ K e. NN0 ) -> ( N + K ) e. ( ZZ>= ` M ) )
Theorem	nn0pzuz 8530	The sum of a nonnegative integer and an integer is an integer greater than or equal to that integer. (Contributed by Alexander van der Vekens, 3-Oct-2018.)
|- ( ( N e. NN0 /\ Z e. ZZ ) -> ( N + Z ) e. ( ZZ>= ` Z ) )
Theorem	uzind4 8531*	Induction on the upper set of integers that starts at an integer M. The first four hypotheses give us the substitution instances we need, and the last two are the basis and the induction step. (Contributed by NM, 7-Sep-2005.)
|- ( j = M -> ( ph <-> ps ) )   &    |- ( j = k -> ( ph <-> ch ) )   &    |- ( j = ( k + 1 ) -> ( ph <-> th ) )   &    |- ( j = N -> ( ph <-> ta ) )   &    |- ( M e. ZZ -> ps )   &    |- ( k e. ( ZZ>= ` M ) -> ( ch -> th ) )   =>    |- ( N e. ( ZZ>= ` M ) -> ta )
Theorem	uzind4ALT 8532*	Induction on the upper set of integers that starts at an integer M. The last four hypotheses give us the substitution instances we need; the first two are the basis and the induction step. Either uzind4 8531 or uzind4ALT 8532 may be used; see comment for nnind 7930. (Contributed by NM, 7-Sep-2005.) (New usage is discouraged.) (Proof modification is discouraged.)
|- ( M e. ZZ -> ps )   &    |- ( k e. ( ZZ>= ` M ) -> ( ch -> th ) )   &    |- ( j = M -> ( ph <-> ps ) )   &    |- ( j = k -> ( ph <-> ch ) )   &    |- ( j = ( k + 1 ) -> ( ph <-> th ) )   &    |- ( j = N -> ( ph <-> ta ) )   =>    |- ( N e. ( ZZ>= ` M ) -> ta )
Theorem	uzind4s 8533*	Induction on the upper set of integers that starts at an integer M, using explicit substitution. The hypotheses are the basis and the induction step. (Contributed by NM, 4-Nov-2005.)
|- ( M e. ZZ -> [. M / k ]. ph )   &    |- ( k e. ( ZZ>= ` M ) -> ( ph -> [. ( k + 1 ) / k ]. ph ) )   =>    |- ( N e. ( ZZ>= ` M ) -> [. N / k ]. ph )
Theorem	uzind4s2 8534*	Induction on the upper set of integers that starts at an integer M, using explicit substitution. The hypotheses are the basis and the induction step. Use this instead of uzind4s 8533 when j and k must be distinct in [. ( k + 1 ) / j ]. ph. (Contributed by NM, 16-Nov-2005.)
|- ( M e. ZZ -> [. M / j ]. ph )   &    |- ( k e. ( ZZ>= ` M ) -> ( [. k / j ]. ph -> [. ( k + 1 ) / j ]. ph ) )   =>    |- ( N e. ( ZZ>= ` M ) -> [. N / j ]. ph )
Theorem	uzind4i 8535*	Induction on the upper integers that start at M. The first hypothesis specifies the lower bound, the next four give us the substitution instances we need, and the last two are the basis and the induction step. (Contributed by NM, 4-Sep-2005.)
|- M e. ZZ   &    |- ( j = M -> ( ph <-> ps ) )   &    |- ( j = k -> ( ph <-> ch ) )   &    |- ( j = ( k + 1 ) -> ( ph <-> th ) )   &    |- ( j = N -> ( ph <-> ta ) )   &    |- ps   &    |- ( k e. ( ZZ>= ` M ) -> ( ch -> th ) )   =>    |- ( N e. ( ZZ>= ` M ) -> ta )
Theorem	indstr 8536*	Strong Mathematical Induction for positive integers (inference schema). (Contributed by NM, 17-Aug-2001.)
|- ( x = y -> ( ph <-> ps ) )   &    |- ( x e. NN -> ( A. y e. NN ( y < x -> ps ) -> ph ) )   =>    |- ( x e. NN -> ph )
Theorem	eluznn0 8537	Membership in a nonnegative upper set of integers implies membership in NN0. (Contributed by Paul Chapman, 22-Jun-2011.)
|- ( ( N e. NN0 /\ M e. ( ZZ>= ` N ) ) -> M e. NN0 )
Theorem	eluznn 8538	Membership in a positive upper set of integers implies membership in NN. (Contributed by JJ, 1-Oct-2018.)
|- ( ( N e. NN /\ M e. ( ZZ>= ` N ) ) -> M e. NN )
Theorem	eluz2b1 8539	Two ways to say "an integer greater than or equal to 2." (Contributed by Paul Chapman, 23-Nov-2012.)
|- ( N e. ( ZZ>= ` 2 ) <-> ( N e. ZZ /\ 1 < N ) )
Theorem	eluz2b2 8540	Two ways to say "an integer greater than or equal to 2." (Contributed by Paul Chapman, 23-Nov-2012.)
|- ( N e. ( ZZ>= ` 2 ) <-> ( N e. NN /\ 1 < N ) )
Theorem	eluz2b3 8541	Two ways to say "an integer greater than or equal to 2." (Contributed by Paul Chapman, 23-Nov-2012.)
|- ( N e. ( ZZ>= ` 2 ) <-> ( N e. NN /\ N =/= 1 ) )
Theorem	uz2m1nn 8542	One less than an integer greater than or equal to 2 is a positive integer. (Contributed by Paul Chapman, 17-Nov-2012.)
|- ( N e. ( ZZ>= ` 2 ) -> ( N - 1 ) e. NN )
Theorem	1nuz2 8543	1 is not in ( ZZ>= ` 2 ). (Contributed by Paul Chapman, 21-Nov-2012.)
|- -. 1 e. ( ZZ>= ` 2 )
Theorem	elnn1uz2 8544	A positive integer is either 1 or greater than or equal to 2. (Contributed by Paul Chapman, 17-Nov-2012.)
|- ( N e. NN <-> ( N = 1 \/ N e. ( ZZ>= ` 2 ) ) )
Theorem	uz2mulcl 8545	Closure of multiplication of integers greater than or equal to 2. (Contributed by Paul Chapman, 26-Oct-2012.)
|- ( ( M e. ( ZZ>= ` 2 ) /\ N e. ( ZZ>= ` 2 ) ) -> ( M x. N ) e. ( ZZ>= ` 2 ) )
Theorem	indstr2 8546*	Strong Mathematical Induction for positive integers (inference schema). The first two hypotheses give us the substitution instances we need; the last two are the basis and the induction step. (Contributed by Paul Chapman, 21-Nov-2012.)
|- ( x = 1 -> ( ph <-> ch ) )   &    |- ( x = y -> ( ph <-> ps ) )   &    |- ch   &    |- ( x e. ( ZZ>= ` 2 ) -> ( A. y e. NN ( y < x -> ps ) -> ph ) )   =>    |- ( x e. NN -> ph )
Theorem	eluzdc 8547	Membership of an integer in an upper set of integers is decidable. (Contributed by Jim Kingdon, 18-Apr-2020.)
|- ( ( M e. ZZ /\ N e. ZZ ) -> DECID N e. ( ZZ>= ` M ) )
Theorem	ublbneg 8548*	The image under negation of a bounded-above set of reals is bounded below. (Contributed by Paul Chapman, 21-Mar-2011.)
|- ( E. x e. RR A. y e. A y <_ x -> E. x e. RR A. y e. { z e. RR | -u z e. A } x <_ y )
Theorem	eqreznegel 8549*	Two ways to express the image under negation of a set of integers. (Contributed by Paul Chapman, 21-Mar-2011.)
|- ( A C_ ZZ -> { z e. RR | -u z e. A } = { z e. ZZ | -u z e. A } )
Theorem	negm 8550*	The image under negation of an inhabited set of reals is inhabited. (Contributed by Jim Kingdon, 10-Apr-2020.)
|- ( ( A C_ RR /\ E. x x e. A ) -> E. y y e. { z e. RR | -u z e. A } )
Theorem	lbzbi 8551*	If a set of reals is bounded below, it is bounded below by an integer. (Contributed by Paul Chapman, 21-Mar-2011.)
|- ( A C_ RR -> ( E. x e. RR A. y e. A x <_ y <-> E. x e. ZZ A. y e. A x <_ y ) )
Theorem	nn01to3 8552	A (nonnegative) integer between 1 and 3 must be 1, 2 or 3. (Contributed by Alexander van der Vekens, 13-Sep-2018.)
|- ( ( N e. NN0 /\ 1 <_ N /\ N <_ 3 ) -> ( N = 1 \/ N = 2 \/ N = 3 ) )
Theorem	nn0ge2m1nnALT 8553	Alternate proof of nn0ge2m1nn 8242: If a nonnegative integer is greater than or equal to two, the integer decreased by 1 is a positive integer. This version is proved using eluz2 8479, a theorem for upper sets of integers, which are defined later than the positive and nonnegative integers. This proof is, however, much shorter than the proof of nn0ge2m1nn 8242. (Contributed by Alexander van der Vekens, 1-Aug-2018.) (New usage is discouraged.) (Proof modification is discouraged.)
|- ( ( N e. NN0 /\ 2 <_ N ) -> ( N - 1 ) e. NN )
3.4.11  Rational numbers (as a subset of complex numbers)
Syntax	cq 8554	Extend class notation to include the class of rationals.
class QQ
Definition	df-q 8555	Define the set of rational numbers. Based on definition of rationals in [Apostol] p. 22. See elq 8557 for the relation "is rational." (Contributed by NM, 8-Jan-2002.)
|- QQ = ( / " ( ZZ X. NN ) )
Theorem	divfnzn 8556	Division restricted to ZZ X. NN is a function. Given excluded middle, it would be easy to prove this for CC X. ( CC \ { 0 } ). The key difference is that an element of NN is apart from zero, whereas being an element of CC \ { 0 } implies being not equal to zero. (Contributed by Jim Kingdon, 19-Mar-2020.)
|- ( / |` ( ZZ X. NN ) ) Fn ( ZZ X. NN )
Theorem	elq 8557*	Membership in the set of rationals. (Contributed by NM, 8-Jan-2002.) (Revised by Mario Carneiro, 28-Jan-2014.)
|- ( A e. QQ <-> E. x e. ZZ E. y e. NN A = ( x / y ) )
Theorem	qmulz 8558*	If A is rational, then some integer multiple of it is an integer. (Contributed by NM, 7-Nov-2008.) (Revised by Mario Carneiro, 22-Jul-2014.)
|- ( A e. QQ -> E. x e. NN ( A x. x ) e. ZZ )
Theorem	znq 8559	The ratio of an integer and a positive integer is a rational number. (Contributed by NM, 12-Jan-2002.)
|- ( ( A e. ZZ /\ B e. NN ) -> ( A / B ) e. QQ )
Theorem	qre 8560	A rational number is a real number. (Contributed by NM, 14-Nov-2002.)
|- ( A e. QQ -> A e. RR )
Theorem	zq 8561	An integer is a rational number. (Contributed by NM, 9-Jan-2002.)
|- ( A e. ZZ -> A e. QQ )
Theorem	zssq 8562	The integers are a subset of the rationals. (Contributed by NM, 9-Jan-2002.)
|- ZZ C_ QQ
Theorem	nn0ssq 8563	The nonnegative integers are a subset of the rationals. (Contributed by NM, 31-Jul-2004.)
|- NN0 C_ QQ
Theorem	nnssq 8564	The positive integers are a subset of the rationals. (Contributed by NM, 31-Jul-2004.)
|- NN C_ QQ
Theorem	qssre 8565	The rationals are a subset of the reals. (Contributed by NM, 9-Jan-2002.)
|- QQ C_ RR
Theorem	qsscn 8566	The rationals are a subset of the complex numbers. (Contributed by NM, 2-Aug-2004.)
|- QQ C_ CC
Theorem	qex 8567	The set of rational numbers exists. (Contributed by NM, 30-Jul-2004.) (Revised by Mario Carneiro, 17-Nov-2014.)
|- QQ e. _V
Theorem	nnq 8568	A positive integer is rational. (Contributed by NM, 17-Nov-2004.)
|- ( A e. NN -> A e. QQ )
Theorem	qcn 8569	A rational number is a complex number. (Contributed by NM, 2-Aug-2004.)
|- ( A e. QQ -> A e. CC )
Theorem	qaddcl 8570	Closure of addition of rationals. (Contributed by NM, 1-Aug-2004.)
|- ( ( A e. QQ /\ B e. QQ ) -> ( A + B ) e. QQ )
Theorem	qnegcl 8571	Closure law for the negative of a rational. (Contributed by NM, 2-Aug-2004.) (Revised by Mario Carneiro, 15-Sep-2014.)
|- ( A e. QQ -> -u A e. QQ )
Theorem	qmulcl 8572	Closure of multiplication of rationals. (Contributed by NM, 1-Aug-2004.)
|- ( ( A e. QQ /\ B e. QQ ) -> ( A x. B ) e. QQ )
Theorem	qsubcl 8573	Closure of subtraction of rationals. (Contributed by NM, 2-Aug-2004.)
|- ( ( A e. QQ /\ B e. QQ ) -> ( A - B ) e. QQ )
Theorem	qapne 8574	Apartness is equivalent to not equal for rationals. (Contributed by Jim Kingdon, 20-Mar-2020.)
|- ( ( A e. QQ /\ B e. QQ ) -> ( A # B <-> A =/= B ) )
Theorem	qltlen 8575	Rational 'Less than' expressed in terms of 'less than or equal to'. Also see ltleap 7621 which is a similar result for real numbers. (Contributed by Jim Kingdon, 11-Oct-2021.)
|- ( ( A e. QQ /\ B e. QQ ) -> ( A < B <-> ( A <_ B /\ B =/= A ) ) )
Theorem	qreccl 8576	Closure of reciprocal of rationals. (Contributed by NM, 3-Aug-2004.)
|- ( ( A e. QQ /\ A =/= 0 ) -> ( 1 / A ) e. QQ )
Theorem	qdivcl 8577	Closure of division of rationals. (Contributed by NM, 3-Aug-2004.)
|- ( ( A e. QQ /\ B e. QQ /\ B =/= 0 ) -> ( A / B ) e. QQ )
Theorem	qrevaddcl 8578	Reverse closure law for addition of rationals. (Contributed by NM, 2-Aug-2004.)
|- ( B e. QQ -> ( ( A e. CC /\ ( A + B ) e. QQ ) <-> A e. QQ ) )
Theorem	nnrecq 8579	The reciprocal of a positive integer is rational. (Contributed by NM, 17-Nov-2004.)
|- ( A e. NN -> ( 1 / A ) e. QQ )
Theorem	irradd 8580	The sum of an irrational number and a rational number is irrational. (Contributed by NM, 7-Nov-2008.)
|- ( ( A e. ( RR \ QQ ) /\ B e. QQ ) -> ( A + B ) e. ( RR \ QQ ) )
Theorem	irrmul 8581	The product of a real which is not rational with a nonzero rational is not rational. Note that by "not rational" we mean the negation of "is rational" (whereas "irrational" is often defined to mean apart from any rational number - given excluded middle these two definitions would be equivalent). (Contributed by NM, 7-Nov-2008.)
|- ( ( A e. ( RR \ QQ ) /\ B e. QQ /\ B =/= 0 ) -> ( A x. B ) e. ( RR \ QQ ) )
3.4.12  Complex numbers as pairs of reals
Theorem	cnref1o 8582*	There is a natural one-to-one mapping from ( RR X. RR ) to CC, where we map <. x , y >. to ( x + ( _i x. y ) ). In our construction of the complex numbers, this is in fact our definition of CC (see df-c 6895), but in the axiomatic treatment we can only show that there is the expected mapping between these two sets. (Contributed by Mario Carneiro, 16-Jun-2013.) (Revised by Mario Carneiro, 17-Feb-2014.)
|- F = ( x e. RR , y e. RR |-> ( x + ( _i x. y ) ) )   =>    |- F : ( RR X. RR ) -1-1-onto-> CC
3.5  Order sets
3.5.1  Positive reals (as a subset of complex numbers)
Syntax	crp 8583	Extend class notation to include the class of positive reals.
class RR+
Definition	df-rp 8584	Define the set of positive reals. Definition of positive numbers in [Apostol] p. 20. (Contributed by NM, 27-Oct-2007.)
|- RR+ = { x e. RR | 0 < x }
Theorem	elrp 8585	Membership in the set of positive reals. (Contributed by NM, 27-Oct-2007.)
|- ( A e. RR+ <-> ( A e. RR /\ 0 < A ) )
Theorem	elrpii 8586	Membership in the set of positive reals. (Contributed by NM, 23-Feb-2008.)
|- A e. RR   &    |- 0 < A   =>    |- A e. RR+
Theorem	1rp 8587	1 is a positive real. (Contributed by Jeff Hankins, 23-Nov-2008.)
|- 1 e. RR+
Theorem	2rp 8588	2 is a positive real. (Contributed by Mario Carneiro, 28-May-2016.)
|- 2 e. RR+
Theorem	rpre 8589	A positive real is a real. (Contributed by NM, 27-Oct-2007.)
|- ( A e. RR+ -> A e. RR )
Theorem	rpxr 8590	A positive real is an extended real. (Contributed by Mario Carneiro, 21-Aug-2015.)
|- ( A e. RR+ -> A e. RR* )
Theorem	rpcn 8591	A positive real is a complex number. (Contributed by NM, 11-Nov-2008.)
|- ( A e. RR+ -> A e. CC )
Theorem	nnrp 8592	A positive integer is a positive real. (Contributed by NM, 28-Nov-2008.)
|- ( A e. NN -> A e. RR+ )
Theorem	rpssre 8593	The positive reals are a subset of the reals. (Contributed by NM, 24-Feb-2008.)
|- RR+ C_ RR
Theorem	rpgt0 8594	A positive real is greater than zero. (Contributed by FL, 27-Dec-2007.)
|- ( A e. RR+ -> 0 < A )
Theorem	rpge0 8595	A positive real is greater than or equal to zero. (Contributed by NM, 22-Feb-2008.)
|- ( A e. RR+ -> 0 <_ A )
Theorem	rpregt0 8596	A positive real is a positive real number. (Contributed by NM, 11-Nov-2008.) (Revised by Mario Carneiro, 31-Jan-2014.)
|- ( A e. RR+ -> ( A e. RR /\ 0 < A ) )
Theorem	rprege0 8597	A positive real is a nonnegative real number. (Contributed by Mario Carneiro, 31-Jan-2014.)
|- ( A e. RR+ -> ( A e. RR /\ 0 <_ A ) )
Theorem	rpne0 8598	A positive real is nonzero. (Contributed by NM, 18-Jul-2008.)
|- ( A e. RR+ -> A =/= 0 )
Theorem	rpap0 8599	A positive real is apart from zero. (Contributed by Jim Kingdon, 22-Mar-2020.)
|- ( A e. RR+ -> A # 0 )
Theorem	rprene0 8600	A positive real is a nonzero real number. (Contributed by NM, 11-Nov-2008.)
|- ( A e. RR+ -> ( A e. RR /\ A =/= 0 ) )