HomeHome Intuitionistic Logic Explorer
Theorem List (p. 102 of 106)
< 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 - 10101-10200   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremclimcaucn 10101* A converging sequence of complex numbers is a Cauchy sequence. This is like climcau 10097 but adds the part that  ( F `  k ) is complex. (Contributed by Jim Kingdon, 24-Aug-2021.)
 |-  Z  =  ( ZZ>= `  M )   =>    |-  ( ( M  e.  ZZ  /\  F  e.  dom  ~~>  ) 
 ->  A. x  e.  RR+  E. j  e.  Z  A. k  e.  ( ZZ>= `  j ) ( ( F `  k )  e.  CC  /\  ( abs `  ( ( F `
  k )  -  ( F `  j ) ) )  <  x ) )
 
Theoremserif0 10102* If an infinite series converges, its underlying sequence converges to zero. (Contributed by NM, 2-Sep-2005.) (Revised by Mario Carneiro, 16-Feb-2014.)
 |-  Z  =  ( ZZ>= `  M )   &    |-  ( ph  ->  M  e.  ZZ )   &    |-  ( ph  ->  F  e.  V )   &    |-  ( ph  ->  seq M (  +  ,  F ,  CC )  e.  dom  ~~>  )   &    |-  ( ( ph  /\  k  e.  Z )  ->  ( F `  k )  e. 
 CC )   =>    |-  ( ph  ->  F  ~~>  0 )
 
3.8.2  Finite and infinite sums
 
Syntaxcsu 10103 Extend class notation to include finite summations. (An underscore was added to the ASCII token in order to facilitate set.mm text searches, since "sum" is a commonly used word in comments.)
 class  sum_ k  e.  A  B
 
Definitiondf-sum 10104* Define the sum of a series with an index set of integers  A.  k is normally a free variable in  B, i.e.  B can be thought of as  B ( k ). This definition is the result of a collection of discussions over the most general definition for a sum that does not need the index set to have a specified ordering. This definition is in two parts, one for finite sums and one for subsets of the upper integers. When summing over a subset of the upper integers, we extend the index set to the upper integers by adding zero outside the domain, and then sum the set in order, setting the result to the limit of the partial sums, if it exists. This means that conditionally convergent sums can be evaluated meaningfully. For finite sums, we are explicitly order-independent, by picking any bijection to a 1-based finite sequence and summing in the induced order. These two methods of summation produce the same result on their common region of definition (i.e. finite subsets of the upper integers). Examples:  sum_ k  e. 
{ 1 ,  2 ,  4 }  k means  1  +  2  + 
4  =  7, and  sum_ k  e.  NN  ( 1  / 
( 2 ^ k
) )  =  1 means 1/2 + 1/4 + 1/8 + ... = 1. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 13-Jun-2019.)
 |- 
 sum_ k  e.  A  B  =  ( iota x ( E. m  e. 
 ZZ  ( A  C_  ( ZZ>= `  m )  /\  seq m (  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) ,  CC )  ~~>  x )  \/  E. m  e.  NN  E. f ( f : ( 1
 ... m ) -1-1-onto-> A  /\  x  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  [_ (
 f `  n )  /  k ]_ B ) ,  CC ) `  m ) ) ) )
 
Theoremsumeq1 10105 Equality theorem for a sum. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 13-Jun-2019.)
 |-  ( A  =  B  -> 
 sum_ k  e.  A  C  =  sum_ k  e.  B  C )
 
Theoremnfsum1 10106 Bound-variable hypothesis builder for sum. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 13-Jun-2019.)
 |-  F/_ k A   =>    |-  F/_ k sum_ k  e.  A  B
 
Theoremnfsum 10107 Bound-variable hypothesis builder for sum: if  x is (effectively) not free in  A and  B, it is not free in  sum_ k  e.  A B. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 13-Jun-2019.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  F/_ x sum_ k  e.  A  B
 
PART 4  ELEMENTARY NUMBER THEORY

Here we introduce elementary number theory, in particular the elementary properties of divisibility and elementary prime number theory.

 
4.1  Elementary properties of divisibility
 
4.1.1  The divides relation
 
Syntaxcdvds 10108 Extend the definition of a class to include the divides relation. See df-dvds 10109.
 class  ||
 
