Home Intuitionistic Logic ExplorerTheorem List (p. 108 of 111) < Previous  Next > Browser slow? Try the Unicode version. Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 10701-10800   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremmulgcddvds 10701 One half of rpmulgcd2 10702, which does not need the coprimality assumption. (Contributed by Mario Carneiro, 2-Jul-2015.)

Theoremrpmulgcd2 10702 If is relatively prime to , then the GCD of with is the product of the GCDs with and respectively. (Contributed by Mario Carneiro, 2-Jul-2015.)

Theoremqredeq 10703 Two equal reduced fractions have the same numerator and denominator. (Contributed by Jeff Hankins, 29-Sep-2013.)

Theoremqredeu 10704* Every rational number has a unique reduced form. (Contributed by Jeff Hankins, 29-Sep-2013.)

Theoremrpmul 10705 If is relatively prime to and to , it is also relatively prime to their product. (Contributed by Mario Carneiro, 24-Feb-2014.) (Proof shortened by Mario Carneiro, 2-Jul-2015.)

Theoremrpdvds 10706 If is relatively prime to then it is also relatively prime to any divisor of . (Contributed by Mario Carneiro, 19-Jun-2015.)

4.1.10  Cancellability of congruences

Theoremcongr 10707* Definition of congruence by integer multiple (see ProofWiki "Congruence (Number Theory)", 11-Jul-2021, https://proofwiki.org/wiki/Definition:Congruence_(Number_Theory)): An integer is congruent to an integer modulo if their difference is a multiple of . See also the definition in [ApostolNT] p. 104: "... is congruent to modulo , and we write (mod ) if divides the difference ", or Wikipedia "Modular arithmetic - Congruence", https://en.wikipedia.org/wiki/Modular_arithmetic#Congruence, 11-Jul-2021,: "Given an integer n > 1, called a modulus, two integers are said to be congruent modulo n, if n is a divisor of their difference (i.e., if there is an integer k such that a-b = kn)". (Contributed by AV, 11-Jul-2021.)

Theoremdivgcdcoprm0 10708 Integers divided by gcd are coprime. (Contributed by AV, 12-Jul-2021.)

Theoremdivgcdcoprmex 10709* Integers divided by gcd are coprime (see ProofWiki "Integers Divided by GCD are Coprime", 11-Jul-2021, https://proofwiki.org/wiki/Integers_Divided_by_GCD_are_Coprime): Any pair of integers, not both zero, can be reduced to a pair of coprime ones by dividing them by their gcd. (Contributed by AV, 12-Jul-2021.)

Theoremcncongr1 10710 One direction of the bicondition in cncongr 10712. Theorem 5.4 in [ApostolNT] p. 109. (Contributed by AV, 13-Jul-2021.)

Theoremcncongr2 10711 The other direction of the bicondition in cncongr 10712. (Contributed by AV, 11-Jul-2021.)

Theoremcncongr 10712 Cancellability of Congruences (see ProofWiki "Cancellability of Congruences, https://proofwiki.org/wiki/Cancellability_of_Congruences, 10-Jul-2021): Two products with a common factor are congruent modulo a positive integer iff the other factors are congruent modulo the integer divided by the greates common divisor of the integer and the common factor. See also Theorem 5.4 "Cancellation law" in [ApostolNT] p. 109. (Contributed by AV, 13-Jul-2021.)

Theoremcncongrcoprm 10713 Corollary 1 of Cancellability of Congruences: Two products with a common factor are congruent modulo an integer being coprime to the common factor iff the other factors are congruent modulo the integer. (Contributed by AV, 13-Jul-2021.)

4.2  Elementary prime number theory

4.2.1  Elementary properties

Remark: to represent odd prime numbers, i.e., all prime numbers except , the idiom is used. It is a little bit shorter than . Both representations can be converted into each other by eldifsn 3535.

Syntaxcprime 10714 Extend the definition of a class to include the set of prime numbers.

Definitiondf-prm 10715* Define the set of prime numbers. (Contributed by Paul Chapman, 22-Jun-2011.)

Theoremisprm 10716* The predicate "is a prime number". A prime number is a positive integer with exactly two positive divisors. (Contributed by Paul Chapman, 22-Jun-2011.)

Theoremprmnn 10717 A prime number is a positive integer. (Contributed by Paul Chapman, 22-Jun-2011.)

Theoremprmz 10718 A prime number is an integer. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by Jonathan Yan, 16-Jul-2017.)

Theoremprmssnn 10719 The prime numbers are a subset of the positive integers. (Contributed by AV, 22-Jul-2020.)

Theoremprmex 10720 The set of prime numbers exists. (Contributed by AV, 22-Jul-2020.)

Theorem1nprm 10721 1 is not a prime number. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by Fan Zheng, 3-Jul-2016.)

Theorem1idssfct 10722* The positive divisors of a positive integer include 1 and itself. (Contributed by Paul Chapman, 22-Jun-2011.)

Theoremisprm2lem 10723* Lemma for isprm2 10724. (Contributed by Paul Chapman, 22-Jun-2011.)

Theoremisprm2 10724* The predicate "is a prime number". A prime number is an integer greater than or equal to 2 whose only positive divisors are 1 and itself. Definition in [ApostolNT] p. 16. (Contributed by Paul Chapman, 26-Oct-2012.)

Theoremisprm3 10725* The predicate "is a prime number". A prime number is an integer greater than or equal to 2 with no divisors strictly between 1 and itself. (Contributed by Paul Chapman, 26-Oct-2012.)

Theoremisprm4 10726* The predicate "is a prime number". A prime number is an integer greater than or equal to 2 whose only divisor greater than or equal to 2 is itself. (Contributed by Paul Chapman, 26-Oct-2012.)

Theoremprmind2 10727* A variation on prmind 10728 assuming complete induction for primes. (Contributed by Mario Carneiro, 20-Jun-2015.)

Theoremprmind 10728* Perform induction over the multiplicative structure of . If a property holds for the primes and and is preserved under multiplication, then it holds for every positive integer. (Contributed by Mario Carneiro, 20-Jun-2015.)

Theoremdvdsprime 10729 If divides a prime, then is either the prime or one. (Contributed by Scott Fenton, 8-Apr-2014.)

Theoremnprm 10730 A product of two integers greater than one is composite. (Contributed by Mario Carneiro, 20-Jun-2015.)

Theoremnprmi 10731 An inference for compositeness. (Contributed by Mario Carneiro, 18-Feb-2014.) (Revised by Mario Carneiro, 20-Jun-2015.)

Theoremdvdsnprmd 10732 If a number is divisible by an integer greater than 1 and less then the number, the number is not prime. (Contributed by AV, 24-Jul-2021.)

Theoremprm2orodd 10733 A prime number is either 2 or odd. (Contributed by AV, 19-Jun-2021.)

Theorem2prm 10734 2 is a prime number. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by Fan Zheng, 16-Jun-2016.)

