HomeHome Metamath Proof Explorer
Theorem List (p. 127 of 328)
< Previous  Next >
Browser slow? Try the
Unicode version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-21514)
  Hilbert Space Explorer  Hilbert Space Explorer
(21515-23037)
  Users' Mathboxes  Users' Mathboxes
(23038-32776)
 

Theorem List for Metamath Proof Explorer - 12601-12700   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremdvdsmod 12601 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 ) )
 
Theoremodd2np1lem 12602* Lemma for odd2np1 12603. (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 12603* 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 ) )
 
Theoremoddm1even 12604 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 12605 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 12606 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 ) )
 
Theorem3dvds 12607* A rule for divisibility by 3 of a number written in base 10. (Contributed by Mario Carneiro, 14-Jul-2014.) (Revised by Mario Carneiro, 17-Jan-2015.)
 |-  ( ( N  e.  NN0  /\  F : ( 0
 ... N ) --> ZZ )  ->  ( 3  ||  sum_ k  e.  ( 0 ... N ) ( ( F `
  k )  x.  ( 10 ^ k
 ) )  <->  3  ||  sum_ k  e.  ( 0 ... N ) ( F `  k ) ) )
 
6.1.4  The division algorithm
 
Theoremdivalglem0 12608 Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  N  e.  ZZ   &    |-  D  e.  ZZ   =>    |-  ( ( R  e.  ZZ  /\  K  e.  ZZ )  ->  ( D  ||  ( N  -  R )  ->  D  ||  ( N  -  ( R  -  ( K  x.  ( abs `  D ) ) ) ) ) )
 
Theoremdivalglem1 12609 Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  N  e.  ZZ   &    |-  D  e.  ZZ   &    |-  D  =/=  0   =>    |-  0  <_  ( N  +  ( abs `  ( N  x.  D ) ) )
 
Theoremdivalglem2 12610* Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  N  e.  ZZ   &    |-  D  e.  ZZ   &    |-  D  =/=  0   &    |-  S  =  { r  e.  NN0  |  D  ||  ( N  -  r ) }   =>    |-  sup ( S ,  RR ,  `'  <  )  e.  S
 
Theoremdivalglem4 12611* Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  N  e.  ZZ   &    |-  D  e.  ZZ   &    |-  D  =/=  0   &    |-  S  =  { r  e.  NN0  |  D  ||  ( N  -  r ) }   =>    |-  S  =  {
 r  e.  NN0  |  E. q  e.  ZZ  N  =  ( (
 q  x.  D )  +  r ) }
 
Theoremdivalglem5 12612* Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  N  e.  ZZ   &    |-  D  e.  ZZ   &    |-  D  =/=  0   &    |-  S  =  { r  e.  NN0  |  D  ||  ( N  -  r ) }   &    |-  R  =  sup ( S ,  RR ,  `'  <  )   =>    |-  (
 0  <_  R  /\  R  <  ( abs `  D ) )
 
Theoremdivalglem6 12613 Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  A  e.  NN   &    |-  X  e.  ( 0 ... ( A  -  1 ) )   &    |-  K  e.  ZZ   =>    |-  ( K  =/=  0  ->  -.  ( X  +  ( K  x.  A ) )  e.  (
 0 ... ( A  -  1 ) ) )
 
Theoremdivalglem7 12614 Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  D  e.  ZZ   &    |-  D  =/=  0   =>    |-  ( ( X  e.  ( 0 ... (
 ( abs `  D )  -  1 ) ) 
 /\  K  e.  ZZ )  ->  ( K  =/=  0  ->  -.  ( X  +  ( K  x.  ( abs `  D ) ) )  e.  ( 0
 ... ( ( abs `  D )  -  1
 ) ) ) )
 
Theoremdivalglem8 12615* Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  N  e.  ZZ   &    |-  D  e.  ZZ   &    |-  D  =/=  0   &    |-  S  =  { r  e.  NN0  |  D  ||  ( N  -  r ) }   =>    |-  ( ( ( X  e.  S  /\  Y  e.  S )  /\  ( X  <  ( abs `  D )  /\  Y  <  ( abs `  D ) ) )  ->  ( K  e.  ZZ  ->  ( ( K  x.  ( abs `  D )
 )  =  ( Y  -  X )  ->  X  =  Y )
 ) )
 
Theoremdivalglem9 12616* Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  N  e.  ZZ   &    |-  D  e.  ZZ   &    |-  D  =/=  0   &    |-  S  =  { r  e.  NN0  |  D  ||  ( N  -  r ) }   &    |-  R  =  sup ( S ,  RR ,  `'  <  )   =>    |-  E! x  e.  S  x  <  ( abs `  D )
 
Theoremdivalglem10 12617* Lemma for divalg 12618. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  N  e.  ZZ   &    |-  D  e.  ZZ   &    |-  D  =/=  0   &    |-  S  =  { r  e.  NN0  |  D  ||  ( N  -  r ) }   =>    |-  E! r  e. 
 ZZ  E. q  e.  ZZ  ( 0  <_  r  /\  r  <  ( abs `  D )  /\  N  =  ( ( q  x.  D )  +  r
 ) )
 
Theoremdivalg 12618* The division algorithm (theorem). Dividing an integer  N by a nonzero integer  D produces a (unique) quotient  q and a unique remainder  0  <_  r  <  ( abs `  D
). The proof does not use  /,  |_ or  mod. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( N  e.  ZZ  /\  D  e.  ZZ  /\  D  =/=  0 ) 
 ->  E! r  e.  ZZ  E. q  e.  ZZ  (
 0  <_  r  /\  r  <  ( abs `  D )  /\  N  =  ( ( q  x.  D )  +  r )
 ) )
 
Theoremdivalgb 12619* Express the division algorithm as stated in divalg 12618 in terms of  ||. (Contributed by Paul Chapman, 31-Mar-2011.)
 |-  ( ( N  e.  ZZ  /\  D  e.  ZZ  /\  D  =/=  0 ) 
 ->  ( E! r  e. 
 ZZ  E. q  e.  ZZ  ( 0  <_  r  /\  r  <  ( abs `  D )  /\  N  =  ( ( q  x.  D )  +  r
 ) )  <->  E! r  e.  NN0  ( r  <  ( abs `  D )  /\  D  ||  ( N  -  r
 ) ) ) )
 
Theoremdivalg2 12620* The division algorithm (theorem) for a positive divisor. (Contributed by Paul Chapman, 21-Mar-2011.)
 |-  ( ( N  e.  ZZ  /\  D  e.  NN )  ->  E! r  e. 
 NN0  ( r  <  D  /\  D  ||  ( N  -  r ) ) )
 
Theoremdivalgmod 12621* The result of the  mod operator satisfies the requirements for the remainder  r in the division algorithm for a positive divisor (compare divalg2 12620 and divalgb 12619). This demonstration theorem justifies the use of  mod to yield an explicit remainder from this point forward. (Contributed by Paul Chapman, 31-Mar-2011.)
 |-  ( ( N  e.  ZZ  /\  D  e.  NN )  ->  ( r  =  ( N  mod  D ) 
 <->  ( r  e.  NN0  /\  ( r  <  D  /\  D  ||  ( N  -  r ) ) ) ) )
 
Theoremndvdssub 12622 Corollary of the division algorithm. If an integer  D greater than  1 divides  N, then it does not divide any of  N  -  1,  N  -  2...  N  -  ( D  -  1 ). (Contributed by Paul Chapman, 31-Mar-2011.)
 |-  ( ( N  e.  ZZ  /\  D  e.  NN  /\  ( K  e.  NN  /\  K  <  D ) )  ->  ( D  ||  N  ->  -.  D  ||  ( N  -  K ) ) )
 
Theoremndvdsadd 12623 Corollary of the division algorithm. If an integer  D greater than  1 divides  N, then it does not divide any of  N  +  1,  N  +  2...  N  +  ( D  -  1 ). (Contributed by Paul Chapman, 31-Mar-2011.)
 |-  ( ( N  e.  ZZ  /\  D  e.  NN  /\  ( K  e.  NN  /\  K  <  D ) )  ->  ( D  ||  N  ->  -.  D  ||  ( N  +  K ) ) )
 
Theoremndvdsp1 12624 Special case of ndvdsadd 12623. If an integer  D greater than  1 divides  N, it does not divide  N  +  1. (Contributed by Paul Chapman, 31-Mar-2011.)
 |-  ( ( N  e.  ZZ  /\  D  e.  NN  /\  1  <  D ) 
 ->  ( D  ||  N  ->  -.  D  ||  ( N  +  1 )
 ) )
 
Theoremndvdsi 12625 A quick test for non-divisibility. (Contributed by Mario Carneiro, 18-Feb-2014.)
 |-  A  e.  NN   &    |-  Q  e.  NN0   &    |-  R  e.  NN   &    |-  (
 ( A  x.  Q )  +  R )  =  B   &    |-  R  <  A   =>    |-  -.  A  ||  B
 
6.1.5  Bit sequences
 
Syntaxcbits 12626 Define the binary bits of an integer.
 class bits
 
Syntaxcsad 12627 Define the sequence addition on bit sequences.
 class sadd
 
Syntaxcsmu 12628 Define the sequence multiplication on bit sequences.
 class smul
 
Definitiondf-bits 12629* Define the binary bits of an integer. The expression  M  e.  (bits `  N ) means that the  M-th bit of  N is 1 (and its negation means the bit is 0). (Contributed by Mario Carneiro, 4-Sep-2016.)
 |- bits  =  ( n  e.  ZZ  |->  { m  e.  NN0  |  -.  2  ||  ( |_ `  ( n  /  (
 2 ^ m ) ) ) } )
 
Theorembitsfval 12630* Expand the definition of the bits of an integer. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( N  e.  ZZ  ->  (bits `  N )  =  { m  e.  NN0  |  -.  2  ||  ( |_ `  ( N  /  ( 2 ^ m ) ) ) }
 )
 
Theorembitsval 12631 Expand the definition of the bits of an integer. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( M  e.  (bits `  N )  <->  ( N  e.  ZZ  /\  M  e.  NN0  /\ 
 -.  2  ||  ( |_ `  ( N  /  ( 2 ^ M ) ) ) ) )
 
Theorembitsval2 12632 Expand the definition of the bits of an integer. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  ( M  e.  (bits `  N )  <->  -.  2  ||  ( |_ `  ( N  /  ( 2 ^ M ) ) ) ) )
 
Theorembitsss 12633 The set of bits of an integer is a subset of  NN0. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  (bits `  N )  C_ 
 NN0
 
Theorembitsf 12634 The bits function is a function from integers to subsets of nonnegative integers. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |- bits : ZZ --> ~P NN0
 
Theorembits0 12635 Value of the zeroth bit. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( N  e.  ZZ  ->  ( 0  e.  (bits `  N )  <->  -.  2  ||  N ) )
 
Theorembits0e 12636 The zeroth bit of an even number is zero. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( N  e.  ZZ  ->  -.  0  e.  (bits `  ( 2  x.  N ) ) )
 
Theorembits0o 12637 The zeroth bit of an odd number is zero. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( N  e.  ZZ  ->  0  e.  (bits `  ( ( 2  x.  N )  +  1 ) ) )
 
Theorembitsp1 12638 The  M  +  1-th bit of  N is the  M-th bit of  |_ ( N  / 
2 ). (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  ( ( M  +  1 )  e.  (bits `  N )  <->  M  e.  (bits `  ( |_ `  ( N  / 
 2 ) ) ) ) )
 
Theorembitsp1e 12639 The  M  +  1-th bit of  2 N is the  M-th bit of  N. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  ( ( M  +  1 )  e.  (bits `  ( 2  x.  N ) )  <->  M  e.  (bits `  N ) ) )
 
Theorembitsp1o 12640 The  M  +  1-th bit of  2 N  +  1 is the  M-th bit of  N. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  ( ( M  +  1 )  e.  (bits `  ( (
 2  x.  N )  +  1 ) )  <->  M  e.  (bits `  N ) ) )
 
Theorembitsfzolem 12641* Lemma for bitsfzo 12642. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ph  ->  N  e.  NN0 )   &    |-  ( ph  ->  M  e.  NN0 )   &    |-  ( ph  ->  (bits `  N )  C_  (
 0..^ M ) )   &    |-  S  =  sup ( { n  e.  NN0  |  N  <  ( 2 ^ n ) } ,  RR ,  `'  <  )   =>    |-  ( ph  ->  N  e.  ( 0..^ ( 2 ^ M ) ) )
 
Theorembitsfzo 12642 The bits of a number are all less than  M iff the number is nonnegative and less than  2 ^ M. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  ( N  e.  ( 0..^ ( 2 ^ M ) )  <->  (bits `  N )  C_  ( 0..^ M ) ) )
 
Theorembitsmod 12643 Truncating the bit sequence after some  M is equivalent to reducing the argument  mod  2 ^ M. (Contributed by Mario Carneiro, 6-Sep-2016.)
 |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  (bits `  ( N  mod  ( 2 ^ M ) ) )  =  ( (bits `  N )  i^i  ( 0..^ M ) ) )
 
Theorembitsfi 12644 Every number is associated to a finite set of bits. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( N  e.  NN0  ->  (bits `  N )  e. 
 Fin )
 
Theorembitscmp 12645 The bit complement of  N is  -u N  - 
1. (Thus, by bitsfi 12644, all negative numbers have cofinite bits representations.) (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( N  e.  ZZ  ->  ( NN0  \  (bits `  N ) )  =  (bits `  ( -u N  -  1 ) ) )
 
Theorem0bits 12646 The bits of zero. (Contributed by Mario Carneiro, 6-Sep-2016.)
 |-  (bits `  0 )  =  (/)
 
Theoremm1bits 12647 The bits of negative one. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  (bits `  -u 1 )  =  NN0
 
Theorembitsinv1lem 12648 Lemma for bitsinv1 12649. (Contributed by Mario Carneiro, 22-Sep-2016.)
 |-  ( ( N  e.  ZZ  /\  M  e.  NN0 )  ->  ( N  mod  ( 2 ^ ( M  +  1 )
 ) )  =  ( ( N  mod  (
 2 ^ M ) )  +  if ( M  e.  (bits `  N ) ,  ( 2 ^ M ) ,  0 ) ) )
 
Theorembitsinv1 12649* There is an explicit inverse to the bits function for nonnegative integers (which can be extended to negative integers using bitscmp 12645), part 1. (Contributed by Mario Carneiro, 7-Sep-2016.)
 |-  ( N  e.  NN0  ->  sum_ n  e.  (bits `  N ) ( 2 ^ n )  =  N )
 
Theorembitsinv2 12650* There is an explicit inverse to the bits function for nonnegative integers, part 2. (Contributed by Mario Carneiro, 8-Sep-2016.)
 |-  ( A  e.  ( ~P NN0  i^i  Fin )  ->  (bits `  sum_ n  e.  A  ( 2 ^ n ) )  =  A )
 
Theorembitsf1ocnv 12651* The bits function restricted to nonnegative integers is a bijection from the integers to the finite sets of integers. It is in fact the inverse of the Ackermann bijection ackbijnn 12302. (Contributed by Mario Carneiro, 8-Sep-2016.)
 |-  ( (bits  |`  NN0 ) : NN0
 -1-1-onto-> ( ~P NN0  i^i  Fin )  /\  `' (bits  |`  NN0 )  =  ( x  e.  ( ~P
 NN0  i^i  Fin )  |->  sum_ n  e.  x  ( 2 ^ n ) ) )
 
Theorembitsf1o 12652 The bits function restricted to nonnegative integers is a bijection from the integers to the finite sets of integers. It is in fact the inverse of the Ackermann bijection ackbijnn 12302. (Contributed by Mario Carneiro, 8-Sep-2016.)
 |-  (bits  |`  NN0 ) : NN0 -1-1-onto-> ( ~P NN0  i^i  Fin )
 
Theorembitsf1 12653 The bits function is an injection from  ZZ to  ~P NN0. It is obviously not a bijection (by Cantor's theorem canth2 7030), and in fact its range is the set of finite and cofinite subsets of  NN0. (Contributed by Mario Carneiro, 22-Sep-2016.)
 |- bits : ZZ -1-1-> ~P NN0
 
Theorem2ebits 12654 The bits of a power of two. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( N  e.  NN0  ->  (bits `  ( 2 ^ N ) )  =  { N } )
 
Theorembitsinv 12655* The inverse of the bits function. (Contributed by Mario Carneiro, 8-Sep-2016.)
 |-  K  =  `' (bits  |` 
 NN0 )   =>    |-  ( A  e.  ( ~P NN0  i^i  Fin )  ->  ( K `  A )  =  sum_ k  e.  A  ( 2 ^ k
 ) )
 
Theorembitsinvp1 12656 Recursive definition of the inverse of the bits function. (Contributed by Mario Carneiro, 8-Sep-2016.)
 |-  K  =  `' (bits  |` 
 NN0 )   =>    |-  ( ( A  C_  NN0  /\  N  e.  NN0 )  ->  ( K `  ( A  i^i  ( 0..^ ( N  +  1 ) ) ) )  =  ( ( K `  ( A  i^i  ( 0..^ N ) ) )  +  if ( N  e.  A ,  (
 2 ^ N ) ,  0 ) ) )
 
Theoremsadadd2lem2 12657 The core of the proof of sadadd2 12667. The intuitive justification for this is that cadd is true if at least two arguments are true, and hadd is true if an odd number of arguments are true, so altogether the result is  n  x.  A where  n is the number of true arguments, which is equivalently obtained by adding together one  A for each true argument, on the right side. (Contributed by Mario Carneiro, 8-Sep-2016.)
 |-  ( A  e.  CC  ->  ( if (hadd ( ph ,  ps ,  ch ) ,  A , 
 0 )  +  if (cadd ( ph ,  ps ,  ch ) ,  (
 2  x.  A ) ,  0 ) )  =  ( ( if ( ph ,  A ,  0 )  +  if ( ps ,  A ,  0 ) )  +  if ( ch ,  A ,  0 ) ) )
 
Definitiondf-sad 12658* Define the addition of two bit sequences, using df-had 1370 and df-cad 1371 bit operations. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |- sadd  =  ( x  e.  ~P NN0
 ,  y  e.  ~P NN0  |->  { k  e.  NN0  | hadd ( k  e.  x ,  k  e.  y ,  (/)  e.  (  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  x ,  m  e.  y ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) ) `  k ) ) } )
 
Theoremsadfval 12659* Define the addition of two bit sequences, using df-had 1370 and df-cad 1371 bit operations. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   =>    |-  ( ph  ->  ( A sadd  B )  =  {
 k  e.  NN0  | hadd ( k  e.  A ,  k  e.  B ,  (/)  e.  ( C `
  k ) ) } )
 
Theoremsadcf 12660* The carry sequence is a sequence of elements of  2o encoding a "sequence of wffs". (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   =>    |-  ( ph  ->  C : NN0 --> 2o )
 
Theoremsadc0 12661* The initial element of the carry sequence is  F.. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   =>    |-  ( ph  ->  -.  (/)  e.  ( C `  0 ) )
 
Theoremsadcp1 12662* The carry sequence (which is a sequence of wffs, encoded as  1o and  (/)) is defined recursively as the carry operation applied to the previous carry and the two current inputs. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  ( (/) 
 e.  ( C `  ( N  +  1
 ) )  <-> cadd ( N  e.  A ,  N  e.  B ,  (/)  e.  ( C `
  N ) ) ) )
 
Theoremsadval 12663* The full adder sequence is the half adder function applied to the inputs and the carry sequence. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  ( N  e.  ( A sadd  B )  <-> hadd ( N  e.  A ,  N  e.  B ,  (/)  e.  ( C `
  N ) ) ) )
 
Theoremsadcaddlem 12664* Lemma for sadcadd 12665. (Contributed by Mario Carneiro, 8-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   &    |-  K  =  `' (bits  |`  NN0 )   &    |-  ( ph  ->  ( (/)  e.  ( C `  N )  <->  ( 2 ^ N )  <_  ( ( K `  ( A  i^i  ( 0..^ N ) ) )  +  ( K `  ( B  i^i  ( 0..^ N ) ) ) ) ) )   =>    |-  ( ph  ->  ( (/) 
 e.  ( C `  ( N  +  1
 ) )  <->  ( 2 ^
 ( N  +  1 ) )  <_  (
 ( K `  ( A  i^i  ( 0..^ ( N  +  1 ) ) ) )  +  ( K `  ( B  i^i  ( 0..^ ( N  +  1 ) ) ) ) ) ) )
 
Theoremsadcadd 12665* Non-recursive definition of the carry sequence. (Contributed by Mario Carneiro, 8-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   &    |-  K  =  `' (bits  |`  NN0 )   =>    |-  ( ph  ->  ( (/) 
 e.  ( C `  N )  <->  ( 2 ^ N )  <_  ( ( K `  ( A  i^i  ( 0..^ N ) ) )  +  ( K `  ( B  i^i  ( 0..^ N ) ) ) ) ) )
 
Theoremsadadd2lem 12666* Lemma for sadadd2 12667. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   &    |-  K  =  `' (bits  |`  NN0 )   &    |-  ( ph  ->  ( ( K `  (
 ( A sadd  B )  i^i  ( 0..^ N ) ) )  +  if ( (/)  e.  ( C `
  N ) ,  ( 2 ^ N ) ,  0 )
 )  =  ( ( K `  ( A  i^i  ( 0..^ N ) ) )  +  ( K `  ( B  i^i  ( 0..^ N ) ) ) ) )   =>    |-  ( ph  ->  (
 ( K `  (
 ( A sadd  B )  i^i  ( 0..^ ( N  +  1 ) ) ) )  +  if ( (/)  e.  ( C `
  ( N  +  1 ) ) ,  ( 2 ^ ( N  +  1 )
 ) ,  0 ) )  =  ( ( K `  ( A  i^i  ( 0..^ ( N  +  1 ) ) ) )  +  ( K `  ( B  i^i  ( 0..^ ( N  +  1 ) ) ) ) ) )
 
Theoremsadadd2 12667* Sum of initial segments of the sadd sequence. (Contributed by Mario Carneiro, 8-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   &    |-  K  =  `' (bits  |`  NN0 )   =>    |-  ( ph  ->  (
 ( K `  (
 ( A sadd  B )  i^i  ( 0..^ N ) ) )  +  if ( (/)  e.  ( C `
  N ) ,  ( 2 ^ N ) ,  0 )
 )  =  ( ( K `  ( A  i^i  ( 0..^ N ) ) )  +  ( K `  ( B  i^i  ( 0..^ N ) ) ) ) )
 
Theoremsadadd3 12668* Sum of initial segments of the sadd sequence. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   &    |-  K  =  `' (bits  |`  NN0 )   =>    |-  ( ph  ->  (
 ( K `  (
 ( A sadd  B )  i^i  ( 0..^ N ) ) )  mod  (
 2 ^ N ) )  =  ( ( ( K `  ( A  i^i  ( 0..^ N ) ) )  +  ( K `  ( B  i^i  ( 0..^ N ) ) ) ) 
 mod  ( 2 ^ N ) ) )
 
Theoremsadcl 12669 The sum of two sequences is a sequence. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ( A  C_  NN0  /\  B  C_  NN0 )  ->  ( A sadd  B )  C_  NN0 )
 
Theoremsadcom 12670 The adder sequence function is commutative. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ( A  C_  NN0  /\  B  C_  NN0 )  ->  ( A sadd  B )  =  ( B sadd  A ) )
 
Theoremsaddisjlem 12671* Lemma for sadadd 12674. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  ( ph  ->  ( A  i^i  B )  =  (/) )   &    |-  C  =  seq  0 ( ( c  e.  2o ,  m  e.  NN0  |->  if (cadd ( m  e.  A ,  m  e.  B ,  (/)  e.  c
 ) ,  1o ,  (/) ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  ( N  e.  ( A sadd  B )  <->  N  e.  ( A  u.  B ) ) )
 
Theoremsaddisj 12672 The sum of disjoint sequences is the union of the sequences. (In this case, there are no carried bits.) (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  ( ph  ->  ( A  i^i  B )  =  (/) )   =>    |-  ( ph  ->  ( A sadd  B )  =  ( A  u.  B ) )
 
Theoremsadaddlem 12673* Lemma for sadadd 12674. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  C  =  seq  0
 ( ( c  e. 
 2o ,  m  e. 
 NN0  |->  if (cadd ( m  e.  (bits `  A ) ,  m  e.  (bits `  B ) ,  (/)  e.  c ) ,  1o ,  (/) ) ) ,  ( n  e. 
 NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   &    |-  K  =  `' (bits  |`  NN0 )   &    |-  ( ph  ->  A  e.  ZZ )   &    |-  ( ph  ->  B  e.  ZZ )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  (
 ( (bits `  A ) sadd  (bits `  B )
 )  i^i  ( 0..^ N ) )  =  (bits `  ( ( A  +  B )  mod  ( 2 ^ N ) ) ) )
 
Theoremsadadd 12674 For sequences that correspond to valid integers, the adder sequence function produces the sequence for the sum. This is effectively a proof of the correctness of the ripple carry adder, implemented with logic gates corresponding to df-had 1370 and df-cad 1371.

It is interesting to consider in what sense the sadd function can be said to be "adding" things outside the range of the bits function, that is, when adding sequences that are not eventually constant and so do not denote any integer. The correct interpretation is that the sequences are representations of 2-adic integers, which have a natural ring structure. (Contributed by Mario Carneiro, 9-Sep-2016.)

 |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( (bits `  A ) sadd  (bits `  B ) )  =  (bits `  ( A  +  B ) ) )
 
Theoremsadid1 12675 The adder sequence function has a left identity, the empty set, which is the representation of the integer zero. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( A  C_  NN0  ->  ( A sadd  (/) )  =  A )
 
Theoremsadid2 12676 The adder sequence function has a right identity, the empty set, which is the representation of the integer zero. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( A  C_  NN0  ->  ( (/) sadd  A )  =  A )
 
Theoremsadasslem 12677 Lemma for sadass 12678. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  ( ph  ->  C 
 C_  NN0 )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  (
 ( ( A sadd  B ) sadd  C )  i^i  (
 0..^ N ) )  =  ( ( A sadd 
 ( B sadd  C )
 )  i^i  ( 0..^ N ) ) )
 
Theoremsadass 12678 Sequence addition is associative. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ( A  C_  NN0  /\  B  C_  NN0  /\  C  C_ 
 NN0 )  ->  (
 ( A sadd  B ) sadd  C )  =  ( A sadd 
 ( B sadd  C )
 ) )
 
Theoremsadeq 12679 Any element of a sequence sum only depends on the values of the argument sequences up to and including that point. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  (
 ( A sadd  B )  i^i  ( 0..^ N ) )  =  ( ( ( A  i^i  (
 0..^ N ) ) sadd 
 ( B  i^i  (
 0..^ N ) ) )  i^i  ( 0..^ N ) ) )
 
Theorembitsres 12680 Restrict the bits of a number to an upper integer set. (Contributed by Mario Carneiro, 5-Sep-2016.)
 |-  ( ( A  e.  ZZ  /\  N  e.  NN0 )  ->  ( (bits `  A )  i^i  ( ZZ>= `  N ) )  =  (bits `  ( ( |_ `  ( A  /  ( 2 ^ N ) ) )  x.  ( 2 ^ N ) ) ) )
 
Theorembitsuz 12681 The bits of a number are all at least  N iff the number is divisible by  2 ^ N. (Contributed by Mario Carneiro, 21-Sep-2016.)
 |-  ( ( A  e.  ZZ  /\  N  e.  NN0 )  ->  ( ( 2 ^ N )  ||  A 
 <->  (bits `  A )  C_  ( ZZ>= `  N )
 ) )
 
Theorembitsshft 12682* Shifting a bit sequence to the left (toward the more significant bits) causes the number to be multiplied by a power of two. (Contributed by Mario Carneiro, 22-Sep-2016.)
 |-  ( ( A  e.  ZZ  /\  N  e.  NN0 )  ->  { n  e. 
 NN0  |  ( n  -  N )  e.  (bits `  A ) }  =  (bits `  ( A  x.  ( 2 ^ N ) ) ) )
 
Definitiondf-smu 12683* Define the multiplication of two bit sequences, using repeated sequence addition. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |- smul  =  ( x  e.  ~P NN0
 ,  y  e.  ~P NN0  |->  { k  e.  NN0  |  k  e.  (  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  x  /\  ( n  -  m )  e.  y ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) ) `  (
 k  +  1 ) ) } )
 
Theoremsmufval 12684* Define the addition of two bit sequences, using df-had 1370 and df-cad 1371 bit operations. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  P  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  B ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   =>    |-  ( ph  ->  ( A smul  B )  =  {
 k  e.  NN0  |  k  e.  ( P `  ( k  +  1 ) ) } )
 
Theoremsmupf 12685* The sequence of partial sums of the sequence multiplication. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  P  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  B ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   =>    |-  ( ph  ->  P : NN0 --> ~P NN0 )
 
Theoremsmup0 12686* The initial element of the partial sum sequence. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  P  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  B ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   =>    |-  ( ph  ->  ( P `  0 )  =  (/) )
 
Theoremsmupp1 12687* The initial element of the partial sum sequence. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  P  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  B ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  ( P `  ( N  +  1 ) )  =  ( ( P `  N ) sadd  { n  e. 
 NN0  |  ( N  e.  A  /\  ( n  -  N )  e.  B ) } )
 )
 
Theoremsmuval 12688* Define the addition of two bit sequences, using df-had 1370 and df-cad 1371 bit operations. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  P  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  B ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  ( N  e.  ( A smul  B )  <->  N  e.  ( P `  ( N  +  1 ) ) ) )
 
Theoremsmuval2 12689* The partial sum sequence stabilizes at  N after the  N  +  1-th element of the sequence; this stable value is the value of the sequence multiplication. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  P  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  B ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   &    |-  ( ph  ->  M  e.  ( ZZ>= `  ( N  +  1 )
 ) )   =>    |-  ( ph  ->  ( N  e.  ( A smul  B )  <->  N  e.  ( P `  M ) ) )
 
Theoremsmupvallem 12690* If  A only has elements less than  N, then all elements of the partial sum sequence past  N already equal the final value. (Contributed by Mario Carneiro, 20-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  P  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  B ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   &    |-  ( ph  ->  A 
 C_  ( 0..^ N ) )   &    |-  ( ph  ->  M  e.  ( ZZ>= `  N ) )   =>    |-  ( ph  ->  ( P `  M )  =  ( A smul  B ) )
 
Theoremsmucl 12691 The product of two sequences is a sequence. (Contributed by Mario Carneiro, 19-Sep-2016.)
 |-  ( ( A  C_  NN0  /\  B  C_  NN0 )  ->  ( A smul  B )  C_  NN0 )
 
Theoremsmu01lem 12692* Lemma for smu01 12693 and smu02 12694. (Contributed by Mario Carneiro, 19-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  ( ( ph  /\  ( k  e.  NN0  /\  n  e.  NN0 )
 )  ->  -.  (
 k  e.  A  /\  ( n  -  k
 )  e.  B ) )   =>    |-  ( ph  ->  ( A smul  B )  =  (/) )
 
Theoremsmu01 12693 Multiplication of a sequence by  0 on the right. (Contributed by Mario Carneiro, 19-Sep-2016.)
 |-  ( A  C_  NN0  ->  ( A smul  (/) )  =  (/) )
 
Theoremsmu02 12694 Multiplication of a sequence by  0 on the left. (Contributed by Mario Carneiro, 9-Sep-2016.)
 |-  ( A  C_  NN0  ->  ( (/) smul  A )  =  (/) )
 
Theoremsmupval 12695* Rewrite the elements of the partial sum sequence in terms of sequence multiplication. (Contributed by Mario Carneiro, 20-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  P  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  B ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  ( P `  N )  =  ( ( A  i^i  ( 0..^ N ) ) smul 
 B ) )
 
Theoremsmup1 12696* Rewrite smupp1 12687 using only smul instead of the internal recursive function  P. (Contributed by Mario Carneiro, 20-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  (
 ( A  i^i  (
 0..^ ( N  +  1 ) ) ) smul 
 B )  =  ( ( ( A  i^i  ( 0..^ N ) ) smul 
 B ) sadd  { n  e.  NN0  |  ( N  e.  A  /\  ( n  -  N )  e.  B ) } )
 )
 
Theoremsmueqlem 12697* Any element of a sequence multiplication only depends on the values of the argument sequences up to and including that point. (Contributed by Mario Carneiro, 20-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  ( ph  ->  N  e.  NN0 )   &    |-  P  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  B ) } ) ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/) ,  ( n  -  1 ) ) ) )   &    |-  Q  =  seq  0 ( ( p  e.  ~P NN0 ,  m  e.  NN0  |->  ( p sadd  { n  e.  NN0  |  ( m  e.  A  /\  ( n  -  m )  e.  ( B  i^i  ( 0..^ N ) ) ) } )
 ) ,  ( n  e.  NN0  |->  if ( n  =  0 ,  (/)
 ,  ( n  -  1 ) ) ) )   =>    |-  ( ph  ->  (
 ( A smul  B )  i^i  ( 0..^ N ) )  =  ( ( ( A  i^i  (
 0..^ N ) ) smul 
 ( B  i^i  (
 0..^ N ) ) )  i^i  ( 0..^ N ) ) )
 
Theoremsmueq 12698 Any element of a sequence multiplication only depends on the values of the argument sequences up to and including that point. (Contributed by Mario Carneiro, 20-Sep-2016.)
 |-  ( ph  ->  A  C_ 
 NN0 )   &    |-  ( ph  ->  B 
 C_  NN0 )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  (
 ( A smul  B )  i^i  ( 0..^ N ) )  =  ( ( ( A  i^i  (
 0..^ N ) ) smul 
 ( B  i^i  (
 0..^ N ) ) )  i^i  ( 0..^ N ) ) )
 
Theoremsmumullem 12699 Lemma for smumul 12700. (Contributed by Mario Carneiro, 22-Sep-2016.)
 |-  ( ph  ->  A  e.  ZZ )   &    |-  ( ph  ->  B  e.  ZZ )   &    |-  ( ph  ->  N  e.  NN0 )   =>    |-  ( ph  ->  (
 ( (bits `  A )  i^i  ( 0..^ N ) ) smul  (bits `  B ) )  =  (bits `  ( ( A  mod  ( 2 ^ N ) )  x.  B ) ) )
 
Theoremsmumul 12700 For sequences that correspond to valid integers, the sequence multiplication function produces the sequence for the product. This is effectively a proof of the correctness of the multiplication process, implemented in terms of logic gates for df-sad 12658, whose correctness is verified in sadadd 12674.

Outside this range, the sequences cannot be representing integers, but the smul function still "works". This extended function is best interpreted in terms of the ring structure of the 2-adic integers. (Contributed by Mario Carneiro, 22-Sep-2016.)

 |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( (bits `  A ) smul  (bits `  B ) )  =  (bits `  ( A  x.  B ) ) )
    < 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-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32776
  Copyright terms: Public domain < Previous  Next >