Definitiondf-dvds 10109* Define the divides relation, see definition in [ApostolNT] p. 14. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ||  =  { <. x ,  y >.  |  ( ( x  e.  ZZ  /\  y  e.  ZZ )  /\  E. n  e.  ZZ  ( n  x.  x )  =  y ) }
 
Theoremdivides 10110* Define the divides relation.  M  ||  N means  M divides into  N with no remainder. For example,  3  ||  6 (ex-dvds 10283). As proven in dvdsval3 10112, 
M  ||  N  <->  ( N  mod  M )  =  0. See divides 10110 and dvdsval2 10111 for other equivalent expressions. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <-> 
 E. n  e.  ZZ  ( n  x.  M )  =  N )
 )
 
Theoremdvdsval2 10111 One nonzero integer divides another integer if and only if their quotient is an integer. (Contributed by Jeff Hankins, 29-Sep-2013.)
 |-  ( ( M  e.  ZZ  /\  M  =/=  0  /\  N  e.  ZZ )  ->  ( M  ||  N  <->  ( N  /  M )  e.  ZZ ) )
 
Theoremdvdsval3 10112 One nonzero integer divides another integer if and only if the remainder upon division is zero, see remark in [ApostolNT] p. 106. (Contributed by Mario Carneiro, 22-Feb-2014.) (Revised by Mario Carneiro, 15-Jul-2014.)
 |-  ( ( M  e.  NN  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <->  ( N  mod  M )  =  0 )
 )
 
Theoremdvdszrcl 10113 Reverse closure for the divisibility relation. (Contributed by Stefan O'Rear, 5-Sep-2015.)
 |-  ( X  ||  Y  ->  ( X  e.  ZZ  /\  Y  e.  ZZ )
 )
 
Theoremnndivdvds 10114 Strong form of dvdsval2 10111 for positive integers. (Contributed by Stefan O'Rear, 13-Sep-2014.)
 |-  ( ( A  e.  NN  /\  B  e.  NN )  ->  ( B  ||  A 
 <->  ( A  /  B )  e.  NN )
 )
 
Theoremnndivides 10115* Definition of the divides relation for positive integers. (Contributed by AV, 26-Jul-2021.)
 |-  ( ( M  e.  NN  /\  N  e.  NN )  ->  ( M  ||  N 
 <-> 
 E. n  e.  NN  ( n  x.  M )  =  N )
 )
 
Theoremdvdsdc 10116 Divisibility is decidable. (Contributed by Jim Kingdon, 14-Nov-2021.)
 |-  ( ( M  e.  NN  /\  N  e.  ZZ )  -> DECID  M  ||  N )
 
Theoremmoddvds 10117 Two ways to say  A  ==  B (mod  N), see also definition in [ApostolNT] p. 106. (Contributed by Mario Carneiro, 18-Feb-2014.)
 |-  ( ( N  e.  NN  /\  A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( A  mod  N )  =  ( B 
 mod  N )  <->  N  ||  ( A  -  B ) ) )
 
Theoremdvds0lem 10118 A lemma to assist theorems of 
|| with no antecedents. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( K  x.  M )  =  N )  ->  M  ||  N )
 
Theoremdvds1lem 10119* A lemma to assist theorems of 
|| with one antecedent. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ph  ->  ( J  e.  ZZ  /\  K  e.  ZZ ) )   &    |-  ( ph  ->  ( M  e.  ZZ  /\  N  e.  ZZ ) )   &    |-  ( ( ph  /\  x  e.  ZZ )  ->  Z  e.  ZZ )   &    |-  (
 ( ph  /\  x  e. 
 ZZ )  ->  (
 ( x  x.  J )  =  K  ->  ( Z  x.  M )  =  N ) )   =>    |-  ( ph  ->  ( J  ||  K  ->  M  ||  N ) )
 