Theorem3prm 10735 3 is a prime number. (Contributed by Paul Chapman, 22-Jun-2011.)

Theorem4nprm 10736 4 is not a prime number. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by Mario Carneiro, 18-Feb-2014.)

Theoremprmuz2 10737 A prime number is an integer greater than or equal to 2. (Contributed by Paul Chapman, 17-Nov-2012.)

Theoremprmgt1 10738 A prime number is an integer greater than 1. (Contributed by Alexander van der Vekens, 17-May-2018.)

Theoremprmm2nn0 10739 Subtracting 2 from a prime number results in a nonnegative integer. (Contributed by Alexander van der Vekens, 30-Aug-2018.)

Theoremoddprmgt2 10740 An odd prime is greater than 2. (Contributed by AV, 20-Aug-2021.)

Theoremoddprmge3 10741 An odd prime is greater than or equal to 3. (Contributed by Alexander van der Vekens, 7-Oct-2018.) (Revised by AV, 20-Aug-2021.)

Theoremsqnprm 10742 A square is never prime. (Contributed by Mario Carneiro, 20-Jun-2015.)

Theoremdvdsprm 10743 An integer greater than or equal to 2 divides a prime number iff it is equal to it. (Contributed by Paul Chapman, 26-Oct-2012.)

Theoremexprmfct 10744* Every integer greater than or equal to 2 has a prime factor. (Contributed by Paul Chapman, 26-Oct-2012.) (Proof shortened by Mario Carneiro, 20-Jun-2015.)

