P. 137 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 13601-13700   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	logled 13601	Natural logarithm preserves <_. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR+ )   &    |- ( ph -> B e. RR+ )   =>    |- ( ph -> ( A <_ B <-> ( log ` A ) <_ ( log ` B ) ) )
Theorem	relogefd 13602	Relationship between the natural logarithm function and the exponential function. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   =>    |- ( ph -> ( log ` ( exp ` A ) ) = A )
Theorem	rplogcld 13603	Closure of the logarithm function in the positive reals. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 1 < A )   =>    |- ( ph -> ( log ` A ) e. RR+ )
Theorem	logge0d 13604	The logarithm of a number greater than 1 is nonnegative. (Contributed by Mario Carneiro, 29-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 1 <_ A )   =>    |- ( ph -> 0 <_ ( log ` A ) )
Theorem	logge0b 13605	The logarithm of a number is nonnegative iff the number is greater than or equal to 1. (Contributed by AV, 30-May-2020.)
|- ( A e. RR+ -> ( 0 <_ ( log ` A ) <-> 1 <_ A ) )
Theorem	loggt0b 13606	The logarithm of a number is positive iff the number is greater than 1. (Contributed by AV, 30-May-2020.)
|- ( A e. RR+ -> ( 0 < ( log ` A ) <-> 1 < A ) )
Theorem	logle1b 13607	The logarithm of a number is less than or equal to 1 iff the number is less than or equal to Euler's constant. (Contributed by AV, 30-May-2020.)
|- ( A e. RR+ -> ( ( log ` A ) <_ 1 <-> A <_ _e ) )
Theorem	loglt1b 13608	The logarithm of a number is less than 1 iff the number is less than Euler's constant. (Contributed by AV, 30-May-2020.)
|- ( A e. RR+ -> ( ( log ` A ) < 1 <-> A < _e ) )
Theorem	rpcxpef 13609	Value of the complex power function. (Contributed by Mario Carneiro, 2-Aug-2014.) (Revised by Jim Kingdon, 12-Jun-2024.)
|- ( ( A e. RR+ /\ B e. CC ) -> ( A ^c B ) = ( exp ` ( B x. ( log ` A ) ) ) )
Theorem	cxpexprp 13610	Relate the complex power function to the integer power function. (Contributed by Mario Carneiro, 2-Aug-2014.) (Revised by Jim Kingdon, 12-Jun-2024.)
|- ( ( A e. RR+ /\ B e. ZZ ) -> ( A ^c B ) = ( A ^ B ) )
Theorem	cxpexpnn 13611	Relate the complex power function to the integer power function. (Contributed by Mario Carneiro, 2-Aug-2014.) (Revised by Jim Kingdon, 12-Jun-2024.)
|- ( ( A e. NN /\ B e. ZZ ) -> ( A ^c B ) = ( A ^ B ) )
Theorem	logcxp 13612	Logarithm of a complex power. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( ( A e. RR+ /\ B e. RR ) -> ( log ` ( A ^c B ) ) = ( B x. ( log ` A ) ) )
Theorem	rpcxp0 13613	Value of the complex power function when the second argument is zero. (Contributed by Mario Carneiro, 2-Aug-2014.) (Revised by Jim Kingdon, 12-Jun-2024.)
|- ( A e. RR+ -> ( A ^c 0 ) = 1 )
Theorem	rpcxp1 13614	Value of the complex power function at one. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( A e. RR+ -> ( A ^c 1 ) = A )
Theorem	1cxp 13615	Value of the complex power function at one. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( A e. CC -> ( 1 ^c A ) = 1 )
Theorem	ecxp 13616	Write the exponential function as an exponent to the power _e. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( A e. CC -> ( _e ^c A ) = ( exp ` A ) )
Theorem	rpcncxpcl 13617	Closure of the complex power function. (Contributed by Jim Kingdon, 12-Jun-2024.)
|- ( ( A e. RR+ /\ B e. CC ) -> ( A ^c B ) e. CC )
Theorem	rpcxpcl 13618	Positive real closure of the complex power function. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( ( A e. RR+ /\ B e. RR ) -> ( A ^c B ) e. RR+ )
Theorem	cxpap0 13619	Complex exponentiation is apart from zero. (Contributed by Mario Carneiro, 2-Aug-2014.) (Revised by Jim Kingdon, 12-Jun-2024.)
|- ( ( A e. RR+ /\ B e. CC ) -> ( A ^c B ) # 0 )
Theorem	rpcxpadd 13620	Sum of exponents law for complex exponentiation. (Contributed by Mario Carneiro, 2-Aug-2014.) (Revised by Jim Kingdon, 13-Jun-2024.)
|- ( ( A e. RR+ /\ B e. CC /\ C e. CC ) -> ( A ^c ( B + C ) ) = ( ( A ^c B ) x. ( A ^c C ) ) )
Theorem	rpcxpp1 13621	Value of a nonzero complex number raised to a complex power plus one. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( ( A e. RR+ /\ B e. CC ) -> ( A ^c ( B + 1 ) ) = ( ( A ^c B ) x. A ) )
Theorem	rpcxpneg 13622	Value of a complex number raised to a negative power. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( ( A e. RR+ /\ B e. CC ) -> ( A ^c -u B ) = ( 1 / ( A ^c B ) ) )
Theorem	rpcxpsub 13623	Exponent subtraction law for complex exponentiation. (Contributed by Mario Carneiro, 22-Sep-2014.)
|- ( ( A e. RR+ /\ B e. CC /\ C e. CC ) -> ( A ^c ( B - C ) ) = ( ( A ^c B ) / ( A ^c C ) ) )
Theorem	rpmulcxp 13624	Complex exponentiation of a product. Proposition 10-4.2(c) of [Gleason] p. 135. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( ( A e. RR+ /\ B e. RR+ /\ C e. CC ) -> ( ( A x. B ) ^c C ) = ( ( A ^c C ) x. ( B ^c C ) ) )
Theorem	cxprec 13625	Complex exponentiation of a reciprocal. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( ( A e. RR+ /\ B e. CC ) -> ( ( 1 / A ) ^c B ) = ( 1 / ( A ^c B ) ) )
Theorem	rpdivcxp 13626	Complex exponentiation of a quotient. (Contributed by Mario Carneiro, 8-Sep-2014.)
|- ( ( A e. RR+ /\ B e. RR+ /\ C e. CC ) -> ( ( A / B ) ^c C ) = ( ( A ^c C ) / ( B ^c C ) ) )
Theorem	cxpmul 13627	Product of exponents law for complex exponentiation. Proposition 10-4.2(b) of [Gleason] p. 135. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( ( A e. RR+ /\ B e. RR /\ C e. CC ) -> ( A ^c ( B x. C ) ) = ( ( A ^c B ) ^c C ) )
Theorem	rpcxproot 13628	The complex power function allows us to write n-th roots via the idiom A ^c ( 1 / N ). (Contributed by Mario Carneiro, 6-May-2015.)
|- ( ( A e. RR+ /\ N e. NN ) -> ( ( A ^c ( 1 / N ) ) ^ N ) = A )
Theorem	abscxp 13629	Absolute value of a power, when the base is real. (Contributed by Mario Carneiro, 15-Sep-2014.)
|- ( ( A e. RR+ /\ B e. CC ) -> ( abs ` ( A ^c B ) ) = ( A ^c ( Re ` B ) ) )
Theorem	cxplt 13630	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( ( ( A e. RR /\ 1 < A ) /\ ( B e. RR /\ C e. RR ) ) -> ( B < C <-> ( A ^c B ) < ( A ^c C ) ) )
Theorem	cxple 13631	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 2-Aug-2014.)
|- ( ( ( A e. RR /\ 1 < A ) /\ ( B e. RR /\ C e. RR ) ) -> ( B <_ C <-> ( A ^c B ) <_ ( A ^c C ) ) )
Theorem	rpcxple2 13632	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 8-Sep-2014.)
|- ( ( A e. RR+ /\ B e. RR+ /\ C e. RR+ ) -> ( A <_ B <-> ( A ^c C ) <_ ( B ^c C ) ) )
Theorem	rpcxplt2 13633	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 15-Sep-2014.)
|- ( ( A e. RR+ /\ B e. RR+ /\ C e. RR+ ) -> ( A < B <-> ( A ^c C ) < ( B ^c C ) ) )
Theorem	cxplt3 13634	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 2-May-2016.)
|- ( ( ( A e. RR+ /\ A < 1 ) /\ ( B e. RR /\ C e. RR ) ) -> ( B < C <-> ( A ^c C ) < ( A ^c B ) ) )
Theorem	cxple3 13635	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 2-May-2016.)
|- ( ( ( A e. RR+ /\ A < 1 ) /\ ( B e. RR /\ C e. RR ) ) -> ( B <_ C <-> ( A ^c C ) <_ ( A ^c B ) ) )
Theorem	rpcxpsqrt 13636	The exponential function with exponent 1 / 2 exactly matches the square root function, and thus serves as a suitable generalization to other n-th roots and irrational roots. (Contributed by Mario Carneiro, 2-Aug-2014.) (Revised by Jim Kingdon, 16-Jun-2024.)
|- ( A e. RR+ -> ( A ^c ( 1 / 2 ) ) = ( sqr ` A ) )
Theorem	logsqrt 13637	Logarithm of a square root. (Contributed by Mario Carneiro, 5-May-2016.)
|- ( A e. RR+ -> ( log ` ( sqr ` A ) ) = ( ( log ` A ) / 2 ) )
Theorem	rpcxp0d 13638	Value of the complex power function when the second argument is zero. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR+ )   =>    |- ( ph -> ( A ^c 0 ) = 1 )
Theorem	rpcxp1d 13639	Value of the complex power function at one. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR+ )   =>    |- ( ph -> ( A ^c 1 ) = A )
Theorem	1cxpd 13640	Value of the complex power function at one. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. CC )   =>    |- ( ph -> ( 1 ^c A ) = 1 )
Theorem	rpcncxpcld 13641	Closure of the complex power function. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR+ )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( A ^c B ) e. CC )
Theorem	cxpltd 13642	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 1 < A )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   =>    |- ( ph -> ( B < C <-> ( A ^c B ) < ( A ^c C ) ) )
Theorem	cxpled 13643	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR )   &    |- ( ph -> 1 < A )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. RR )   =>    |- ( ph -> ( B <_ C <-> ( A ^c B ) <_ ( A ^c C ) ) )
Theorem	rpcxpsqrtth 13644	Square root theorem over the complex numbers for the complex power function. Compare with resqrtth 10995. (Contributed by AV, 23-Dec-2022.)
|- ( A e. RR+ -> ( ( sqr ` A ) ^c 2 ) = A )
Theorem	cxprecd 13645	Complex exponentiation of a reciprocal. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR+ )   &    |- ( ph -> B e. CC )   =>    |- ( ph -> ( ( 1 / A ) ^c B ) = ( 1 / ( A ^c B ) ) )
Theorem	rpcxpcld 13646	Positive real closure of the complex power function. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR+ )   &    |- ( ph -> B e. RR )   =>    |- ( ph -> ( A ^c B ) e. RR+ )
Theorem	logcxpd 13647	Logarithm of a complex power. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR+ )   &    |- ( ph -> B e. RR )   =>    |- ( ph -> ( log ` ( A ^c B ) ) = ( B x. ( log ` A ) ) )
Theorem	cxplt3d 13648	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR+ )   &    |- ( ph -> B e. RR )   &    |- ( ph -> A < 1 )   &    |- ( ph -> C e. RR )   =>    |- ( ph -> ( B < C <-> ( A ^c C ) < ( A ^c B ) ) )
Theorem	cxple3d 13649	Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR+ )   &    |- ( ph -> B e. RR )   &    |- ( ph -> A < 1 )   &    |- ( ph -> C e. RR )   =>    |- ( ph -> ( B <_ C <-> ( A ^c C ) <_ ( A ^c B ) ) )
Theorem	cxpmuld 13650	Product of exponents law for complex exponentiation. Proposition 10-4.2(b) of [Gleason] p. 135. (Contributed by Mario Carneiro, 30-May-2016.)
|- ( ph -> A e. RR+ )   &    |- ( ph -> B e. RR )   &    |- ( ph -> C e. CC )   =>    |- ( ph -> ( A ^c ( B x. C ) ) = ( ( A ^c B ) ^c C ) )
Theorem	cxpcom 13651	Commutative law for real exponentiation. (Contributed by AV, 29-Dec-2022.)
|- ( ( A e. RR+ /\ B e. RR /\ C e. RR ) -> ( ( A ^c B ) ^c C ) = ( ( A ^c C ) ^c B ) )
Theorem	apcxp2 13652	Apartness and real exponentiation. (Contributed by Jim Kingdon, 10-Jul-2024.)
|- ( ( ( A e. RR+ /\ A # 1 ) /\ ( B e. RR /\ C e. RR ) ) -> ( B # C <-> ( A ^c B ) # ( A ^c C ) ) )
Theorem	rpabscxpbnd 13653	Bound on the absolute value of a complex power. (Contributed by Mario Carneiro, 15-Sep-2014.) (Revised by Jim Kingdon, 19-Jun-2024.)
|- ( ph -> A e. RR+ )   &    |- ( ph -> B e. CC )   &    |- ( ph -> 0 < ( Re ` B ) )   &    |- ( ph -> M e. RR )   &    |- ( ph -> ( abs ` A ) <_ M )   =>    |- ( ph -> ( abs ` ( A ^c B ) ) <_ ( ( M ^c ( Re ` B ) ) x. ( exp ` ( ( abs ` B ) x. pi ) ) ) )
Theorem	ltexp2 13654	Ordering law for exponentiation. (Contributed by NM, 2-Aug-2006.) (Revised by Mario Carneiro, 5-Jun-2014.)
|- ( ( ( A e. RR /\ M e. ZZ /\ N e. ZZ ) /\ 1 < A ) -> ( M < N <-> ( A ^ M ) < ( A ^ N ) ) )
10.1.4  Logarithms to an arbitrary base Define "log using an arbitrary base" function and then prove some of its properties. As with df-relog 13573 this is for real logarithms rather than complex logarithms. Metamath doesn't care what letters are used to represent classes. Usually classes begin with the letter "A", but here we use "B" and "X" to more clearly distinguish between "base" and "other parameter of log". There are different ways this could be defined in Metamath. The approach used here is intentionally similar to existing 2-parameter Metamath functions (operations): ( B logb X ) where B is the base and X is the argument of the logarithm function. An alternative would be to support the notational form ( ( logb ` B ) ` X ); that looks a little more like traditional notation.
Syntax	clogb 13655	Extend class notation to include the logarithm generalized to an arbitrary base.
class logb
Definition	df-logb 13656*	Define the logb operator. This is the logarithm generalized to an arbitrary base. It can be used as ( B logb X ) for "log base B of X". In the most common traditional notation, base B is a subscript of "log". The definition will only be useful where x is a positive real apart from one and where y is a positive real, so the choice of ( CC \ { 0 , 1 } ) and ( CC \ { 0 } ) is somewhat arbitrary (we adopt the definition used in set.mm). (Contributed by David A. Wheeler, 21-Jan-2017.)
|- logb = ( x e. ( CC \ { 0 , 1 } ) , y e. ( CC \ { 0 } ) |-> ( ( log ` y ) / ( log ` x ) ) )
Theorem	rplogbval 13657	Define the value of the logb function, the logarithm generalized to an arbitrary base, when used as infix. Most Metamath statements select variables in order of their use, but to make the order clearer we use "B" for base and "X" for the argument of the logarithm function here. (Contributed by David A. Wheeler, 21-Jan-2017.) (Revised by Jim Kingdon, 3-Jul-2024.)
|- ( ( B e. RR+ /\ B # 1 /\ X e. RR+ ) -> ( B logb X ) = ( ( log ` X ) / ( log ` B ) ) )
Theorem	rplogbcl 13658	General logarithm closure. (Contributed by David A. Wheeler, 17-Jul-2017.)
|- ( ( B e. RR+ /\ B # 1 /\ X e. RR+ ) -> ( B logb X ) e. RR )
Theorem	rplogbid1 13659	General logarithm is 1 when base and arg match. Property 1(a) of [Cohen4] p. 361. (Contributed by Stefan O'Rear, 19-Sep-2014.) (Revised by David A. Wheeler, 22-Jul-2017.)
|- ( ( A e. RR+ /\ A # 1 ) -> ( A logb A ) = 1 )
Theorem	rplogb1 13660	The logarithm of 1 to an arbitrary base B is 0. Property 1(b) of [Cohen4] p. 361. See log1 13581. (Contributed by Stefan O'Rear, 19-Sep-2014.) (Revised by Thierry Arnoux, 27-Sep-2017.)
|- ( ( B e. RR+ /\ B # 1 ) -> ( B logb 1 ) = 0 )
Theorem	rpelogb 13661	The general logarithm of a number to the base being Euler's constant is the natural logarithm of the number. Put another way, using _e as the base in logb is the same as log. Definition in [Cohen4] p. 352. (Contributed by David A. Wheeler, 17-Oct-2017.) (Revised by David A. Wheeler and AV, 16-Jun-2020.)
|- ( A e. RR+ -> ( _e logb A ) = ( log ` A ) )
Theorem	rplogbchbase 13662	Change of base for logarithms. Property in [Cohen4] p. 367. (Contributed by AV, 11-Jun-2020.)
|- ( ( ( A e. RR+ /\ A # 1 ) /\ ( B e. RR+ /\ B # 1 ) /\ X e. RR+ ) -> ( A logb X ) = ( ( B logb X ) / ( B logb A ) ) )
Theorem	relogbval 13663	Value of the general logarithm with integer base. (Contributed by Thierry Arnoux, 27-Sep-2017.)
|- ( ( B e. ( ZZ>= ` 2 ) /\ X e. RR+ ) -> ( B logb X ) = ( ( log ` X ) / ( log ` B ) ) )
Theorem	relogbzcl 13664	Closure of the general logarithm with integer base on positive reals. (Contributed by Thierry Arnoux, 27-Sep-2017.) (Proof shortened by AV, 9-Jun-2020.)
|- ( ( B e. ( ZZ>= ` 2 ) /\ X e. RR+ ) -> ( B logb X ) e. RR )
Theorem	rplogbreexp 13665	Power law for the general logarithm for real powers: The logarithm of a positive real number to the power of a real number is equal to the product of the exponent and the logarithm of the base of the power. Property 4 of [Cohen4] p. 361. (Contributed by AV, 9-Jun-2020.)
|- ( ( ( B e. RR+ /\ B # 1 ) /\ C e. RR+ /\ E e. RR ) -> ( B logb ( C ^c E ) ) = ( E x. ( B logb C ) ) )
Theorem	rplogbzexp 13666	Power law for the general logarithm for integer powers: The logarithm of a positive real number to the power of an integer is equal to the product of the exponent and the logarithm of the base of the power. (Contributed by Stefan O'Rear, 19-Sep-2014.) (Revised by AV, 9-Jun-2020.)
|- ( ( ( B e. RR+ /\ B # 1 ) /\ C e. RR+ /\ N e. ZZ ) -> ( B logb ( C ^ N ) ) = ( N x. ( B logb C ) ) )
Theorem	rprelogbmul 13667	The logarithm of the product of two positive real numbers is the sum of logarithms. Property 2 of [Cohen4] p. 361. (Contributed by Stefan O'Rear, 19-Sep-2014.) (Revised by AV, 29-May-2020.)
|- ( ( ( B e. RR+ /\ B # 1 ) /\ ( A e. RR+ /\ C e. RR+ ) ) -> ( B logb ( A x. C ) ) = ( ( B logb A ) + ( B logb C ) ) )
Theorem	rprelogbmulexp 13668	The logarithm of the product of a positive real and a positive real number to the power of a real number is the sum of the logarithm of the first real number and the scaled logarithm of the second real number. (Contributed by AV, 29-May-2020.)
|- ( ( ( B e. RR+ /\ B # 1 ) /\ ( A e. RR+ /\ C e. RR+ /\ E e. RR ) ) -> ( B logb ( A x. ( C ^c E ) ) ) = ( ( B logb A ) + ( E x. ( B logb C ) ) ) )
Theorem	rprelogbdiv 13669	The logarithm of the quotient of two positive real numbers is the difference of logarithms. Property 3 of [Cohen4] p. 361. (Contributed by AV, 29-May-2020.)
|- ( ( ( B e. RR+ /\ B # 1 ) /\ ( A e. RR+ /\ C e. RR+ ) ) -> ( B logb ( A / C ) ) = ( ( B logb A ) - ( B logb C ) ) )
Theorem	relogbexpap 13670	Identity law for general logarithm: the logarithm of a power to the base is the exponent. Property 6 of [Cohen4] p. 361. (Contributed by Stefan O'Rear, 19-Sep-2014.) (Revised by AV, 9-Jun-2020.)
|- ( ( B e. RR+ /\ B # 1 /\ M e. ZZ ) -> ( B logb ( B ^ M ) ) = M )
Theorem	nnlogbexp 13671	Identity law for general logarithm with integer base. (Contributed by Stefan O'Rear, 19-Sep-2014.) (Revised by Thierry Arnoux, 27-Sep-2017.)
|- ( ( B e. ( ZZ>= ` 2 ) /\ M e. ZZ ) -> ( B logb ( B ^ M ) ) = M )
Theorem	logbrec 13672	Logarithm of a reciprocal changes sign. Particular case of Property 3 of [Cohen4] p. 361. (Contributed by Thierry Arnoux, 27-Sep-2017.)
|- ( ( B e. ( ZZ>= ` 2 ) /\ A e. RR+ ) -> ( B logb ( 1 / A ) ) = -u ( B logb A ) )
Theorem	logbleb 13673	The general logarithm function is monotone/increasing. See logleb 13590. (Contributed by Stefan O'Rear, 19-Oct-2014.) (Revised by AV, 31-May-2020.)
|- ( ( B e. ( ZZ>= ` 2 ) /\ X e. RR+ /\ Y e. RR+ ) -> ( X <_ Y <-> ( B logb X ) <_ ( B logb Y ) ) )
Theorem	logblt 13674	The general logarithm function is strictly monotone/increasing. Property 2 of [Cohen4] p. 377. See logltb 13589. (Contributed by Stefan O'Rear, 19-Oct-2014.) (Revised by Thierry Arnoux, 27-Sep-2017.)
|- ( ( B e. ( ZZ>= ` 2 ) /\ X e. RR+ /\ Y e. RR+ ) -> ( X < Y <-> ( B logb X ) < ( B logb Y ) ) )
Theorem	rplogbcxp 13675	Identity law for the general logarithm for real numbers. (Contributed by AV, 22-May-2020.)
|- ( ( B e. RR+ /\ B # 1 /\ X e. RR ) -> ( B logb ( B ^c X ) ) = X )
Theorem	rpcxplogb 13676	Identity law for the general logarithm. (Contributed by AV, 22-May-2020.)
|- ( ( B e. RR+ /\ B # 1 /\ X e. RR+ ) -> ( B ^c ( B logb X ) ) = X )
Theorem	relogbcxpbap 13677	The logarithm is the inverse of the exponentiation. Observation in [Cohen4] p. 348. (Contributed by AV, 11-Jun-2020.)
|- ( ( ( B e. RR+ /\ B # 1 ) /\ X e. RR+ /\ Y e. RR ) -> ( ( B logb X ) = Y <-> ( B ^c Y ) = X ) )
Theorem	logbgt0b 13678	The logarithm of a positive real number to a real base greater than 1 is positive iff the number is greater than 1. (Contributed by AV, 29-Dec-2022.)
|- ( ( A e. RR+ /\ ( B e. RR+ /\ 1 < B ) ) -> ( 0 < ( B logb A ) <-> 1 < A ) )
Theorem	logbgcd1irr 13679	The logarithm of an integer greater than 1 to an integer base greater than 1 is not rational if the argument and the base are relatively prime. For example, ( 2 logb 9 ) e. ( RR \ QQ ). (Contributed by AV, 29-Dec-2022.)
|- ( ( X e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) /\ ( X gcd B ) = 1 ) -> ( B logb X ) e. ( RR \ QQ ) )
Theorem	logbgcd1irraplemexp 13680	Lemma for logbgcd1irrap 13682. Apartness of X ^ N and B ^ M. (Contributed by Jim Kingdon, 11-Jul-2024.)
|- ( ph -> X e. ( ZZ>= ` 2 ) )   &    |- ( ph -> B e. ( ZZ>= ` 2 ) )   &    |- ( ph -> ( X gcd B ) = 1 )   &    |- ( ph -> M e. ZZ )   &    |- ( ph -> N e. NN )   =>    |- ( ph -> ( X ^ N ) # ( B ^ M ) )
Theorem	logbgcd1irraplemap 13681	Lemma for logbgcd1irrap 13682. The result, with the rational number expressed as numerator and denominator. (Contributed by Jim Kingdon, 9-Jul-2024.)
|- ( ph -> X e. ( ZZ>= ` 2 ) )   &    |- ( ph -> B e. ( ZZ>= ` 2 ) )   &    |- ( ph -> ( X gcd B ) = 1 )   &    |- ( ph -> M e. ZZ )   &    |- ( ph -> N e. NN )   =>    |- ( ph -> ( B logb X ) # ( M / N ) )
Theorem	logbgcd1irrap 13682	The logarithm of an integer greater than 1 to an integer base greater than 1 is irrational (in the sense of being apart from any rational number) if the argument and the base are relatively prime. For example, ( 2 logb 9 ) # Q where Q is rational. (Contributed by AV, 29-Dec-2022.)
|- ( ( ( X e. ( ZZ>= ` 2 ) /\ B e. ( ZZ>= ` 2 ) ) /\ ( ( X gcd B ) = 1 /\ Q e. QQ ) ) -> ( B logb X ) # Q )
Theorem	2logb9irr 13683	Example for logbgcd1irr 13679. The logarithm of nine to base two is not rational. Also see 2logb9irrap 13689 which says that it is irrational (in the sense of being apart from any rational number). (Contributed by AV, 29-Dec-2022.)
|- ( 2 logb 9 ) e. ( RR \ QQ )
Theorem	logbprmirr 13684	The logarithm of a prime to a different prime base is not rational. For example, ( 2 logb 3 ) e. ( RR \ QQ ) (see 2logb3irr 13685). (Contributed by AV, 31-Dec-2022.)
|- ( ( X e. Prime /\ B e. Prime /\ X =/= B ) -> ( B logb X ) e. ( RR \ QQ ) )
Theorem	2logb3irr 13685	Example for logbprmirr 13684. The logarithm of three to base two is not rational. (Contributed by AV, 31-Dec-2022.)
|- ( 2 logb 3 ) e. ( RR \ QQ )
Theorem	2logb9irrALT 13686	Alternate proof of 2logb9irr 13683: The logarithm of nine to base two is not rational. (Contributed by AV, 31-Dec-2022.) (Proof modification is discouraged.) (New usage is discouraged.)
|- ( 2 logb 9 ) e. ( RR \ QQ )
Theorem	sqrt2cxp2logb9e3 13687	The square root of two to the power of the logarithm of nine to base two is three. ( sqr ` 2 ) and ( 2 logb 9 ) are not rational (see sqrt2irr0 12118 resp. 2logb9irr 13683), satisfying the statement in 2irrexpq 13688. (Contributed by AV, 29-Dec-2022.)
|- ( ( sqr ` 2 ) ^c ( 2 logb 9 ) ) = 3
Theorem	2irrexpq 13688*	There exist real numbers a and b which are not rational such that ( a ^ b ) is rational. Statement in the Metamath book, section 1.1.5, footnote 27 on page 17, and the "constructive proof" for theorem 1.2 of [Bauer], p. 483. This is a constructive proof because it is based on two explicitly named non-rational numbers ( sqr ` 2 ) and ( 2 logb 9 ), see sqrt2irr0 12118, 2logb9irr 13683 and sqrt2cxp2logb9e3 13687. Therefore, this proof is acceptable/usable in intuitionistic logic. For a theorem which is the same but proves that a and b are irrational (in the sense of being apart from any rational number), see 2irrexpqap 13690. (Contributed by AV, 23-Dec-2022.)
|- E. a e. ( RR \ QQ ) E. b e. ( RR \ QQ ) ( a ^c b ) e. QQ
Theorem	2logb9irrap 13689	Example for logbgcd1irrap 13682. The logarithm of nine to base two is irrational (in the sense of being apart from any rational number). (Contributed by Jim Kingdon, 12-Jul-2024.)
|- ( Q e. QQ -> ( 2 logb 9 ) # Q )
Theorem	2irrexpqap 13690*	There exist real numbers a and b which are irrational (in the sense of being apart from any rational number) such that ( a ^ b ) is rational. Statement in the Metamath book, section 1.1.5, footnote 27 on page 17, and the "constructive proof" for theorem 1.2 of [Bauer], p. 483. This is a constructive proof because it is based on two explicitly named irrational numbers ( sqr ` 2 ) and ( 2 logb 9 ), see sqrt2irrap 12134, 2logb9irrap 13689 and sqrt2cxp2logb9e3 13687. Therefore, this proof is acceptable/usable in intuitionistic logic. (Contributed by Jim Kingdon, 12-Jul-2024.)
|- E. a e. RR E. b e. RR ( A. p e. QQ a # p /\ A. q e. QQ b # q /\ ( a ^c b ) e. QQ )
10.1.5  Quartic binomial expansion
Theorem	binom4 13691	Work out a quartic binomial. (You would think that by this point it would be faster to use binom 11447, but it turns out to be just as much work to put it into this form after clearing all the sums and calculating binomial coefficients.) (Contributed by Mario Carneiro, 6-May-2015.)
|- ( ( A e. CC /\ B e. CC ) -> ( ( A + B ) ^ 4 ) = ( ( ( A ^ 4 ) + ( 4 x. ( ( A ^ 3 ) x. B ) ) ) + ( ( 6 x. ( ( A ^ 2 ) x. ( B ^ 2 ) ) ) + ( ( 4 x. ( A x. ( B ^ 3 ) ) ) + ( B ^ 4 ) ) ) ) )
10.2  Basic number theory
10.2.1  Quadratic residues and the Legendre symbol If the congruence ( ( x ^ 2 ) mod p ) = ( n mod p ) has a solution we say that n is a quadratic residue mod p. If the congruence has no solution we say that n is a quadratic nonresidue mod p, see definition in [ApostolNT] p. 178. The Legendre symbol ( n /L p ) is defined in a way that its value is 1 if n is a quadratic residue mod p and -u 1 if n is a quadratic nonresidue mod p (and 0 if p divides n). Originally, the Legendre symbol ( N /L P ) was defined for odd primes P only (and arbitrary integers N) by Adrien-Marie Legendre in 1798, see definition in [ApostolNT] p. 179. It was generalized to be defined for any positive odd integer by Carl Gustav Jacob Jacobi in 1837 (therefore called "Jacobi symbol" since then), see definition in [ApostolNT] p. 188. Finally, it was generalized to be defined for any integer by Leopold Kronecker in 1885 (therefore called "Kronecker symbol" since then). The definition df-lgs 13693 for the "Legendre symbol" /L is actually the definition of the "Kronecker symbol". Since only one definition (and one class symbol) are provided in set.mm, the names "Legendre symbol", "Jacobi symbol" and "Kronecker symbol" are used synonymously for /L, but mostly it is called "Legendre symbol", even if it is used in the context of a "Jacobi symbol" or "Kronecker symbol".
Syntax	clgs 13692	Extend class notation with the Legendre symbol function.
class /L
Definition	df-lgs 13693*	Define the Legendre symbol (actually the Kronecker symbol, which extends the Legendre symbol to all integers, and also the Jacobi symbol, which restricts the Kronecker symbol to positive odd integers). See definition in [ApostolNT] p. 179 resp. definition in [ApostolNT] p. 188. (Contributed by Mario Carneiro, 4-Feb-2015.)
|- /L = ( a e. ZZ , n e. ZZ |-> if ( n = 0 , if ( ( a ^ 2 ) = 1 , 1 , 0 ) , ( if ( ( n < 0 /\ a < 0 ) , -u 1 , 1 ) x. ( seq 1 ( x. , ( m e. NN |-> if ( m e. Prime , ( if ( m = 2 , if ( 2 || a , 0 , if ( ( a mod 8 ) e. { 1 , 7 } , 1 , -u 1 ) ) , ( ( ( ( a ^ ( ( m - 1 ) / 2 ) ) + 1 ) mod m ) - 1 ) ) ^ ( m pCnt n ) ) , 1 ) ) ) ` ( abs ` n ) ) ) ) )
Theorem	zabsle1 13694	{ -u 1 , 0 , 1 } is the set of all integers with absolute value at most 1. (Contributed by AV, 13-Jul-2021.)
|- ( Z e. ZZ -> ( Z e. { -u 1 , 0 , 1 } <-> ( abs ` Z ) <_ 1 ) )
Theorem	lgslem1 13695	When a is coprime to the prime p, a ^ ( ( p - 1 ) / 2 ) is equivalent mod p to 1 or -u 1, and so adding 1 makes it equivalent to 0 or 2. (Contributed by Mario Carneiro, 4-Feb-2015.)
|- ( ( A e. ZZ /\ P e. ( Prime \ { 2 } ) /\ -. P || A ) -> ( ( ( A ^ ( ( P - 1 ) / 2 ) ) + 1 ) mod P ) e. { 0 , 2 } )
Theorem	lgslem2 13696	The set Z of all integers with absolute value at most 1 contains { -u 1 , 0 , 1 }. (Contributed by Mario Carneiro, 4-Feb-2015.)
|- Z = { x e. ZZ | ( abs ` x ) <_ 1 }   =>    |- ( -u 1 e. Z /\ 0 e. Z /\ 1 e. Z )
Theorem	lgslem3 13697*	The set Z of all integers with absolute value at most 1 is closed under multiplication. (Contributed by Mario Carneiro, 4-Feb-2015.)
|- Z = { x e. ZZ | ( abs ` x ) <_ 1 }   =>    |- ( ( A e. Z /\ B e. Z ) -> ( A x. B ) e. Z )
Theorem	lgslem4 13698*	Lemma for lgsfcl2 13701. (Contributed by Mario Carneiro, 4-Feb-2015.) (Proof shortened by AV, 19-Mar-2022.)
|- Z = { x e. ZZ | ( abs ` x ) <_ 1 }   =>    |- ( ( A e. ZZ /\ P e. ( Prime \ { 2 } ) ) -> ( ( ( ( A ^ ( ( P - 1 ) / 2 ) ) + 1 ) mod P ) - 1 ) e. Z )
Theorem	lgsval 13699*	Value of the Legendre symbol at an arbitrary integer. (Contributed by Mario Carneiro, 4-Feb-2015.)
|- F = ( n e. NN |-> if ( n e. Prime , ( if ( n = 2 , if ( 2 || A , 0 , if ( ( A mod 8 ) e. { 1 , 7 } , 1 , -u 1 ) ) , ( ( ( ( A ^ ( ( n - 1 ) / 2 ) ) + 1 ) mod n ) - 1 ) ) ^ ( n pCnt N ) ) , 1 ) )   =>    |- ( ( A e. ZZ /\ N e. ZZ ) -> ( A /L N ) = if ( N = 0 , if ( ( A ^ 2 ) = 1 , 1 , 0 ) , ( if ( ( N < 0 /\ A < 0 ) , -u 1 , 1 ) x. ( seq 1 ( x. , F ) ` ( abs ` N ) ) ) ) )
Theorem	lgsfvalg 13700*	Value of the function F which defines the Legendre symbol at the primes. (Contributed by Mario Carneiro, 4-Feb-2015.) (Revised by Jim Kingdon, 4-Nov-2024.)
|- F = ( n e. NN |-> if ( n e. Prime , ( if ( n = 2 , if ( 2 || A , 0 , if ( ( A mod 8 ) e. { 1 , 7 } , 1 , -u 1 ) ) , ( ( ( ( A ^ ( ( n - 1 ) / 2 ) ) + 1 ) mod n ) - 1 ) ) ^ ( n pCnt N ) ) , 1 ) )   =>    |- ( ( A e. ZZ /\ N e. NN /\ M e. NN ) -> ( F ` M ) = if ( M e. Prime , ( if ( M = 2 , if ( 2 || A , 0 , if ( ( A mod 8 ) e. { 1 , 7 } , 1 , -u 1 ) ) , ( ( ( ( A ^ ( ( M - 1 ) / 2 ) ) + 1 ) mod M ) - 1 ) ) ^ ( M pCnt N ) ) , 1 ) )