Theoremdvds2lem 10120* A lemma to assist theorems of 
|| with two antecedents. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ph  ->  ( I  e.  ZZ  /\  J  e.  ZZ ) )   &    |-  ( ph  ->  ( K  e.  ZZ  /\  L  e.  ZZ ) )   &    |-  ( ph  ->  ( M  e.  ZZ  /\  N  e.  ZZ )
 )   &    |-  ( ( ph  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  ->  Z  e.  ZZ )   &    |-  (
 ( ph  /\  ( x  e.  ZZ  /\  y  e.  ZZ ) )  ->  ( ( ( x  x.  I )  =  J  /\  ( y  x.  K )  =  L )  ->  ( Z  x.  M )  =  N ) )   =>    |-  ( ph  ->  ( ( I  ||  J  /\  K  ||  L )  ->  M  ||  N )
 )
 
Theoremiddvds 10121 An integer divides itself. Theorem 1.1(a) in [ApostolNT] p. 14 (reflexive property of the divides relation). (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( N  e.  ZZ  ->  N  ||  N )
 
Theorem1dvds 10122 1 divides any integer. Theorem 1.1(f) in [ApostolNT] p. 14. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( N  e.  ZZ  ->  1  ||  N )
 
Theoremdvds0 10123 Any integer divides 0. Theorem 1.1(g) in [ApostolNT] p. 14. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( N  e.  ZZ  ->  N  ||  0 )
 
Theoremnegdvdsb 10124 An integer divides another iff its negation does. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <->  -u M  ||  N ) )
 
Theoremdvdsnegb 10125 An integer divides another iff it divides its negation. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <->  M  ||  -u N ) )
 
Theoremabsdvdsb 10126 An integer divides another iff its absolute value does. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <->  ( abs `  M )  ||  N ) )
 
Theoremdvdsabsb 10127 An integer divides another iff it divides its absolute value. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <->  M  ||  ( abs `  N ) ) )
 
Theorem0dvds 10128 Only 0 is divisible by 0. Theorem 1.1(h) in [ApostolNT] p. 14. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( N  e.  ZZ  ->  ( 0  ||  N  <->  N  =  0 ) )
 
Theoremdvdsmul1 10129 An integer divides a multiple of itself. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  M  ||  ( M  x.  N ) )
 
Theoremdvdsmul2 10130 An integer divides a multiple of itself. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  N  ||  ( M  x.  N ) )
 
Theoremiddvdsexp 10131 An integer divides a positive integer power of itself. (Contributed by Paul Chapman, 26-Oct-2012.)
 |-  ( ( M  e.  ZZ  /\  N  e.  NN )  ->  M  ||  ( M ^ N ) )
 
Theoremmuldvds1 10132 If a product divides an integer, so does one of its factors. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( K  x.  M )  ||  N  ->  K 
 ||  N ) )
 
Theoremmuldvds2 10133 If a product divides an integer, so does one of its factors. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( K  x.  M )  ||  N  ->  M 
 ||  N ) )
 
Theoremdvdscmul 10134 Multiplication by a constant maintains the divides relation. Theorem 1.1(d) in [ApostolNT] p. 14 (multiplication property of the divides relation). (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  ->  ( M  ||  N  ->  ( K  x.  M )  ||  ( K  x.  N ) ) )
 
Theoremdvdsmulc 10135 Multiplication by a constant maintains the divides relation. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  K  e.  ZZ )  ->  ( M  ||  N  ->  ( M  x.  K )  ||  ( N  x.  K ) ) )
 
Theoremdvdscmulr 10136 Cancellation law for the divides relation. Theorem 1.1(e) in [ApostolNT] p. 14. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  ->  ( ( K  x.  M )  ||  ( K  x.  N ) 
 <->  M  ||  N )
 )
 
Theoremdvdsmulcr 10137 Cancellation law for the divides relation. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  ( K  e.  ZZ  /\  K  =/=  0 ) )  ->  ( ( M  x.  K )  ||  ( N  x.  K ) 
 <->  M  ||  N )
 )
 
Theoremsummodnegmod 10138 The sum of two integers modulo a positive integer equals zero iff the first of the two integers equals the negative of the other integer modulo the positive integer. (Contributed by AV, 25-Jul-2021.)
 |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  N  e.  NN )  ->  ( ( ( A  +  B )  mod  N )  =  0  <->  ( A  mod  N )  =  ( -u B  mod  N ) ) )
 
Theoremmodmulconst 10139 Constant multiplication in a modulo operation, see theorem 5.3 in [ApostolNT] p. 108. (Contributed by AV, 21-Jul-2021.)
 |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  C  e.  NN )  /\  M  e.  NN )  ->  ( ( A  mod  M )  =  ( B  mod  M )  <->  ( ( C  x.  A )  mod  ( C  x.  M ) )  =  (
 ( C  x.  B )  mod  ( C  x.  M ) ) ) )
 