Theoremprmdvdsfz 10745* Each integer greater than 1 and less then or equal to a fixed number is divisible by a prime less then or equal to this fixed number. (Contributed by AV, 15-Aug-2020.)

Theoremnprmdvds1 10746 No prime number divides 1. (Contributed by Paul Chapman, 17-Nov-2012.) (Proof shortened by Mario Carneiro, 2-Jul-2015.)

Theoremdivgcdodd 10747 Either is odd or is odd. (Contributed by Scott Fenton, 19-Apr-2014.)

4.2.2  Coprimality and Euclid's lemma (cont.)

This section is about coprimality with respect to primes, and a special version of Euclid's lemma for primes is provided, see euclemma 10750.

Theoremcoprm 10748 A prime number either divides an integer or is coprime to it, but not both. Theorem 1.8 in [ApostolNT] p. 17. (Contributed by Paul Chapman, 22-Jun-2011.)

Theoremprmrp 10749 Unequal prime numbers are relatively prime. (Contributed by Mario Carneiro, 23-Feb-2014.)

Theoremeuclemma 10750 Euclid's lemma. A prime number divides the product of two integers iff it divides at least one of them. Theorem 1.9 in [ApostolNT] p. 17. (Contributed by Paul Chapman, 17-Nov-2012.)

Theoremisprm6 10751* A number is prime iff it satisfies Euclid's lemma euclemma 10750. (Contributed by Mario Carneiro, 6-Sep-2015.)

Theoremprmdvdsexp 10752 A prime divides a positive power of an integer iff it divides the integer. (Contributed by Mario Carneiro, 24-Feb-2014.) (Revised by Mario Carneiro, 17-Jul-2014.)

Theoremprmdvdsexpb 10753 A prime divides a positive power of another iff they are equal. (Contributed by Paul Chapman, 30-Nov-2012.) (Revised by Mario Carneiro, 24-Feb-2014.)

Theoremprmdvdsexpr 10754 If a prime divides a nonnegative power of another, then they are equal. (Contributed by Mario Carneiro, 16-Jan-2015.)

Theoremprmexpb 10755 Two positive prime powers are equal iff the primes and the powers are equal. (Contributed by Paul Chapman, 30-Nov-2012.)

Theoremprmfac1 10756 The factorial of a number only contains primes less than the base. (Contributed by Mario Carneiro, 6-Mar-2014.)

Theoremrpexp 10757 If two numbers and are relatively prime, then they are still relatively prime if raised to a power. (Contributed by Mario Carneiro, 24-Feb-2014.)