Theoremdvds2ln 10140 If an integer divides each of two other integers, it divides any linear combination of them. Theorem 1.1(c) in [ApostolNT] p. 14 (linearity property of the divides relation). (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( ( I  e.  ZZ  /\  J  e.  ZZ )  /\  ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ ) )  ->  (
 ( K  ||  M  /\  K  ||  N )  ->  K  ||  ( ( I  x.  M )  +  ( J  x.  N ) ) ) )
 
Theoremdvds2add 10141 If an integer divides each of two other integers, it divides their sum. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( K  ||  M  /\  K  ||  N )  ->  K  ||  ( M  +  N )
 ) )
 
Theoremdvds2sub 10142 If an integer divides each of two other integers, it divides their difference. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( K  ||  M  /\  K  ||  N )  ->  K  ||  ( M  -  N ) ) )
 
Theoremdvds2subd 10143 Natural deduction form of dvds2sub 10142. (Contributed by Stanislas Polu, 9-Mar-2020.)
 |-  ( ph  ->  K  e.  ZZ )   &    |-  ( ph  ->  K 
 ||  M )   &    |-  ( ph  ->  K  ||  N )   &    |-  ( ph  ->  M  e.  ZZ )   &    |-  ( ph  ->  N  e.  ZZ )   =>    |-  ( ph  ->  K 
 ||  ( M  -  N ) )
 
Theoremdvdstr 10144 The divides relation is transitive. Theorem 1.1(b) in [ApostolNT] p. 14 (transitive property of the divides relation). (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( K  ||  M  /\  M  ||  N )  ->  K  ||  N ) )
 
Theoremdvdsmultr1 10145 If an integer divides another, it divides a multiple of it. (Contributed by Paul Chapman, 17-Nov-2012.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  ||  M  ->  K  ||  ( M  x.  N ) ) )
 
Theoremdvdsmultr1d 10146 Natural deduction form of dvdsmultr1 10145. (Contributed by Stanislas Polu, 9-Mar-2020.)
 |-  ( ph  ->  K  e.  ZZ )   &    |-  ( ph  ->  M  e.  ZZ )   &    |-  ( ph  ->  N  e.  ZZ )   &    |-  ( ph  ->  K  ||  M )   =>    |-  ( ph  ->  K  ||  ( M  x.  N ) )
 
Theoremdvdsmultr2 10147 If an integer divides another, it divides a multiple of it. (Contributed by Paul Chapman, 17-Nov-2012.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( K  ||  N  ->  K  ||  ( M  x.  N ) ) )
 
Theoremordvdsmul 10148 If an integer divides either of two others, it divides their product. (Contributed by Paul Chapman, 17-Nov-2012.) (Proof shortened by Mario Carneiro, 17-Jul-2014.)
 |-  ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( K  ||  M  \/  K  ||  N )  ->  K  ||  ( M  x.  N ) ) )
 
Theoremdvdssub2 10149 If an integer divides a difference, then it divides one term iff it divides the other. (Contributed by Mario Carneiro, 13-Jul-2014.)
 |-  ( ( ( K  e.  ZZ  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  K  ||  ( M  -  N ) )  ->  ( K 
 ||  M  <->  K  ||  N ) )
 
Theoremdvdsadd 10150 An integer divides another iff it divides their sum. (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Mario Carneiro, 13-Jul-2014.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <->  M  ||  ( M  +  N ) ) )
 
Theoremdvdsaddr 10151 An integer divides another iff it divides their sum. (Contributed by Paul Chapman, 31-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <->  M  ||  ( N  +  M ) ) )
 
Theoremdvdssub 10152 An integer divides another iff it divides their difference. (Contributed by Paul Chapman, 31-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <->  M  ||  ( M  -  N ) ) )
 
Theoremdvdssubr 10153 An integer divides another iff it divides their difference. (Contributed by Paul Chapman, 31-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  ||  N 
 <->  M  ||  ( N  -  M ) ) )
 