Theoremrpexp1i 10758 Relative primality passes to asymmetric powers. (Contributed by Stefan O'Rear, 27-Sep-2014.)

Theoremrpexp12i 10759 Relative primality passes to symmetric powers. (Contributed by Stefan O'Rear, 27-Sep-2014.)

Theoremprmndvdsfaclt 10760 A prime number does not divide the factorial of a nonnegative integer less than the prime number. (Contributed by AV, 13-Jul-2021.)

Theoremcncongrprm 10761 Corollary 2 of Cancellability of Congruences: Two products with a common factor are congruent modulo a prime number not dividing the common factor iff the other factors are congruent modulo the prime number. (Contributed by AV, 13-Jul-2021.)

Theoremisevengcd2 10762 The predicate "is an even number". An even number and 2 have 2 as greatest common divisor. (Contributed by AV, 1-Jul-2020.) (Revised by AV, 8-Aug-2021.)

Theoremisoddgcd1 10763 The predicate "is an odd number". An odd number and 2 have 1 as greatest common divisor. (Contributed by AV, 1-Jul-2020.) (Revised by AV, 8-Aug-2021.)

Theorem3lcm2e6 10764 The least common multiple of three and two is six. The operands are unequal primes and thus coprime, so the result is (the absolute value of) their product. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 27-Aug-2020.)
lcm

4.2.3  Non-rationality of square root of 2

Theoremsqrt2irrlem 10765 Lemma for sqrt2irr 10766. This is the core of the proof: - if , then and are even, so and are smaller representatives, which is absurd by the method of infinite descent (here implemented by strong induction). (Contributed by NM, 20-Aug-2001.) (Revised by Mario Carneiro, 12-Sep-2015.)

Theoremsqrt2irr 10766 The square root of 2 is not rational. That is, for any rational number, does not equal it. However, if we were to say "the square root of 2 is irrational" that would mean something stronger: "for any rational number, is apart from it" (the two statements are equivalent given excluded middle). See sqrt2irrap 10783 for the proof that the square root of two is irrational.

The proof's core is proven in sqrt2irrlem 10765, which shows that if , then and are even, so and are smaller representatives, which is absurd. (Contributed by NM, 8-Jan-2002.) (Proof shortened by Mario Carneiro, 12-Sep-2015.)

Theoremsqrt2re 10767 The square root of 2 exists and is a real number. (Contributed by NM, 3-Dec-2004.)

Theorempw2dvdslemn 10768* Lemma for pw2dvds 10769. If a natural number has some power of two which does not divide it, there is a highest power of two which does divide it. (Contributed by Jim Kingdon, 14-Nov-2021.)

Theorempw2dvds 10769* A natural number has a highest power of two which divides it. (Contributed by Jim Kingdon, 14-Nov-2021.)

Theorempw2dvdseulemle 10770 Lemma for pw2dvdseu 10771. Powers of two which do and do not divide a natural number. (Contributed by Jim Kingdon, 17-Nov-2021.)

Theorempw2dvdseu 10771* A natural number has a unique highest power of two which divides it. (Contributed by Jim Kingdon, 16-Nov-2021.)

Theoremoddpwdclemxy 10772* Lemma for oddpwdc 10777. Another way of stating that decomposing a natural number into a power of two and an odd number is unique. (Contributed by Jim Kingdon, 16-Nov-2021.)

Theoremoddpwdclemdvds 10773* Lemma for oddpwdc 10777. A natural number is divisible by the highest power of two which divides it. (Contributed by Jim Kingdon, 17-Nov-2021.)

Theoremoddpwdclemndvds 10774* Lemma for oddpwdc 10777. A natural number is not divisible by one more than the highest power of two which divides it. (Contributed by Jim Kingdon, 17-Nov-2021.)

Theoremoddpwdclemodd 10775* Lemma for oddpwdc 10777. Removing the powers of two from a natural number produces an odd number. (Contributed by Jim Kingdon, 16-Nov-2021.)

Theoremoddpwdclemdc 10776* Lemma for oddpwdc 10777. Decomposing a number into odd and even parts. (Contributed by Jim Kingdon, 16-Nov-2021.)

Theoremoddpwdc 10777* The function that decomposes a number into its "odd" and "even" parts, which is to say the largest power of two and largest odd divisor of a number, is a bijection from pairs of a nonnegative integer and an odd number to positive integers. (Contributed by Thierry Arnoux, 15-Aug-2017.)

Theoremsqpweven 10778* The greatest power of two dividing the square of an integer is an even power of two. (Contributed by Jim Kingdon, 17-Nov-2021.)

Theorem2sqpwodd 10779* The greatest power of two dividing twice the square of an integer is an odd power of two. (Contributed by Jim Kingdon, 17-Nov-2021.)

Theoremsqne2sq 10780 The square of a natural number can never be equal to two times the square of a natural number. (Contributed by Jim Kingdon, 17-Nov-2021.)

Theoremznege1 10781 The absolute value of the difference between two unequal integers is at least one. (Contributed by Jim Kingdon, 31-Jan-2022.)

Theoremsqrt2irraplemnn 10782 Lemma for sqrt2irrap 10783. The square root of 2 is apart from a positive rational expressed as a numerator and denominator. (Contributed by Jim Kingdon, 2-Oct-2021.)
#

Theoremsqrt2irrap 10783 The square root of 2 is irrational. That is, for any rational number, is apart from it. In the absence of excluded middle, we can distinguish between this and "the square root of 2 is not rational" which is sqrt2irr 10766. (Contributed by Jim Kingdon, 2-Oct-2021.)
#

4.2.4  Properties of the canonical representation of a rational

Syntaxcnumer 10784 Extend class notation to include canonical numerator function.
numer

Syntaxcdenom 10785 Extend class notation to include canonical denominator function.
denom

Definitiondf-numer 10786* The canonical numerator of a rational is the numerator of the rational's reduced fraction representation (no common factors, denominator positive). (Contributed by Stefan O'Rear, 13-Sep-2014.)
numer