Theoremdvdsadd2b 10154 Adding a multiple of the base does not affect divisibility. (Contributed by Stefan O'Rear, 23-Sep-2014.)
 |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  ( C  e.  ZZ  /\  A  ||  C )
 )  ->  ( A  ||  B  <->  A  ||  ( C  +  B ) ) )
 
Theoremdvdslelemd 10155 Lemma for dvdsle 10156. (Contributed by Jim Kingdon, 8-Nov-2021.)
 |-  ( ph  ->  M  e.  ZZ )   &    |-  ( ph  ->  N  e.  NN )   &    |-  ( ph  ->  K  e.  ZZ )   &    |-  ( ph  ->  N  <  M )   =>    |-  ( ph  ->  ( K  x.  M )  =/= 
 N )
 
Theoremdvdsle 10156 The divisors of a positive integer are bounded by it. The proof does not use  /. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( M  e.  ZZ  /\  N  e.  NN )  ->  ( M  ||  N  ->  M  <_  N ) )
 
Theoremdvdsleabs 10157 The divisors of a nonzero integer are bounded by its absolute value. Theorem 1.1(i) in [ApostolNT] p. 14 (comparison property of the divides relation). (Contributed by Paul Chapman, 21-Mar-2011.) (Proof shortened by Fan Zheng, 3-Jul-2016.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  N  =/=  0 ) 
 ->  ( M  ||  N  ->  M  <_  ( abs `  N ) ) )
 
Theoremdvdsleabs2 10158 Transfer divisibility to an order constraint on absolute values. (Contributed by Stefan O'Rear, 24-Sep-2014.)
 |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  N  =/=  0 ) 
 ->  ( M  ||  N  ->  ( abs `  M )  <_  ( abs `  N ) ) )
 
Theoremdvdsabseq 10159 If two integers divide each other, they must be equal, up to a difference in sign. Theorem 1.1(j) in [ApostolNT] p. 14. (Contributed by Mario Carneiro, 30-May-2014.) (Revised by AV, 7-Aug-2021.)
 |-  ( ( M  ||  N  /\  N  ||  M )  ->  ( abs `  M )  =  ( abs `  N ) )
 
Theoremdvdseq 10160 If two nonnegative integers divide each other, they must be equal. (Contributed by Mario Carneiro, 30-May-2014.) (Proof shortened by AV, 7-Aug-2021.)
 |-  ( ( ( M  e.  NN0  /\  N  e.  NN0 )  /\  ( M 
 ||  N  /\  N  ||  M ) )  ->  M  =  N )
 
Theoremdivconjdvds 10161 If a nonzero integer  M divides another integer  N, the other integer  N divided by the nonzero integer  M (i.e. the divisor conjugate of  N to  M) divides the other integer  N. Theorem 1.1(k) in [ApostolNT] p. 14. (Contributed by AV, 7-Aug-2021.)
 |-  ( ( M  ||  N  /\  M  =/=  0
 )  ->  ( N  /  M )  ||  N )
 
Theoremdvdsdivcl 10162* The complement of a divisor of  N is also a divisor of  N. (Contributed by Mario Carneiro, 2-Jul-2015.) (Proof shortened by AV, 9-Aug-2021.)
 |-  ( ( N  e.  NN  /\  A  e.  { x  e.  NN  |  x  ||  N } )  ->  ( N  /  A )  e.  { x  e. 
 NN  |  x  ||  N } )
 
Theoremdvdsflip 10163* An involution of the divisors of a number. (Contributed by Stefan O'Rear, 12-Sep-2015.) (Proof shortened by Mario Carneiro, 13-May-2016.)
 |-  A  =  { x  e.  NN  |  x  ||  N }   &    |-  F  =  ( y  e.  A  |->  ( N  /  y ) )   =>    |-  ( N  e.  NN  ->  F : A -1-1-onto-> A )
 
Theoremdvdsssfz1 10164* The set of divisors of a number is a subset of a finite set. (Contributed by Mario Carneiro, 22-Sep-2014.)
 |-  ( A  e.  NN  ->  { p  e.  NN  |  p  ||  A }  C_  ( 1 ... A ) )
 
Theoremdvds1 10165 The only nonnegative integer that divides 1 is 1. (Contributed by Mario Carneiro, 2-Jul-2015.)
 |-  ( M  e.  NN0  ->  ( M  ||  1  <->  M  =  1
 ) )
 
Theoremalzdvds 10166* Only 0 is divisible by all integers. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( N  e.  ZZ  ->  ( A. x  e. 
 ZZ  x  ||  N  <->  N  =  0 ) )
 
Theoremdvdsext 10167* Poset extensionality for division. (Contributed by Stefan O'Rear, 6-Sep-2015.)
 |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  ->  ( A  =  B  <->  A. x  e.  NN0  ( A  ||  x  <->  B  ||  x ) ) )
 
Theoremfzm1ndvds 10168 No number between  1 and  M  - 
1 divides  M. (Contributed by Mario Carneiro, 24-Jan-2015.)
 |-  ( ( M  e.  NN  /\  N  e.  (
 1 ... ( M  -  1 ) ) ) 
 ->  -.  M  ||  N )
 
Theoremfzo0dvdseq 10169 Zero is the only one of the first 
A nonnegative integers that is divisible by  A. (Contributed by Stefan O'Rear, 6-Sep-2015.)
 |-  ( B  e.  (
 0..^ A )  ->  ( A  ||  B  <->  B  =  0
 ) )
 
Theoremfzocongeq 10170 Two different elements of a half-open range are not congruent mod its length. (Contributed by Stefan O'Rear, 6-Sep-2015.)
 |-  ( ( A  e.  ( C..^ D )  /\  B  e.  ( C..^ D ) )  ->  ( ( D  -  C )  ||  ( A  -  B )  <->  A  =  B ) )
 
TheoremaddmodlteqALT 10171 Two nonnegative integers less than the modulus are equal iff the sums of these integer with another integer are equal modulo the modulus. Shorter proof of addmodlteq 9348 based on the "divides" relation. (Contributed by AV, 14-Mar-2021.) (New usage is discouraged.) (Proof modification is discouraged.)
 |-  ( ( I  e.  ( 0..^ N ) 
 /\  J  e.  (
 0..^ N )  /\  S  e.  ZZ )  ->  ( ( ( I  +  S )  mod  N )  =  ( ( J  +  S ) 
 mod  N )  <->  I  =  J ) )
 
Theoremdvdsfac 10172 A positive integer divides any greater factorial. (Contributed by Paul Chapman, 28-Nov-2012.)
 |-  ( ( K  e.  NN  /\  N  e.  ( ZZ>=
 `  K ) ) 
 ->  K  ||  ( ! `  N ) )
 
Theoremdvdsexp 10173 A power divides a power with a greater exponent. (Contributed by Mario Carneiro, 23-Feb-2014.)
 |-  ( ( A  e.  ZZ  /\  M  e.  NN0  /\  N  e.  ( ZZ>= `  M ) )  ->  ( A ^ M ) 
 ||  ( A ^ N ) )
 
Theoremdvdsmod 10174 Any number  K whose mod base  N is divisible by a divisor  P of the base is also divisible by  P. This means that primes will also be relatively prime to the base when reduced  mod  N for any base. (Contributed by Mario Carneiro, 13-Mar-2014.)
 |-  ( ( ( P  e.  NN  /\  N  e.  NN  /\  K  e.  ZZ )  /\  P  ||  N )  ->  ( P 
 ||  ( K  mod  N )  <->  P  ||  K ) )
 
Theoremmulmoddvds 10175 If an integer is divisible by a positive integer, the product of this integer with another integer modulo the positive integer is 0. (Contributed by Alexander van der Vekens, 30-Aug-2018.)
 |-  ( ( N  e.  NN  /\  A  e.  ZZ  /\  B  e.  ZZ )  ->  ( N  ||  A  ->  ( ( A  x.  B )  mod  N )  =  0 ) )
 
Theorem3dvdsdec 10176 A decimal number is divisible by three iff the sum of its two "digits" is divisible by three. The term "digits" in its narrow sense is only correct if  A and  B actually are digits (i.e. nonnegative integers less than 10). However, this theorem holds for arbitrary nonnegative integers  A and  B, especially if  A is itself a decimal number, e.g.  A  = ; C D. (Contributed by AV, 14-Jun-2021.) (Revised by AV, 8-Sep-2021.)
 |-  A  e.  NN0   &    |-  B  e.  NN0   =>    |-  ( 3  || ; A B  <->  3  ||  ( A  +  B )
 )
 