Definitiondf-denom 10787* The canonical denominator of a rational is the denominator of the rational's reduced fraction representation (no common factors, denominator positive). (Contributed by Stefan O'Rear, 13-Sep-2014.)
denom

Theoremqnumval 10788* Value of the canonical numerator function. (Contributed by Stefan O'Rear, 13-Sep-2014.)
numer

Theoremqdenval 10789* Value of the canonical denominator function. (Contributed by Stefan O'Rear, 13-Sep-2014.)
denom

Theoremqnumdencl 10790 Lemma for qnumcl 10791 and qdencl 10792. (Contributed by Stefan O'Rear, 13-Sep-2014.)
numer denom

Theoremqnumcl 10791 The canonical numerator of a rational is an integer. (Contributed by Stefan O'Rear, 13-Sep-2014.)
numer

Theoremqdencl 10792 The canonical denominator is a positive integer. (Contributed by Stefan O'Rear, 13-Sep-2014.)
denom

Theoremfnum 10793 Canonical numerator defines a function. (Contributed by Stefan O'Rear, 13-Sep-2014.)
numer

Theoremfden 10794 Canonical denominator defines a function. (Contributed by Stefan O'Rear, 13-Sep-2014.)
denom

Theoremqnumdenbi 10795 Two numbers are the canonical representation of a rational iff they are coprime and have the right quotient. (Contributed by Stefan O'Rear, 13-Sep-2014.)
numer denom

Theoremqnumdencoprm 10796 The canonical representation of a rational is fully reduced. (Contributed by Stefan O'Rear, 13-Sep-2014.)
numer denom

Theoremqeqnumdivden 10797 Recover a rational number from its canonical representation. (Contributed by Stefan O'Rear, 13-Sep-2014.)
numer denom

Theoremqmuldeneqnum 10798 Multiplying a rational by its denominator results in an integer. (Contributed by Stefan O'Rear, 13-Sep-2014.)
denom numer

Theoremdivnumden 10799 Calculate the reduced form of a quotient using . (Contributed by Stefan O'Rear, 13-Sep-2014.)
numer denom

Theoremdivdenle 10800 Reducing a quotient never increases the denominator. (Contributed by Stefan O'Rear, 13-Sep-2014.)
denom

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11080
 Copyright terms: Public domain < Previous  Next >