Theorem3dvds2dec 10177 A decimal number is divisible by three iff the sum of its three "digits" is divisible by three. The term "digits" in its narrow sense is only correct if  A,  B and  C actually are digits (i.e. nonnegative integers less than 10). However, this theorem holds for arbitrary nonnegative integers  A,  B and  C. (Contributed by AV, 14-Jun-2021.) (Revised by AV, 1-Aug-2021.)
 |-  A  e.  NN0   &    |-  B  e.  NN0   &    |-  C  e.  NN0   =>    |-  ( 3  || ;; A B C  <->  3  ||  (
 ( A  +  B )  +  C )
 )
 
4.1.2  Even and odd numbers

The set  ZZ of integers can be partitioned into the set of even numbers and the set of odd numbers, see zeo4 10181. Instead of defining new class variables Even and Odd to represent these sets, we use the idiom  2 
||  N to say that " N is even" (which implies  N  e.  ZZ, see evenelz 10178) and  -.  2  ||  N to say that " N is odd" (under the assumption that  N  e.  ZZ). The previously proven theorems about even and odd numbers, like zneo 8398, zeo 8402, zeo2 8403, etc. use different representations, which are equivalent with the representations using the divides relation, see evend2 10201 and oddp1d2 10202. The corresponding theorems are zeneo 10182, zeo3 10179 and zeo4 10181.

 
Theoremevenelz 10178 An even number is an integer. This follows immediately from the reverse closure of the divides relation, see dvdszrcl 10113. (Contributed by AV, 22-Jun-2021.)
 |-  ( 2  ||  N  ->  N  e.  ZZ )
 
Theoremzeo3 10179 An integer is even or odd. (Contributed by AV, 17-Jun-2021.)
 |-  ( N  e.  ZZ  ->  ( 2  ||  N  \/  -.  2  ||  N ) )
 
Theoremzeoxor 10180 An integer is even or odd but not both. (Contributed by Jim Kingdon, 10-Nov-2021.)
 |-  ( N  e.  ZZ  ->  ( 2  ||  N  \/_  -.  2  ||  N ) )
 
Theoremzeo4 10181 An integer is even or odd but not both. (Contributed by AV, 17-Jun-2021.)
 |-  ( N  e.  ZZ  ->  ( 2  ||  N  <->  -. 
 -.  2  ||  N ) )
 
Theoremzeneo 10182 No even integer equals an odd integer (i.e. no integer can be both even and odd). Exercise 10(a) of [Apostol] p. 28. This variant of zneo 8398 follows immediately from the fact that a contradiction implies anything, see pm2.21i 585. (Contributed by AV, 22-Jun-2021.)
 |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( 2 
 ||  A  /\  -.  2  ||  B )  ->  A  =/=  B ) )
 
Theoremodd2np1lem 10183* Lemma for odd2np1 10184. (Contributed by Scott Fenton, 3-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
 |-  ( N  e.  NN0  ->  ( E. n  e.  ZZ  ( ( 2  x.  n )  +  1 )  =  N  \/  E. k  e.  ZZ  (
 k  x.  2 )  =  N ) )
 
Theoremodd2np1 10184* An integer is odd iff it is one plus twice another integer. (Contributed by Scott Fenton, 3-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
 |-  ( N  e.  ZZ  ->  ( -.  2  ||  N 
 <-> 
 E. n  e.  ZZ  ( ( 2  x.  n )  +  1 )  =  N ) )
 
Theoremeven2n 10185* An integer is even iff it is twice another integer. (Contributed by AV, 25-Jun-2020.)
 |-  ( 2  ||  N  <->  E. n  e.  ZZ  (
 2  x.  n )  =  N )
 
Theoremoddm1even 10186 An integer is odd iff its predecessor is even. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( N  e.  ZZ  ->  ( -.  2  ||  N 
 <->  2  ||  ( N  -  1 ) ) )
 
Theoremoddp1even 10187 An integer is odd iff its successor is even. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( N  e.  ZZ  ->  ( -.  2  ||  N 
 <->  2  ||  ( N  +  1 ) ) )
 
Theoremoexpneg 10188 The exponential of the negative of a number, when the exponent is odd. (Contributed by Mario Carneiro, 25-Apr-2015.)
 |-  ( ( A  e.  CC  /\  N  e.  NN  /\ 
 -.  2  ||  N )  ->  ( -u A ^ N )  =  -u ( A ^ N ) )
 
Theoremmod2eq0even 10189 An integer is 0 modulo 2 iff it is even (i.e. divisible by 2), see example 2 in [ApostolNT] p. 107. (Contributed by AV, 21-Jul-2021.)
 |-  ( N  e.  ZZ  ->  ( ( N  mod  2 )  =  0  <->  2 
 ||  N ) )
 
Theoremfz01or 10190 An integer is in the integer range from zero to one iff it is either zero or one. (Contributed by Jim Kingdon, 11-Nov-2021.)
 |-  ( A  e.  (
 0 ... 1 )  <->  ( A  =  0  \/  A  =  1 ) )
 
Theoremmod2eq1n2dvds 10191 An integer is 1 modulo 2 iff it is odd (i.e. not divisible by 2), see example 3 in [ApostolNT] p. 107. (Contributed by AV, 24-May-2020.)
 |-  ( N  e.  ZZ  ->  ( ( N  mod  2 )  =  1  <->  -.  2  ||  N )
 )
 
Theoremoddnn02np1 10192* A nonnegative integer is odd iff it is one plus twice another nonnegative integer. (Contributed by AV, 19-Jun-2021.)
 |-  ( N  e.  NN0  ->  ( -.  2  ||  N  <->  E. n  e.  NN0  (
 ( 2  x.  n )  +  1 )  =  N ) )
 
Theoremoddge22np1 10193* An integer greater than one is odd iff it is one plus twice a positive integer. (Contributed by AV, 16-Aug-2021.)
 |-  ( N  e.  ( ZZ>=
 `  2 )  ->  ( -.  2  ||  N  <->  E. n  e.  NN  (
 ( 2  x.  n )  +  1 )  =  N ) )
 
Theoremevennn02n 10194* A nonnegative integer is even iff it is twice another nonnegative integer. (Contributed by AV, 12-Aug-2021.)
 |-  ( N  e.  NN0  ->  ( 2  ||  N  <->  E. n  e.  NN0  (
 2  x.  n )  =  N ) )
 
Theoremevennn2n 10195* A positive integer is even iff it is twice another positive integer. (Contributed by AV, 12-Aug-2021.)
 |-  ( N  e.  NN  ->  ( 2  ||  N  <->  E. n  e.  NN  (
 2  x.  n )  =  N ) )
 
Theorem2tp1odd 10196 A number which is twice an integer increased by 1 is odd. (Contributed by AV, 16-Jul-2021.)
 |-  ( ( A  e.  ZZ  /\  B  =  ( ( 2  x.  A )  +  1 )
 )  ->  -.  2  ||  B )
 
Theoremmulsucdiv2z 10197 An integer multiplied with its successor divided by 2 yields an integer, i.e. an integer multiplied with its successor is even. (Contributed by AV, 19-Jul-2021.)
 |-  ( N  e.  ZZ  ->  ( ( N  x.  ( N  +  1
 ) )  /  2
 )  e.  ZZ )
 
Theoremsqoddm1div8z 10198 A squared odd number minus 1 divided by 8 is an integer. (Contributed by AV, 19-Jul-2021.)
 |-  ( ( N  e.  ZZ  /\  -.  2  ||  N )  ->  ( ( ( N ^ 2
 )  -  1 ) 
 /  8 )  e. 
 ZZ )
 
Theorem2teven 10199 A number which is twice an integer is even. (Contributed by AV, 16-Jul-2021.)
 |-  ( ( A  e.  ZZ  /\  B  =  ( 2  x.  A ) )  ->  2  ||  B )
 
Theoremzeo5 10200 An integer is either even or odd, version of zeo3 10179 avoiding the negation of the representation of an odd number. (Proposed by BJ, 21-Jun-2021.) (Contributed by AV, 26-Jun-2020.)
 |-  ( N  e.  ZZ  ->  ( 2  ||  N  \/  2  ||  ( N  +  1 ) ) )
    < Previous  Next >

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-10511
  Copyright terms: Public domain < Previous  Next >