• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
        • Proof-support
        • Semantics
        • Lifting
        • R1cs-subset
        • Well-formedness
        • Abstract-syntax
          • Syntax-abstraction
            • Abs-*-decimal-digit-to-nat
              • Abs-?-expression-*-comma-expression
              • Abs-?-constraint-*-comma-constraint
              • Abs-*-letter/decimaldigit/underscore
              • Abs-letter/decimaldigit/underscore
              • Abs-?-identifier-*-comma-identifier
              • Abs-*-comma-constraint
              • Abs-definition
              • Abs-*-comma-identifier
              • Abs-*-comma-expression
              • Abs-decimal-digit-to-nat
              • Abs-*-definition
              • Abs-*-constraint
              • Abs-relation-constraint
              • Abs-decimal-digit-to-char
              • Abs-uppercase-letter
              • Abs-lowercase-letter
              • Abs-equality-constraint
              • Check-optional-minus-sign-p
              • Abs-letter
              • Abs-comma-expression
              • Abs-comma-constraint
              • Abs-constraint
              • Abs-comma-identifier
              • Check-?-comma
              • Abs-identifier
              • Abs-system
              • Abs-numeral
              • Abs-unary-minus-expression
              • Abs-primary-expression
              • Abs-multiplication-expression
              • Abs-additive-expression
              • Abs-expression
            • Abstract-syntax-trees
            • Abstract-syntax-operations
            • Convenience-constructors
          • Concrete-syntax
          • R1cs-bridge
          • Parser-interface
        • Legacy-defrstobj
        • C
        • Proof-checker-array
        • Soft
        • Farray
        • Rp-rewriter
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Ethereum
        • Leftist-trees
        • Java
        • Riscv
        • Taspi
        • Bitcoin
        • Zcash
        • Des
        • X86isa
        • Sha-2
        • Yul
        • Proof-checker-itp13
        • Regex
        • ACL2-programming-language
        • Json
        • Jfkr
        • Equational
        • Cryptography
        • Axe
        • Poseidon
        • Where-do-i-place-my-book
        • Aleo
        • Bigmems
        • Builtins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Community
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Syntax-abstraction

    Abs-*-decimal-digit-to-nat

    Abstract a *decimal-digit to a natural number, interpreting the digits in big endian.

    Signature
    (abs-*-decimal-digit-to-nat trees) → nat
    Arguments
    trees — Guard (abnf::tree-listp trees).
    Returns
    nat — Type (nat-resultp nat).

    Definitions and Theorems

    Function: abs-*-decimal-digit-to-nat-aux

    (defun abs-*-decimal-digit-to-nat-aux (trees current)
      (declare (xargs :guard (and (abnf::tree-listp trees)
                                  (natp current))))
      (let ((__function__ 'abs-*-decimal-digit-to-nat-aux))
        (declare (ignorable __function__))
        (b* (((when (endp trees)) (nfix current))
             ((okf digit-nat)
              (abs-decimal-digit-to-nat (car trees))))
          (abs-*-decimal-digit-to-nat-aux
               (cdr trees)
               (+ digit-nat (* (nfix current) 10))))))

    Theorem: nat-resultp-of-abs-*-decimal-digit-to-nat-aux

    (defthm nat-resultp-of-abs-*-decimal-digit-to-nat-aux
      (b* ((nat (abs-*-decimal-digit-to-nat-aux trees current)))
        (nat-resultp nat))
      :rule-classes :rewrite)

    Theorem: abs-*-decimal-digit-to-nat-aux-of-tree-list-fix-trees

    (defthm abs-*-decimal-digit-to-nat-aux-of-tree-list-fix-trees
      (equal (abs-*-decimal-digit-to-nat-aux (abnf::tree-list-fix trees)
                                             current)
             (abs-*-decimal-digit-to-nat-aux trees current)))

    Theorem: abs-*-decimal-digit-to-nat-aux-tree-list-equiv-congruence-on-trees

    (defthm
     abs-*-decimal-digit-to-nat-aux-tree-list-equiv-congruence-on-trees
     (implies
          (abnf::tree-list-equiv trees trees-equiv)
          (equal (abs-*-decimal-digit-to-nat-aux trees current)
                 (abs-*-decimal-digit-to-nat-aux trees-equiv current)))
     :rule-classes :congruence)

    Theorem: abs-*-decimal-digit-to-nat-aux-of-nfix-current

    (defthm abs-*-decimal-digit-to-nat-aux-of-nfix-current
      (equal (abs-*-decimal-digit-to-nat-aux trees (nfix current))
             (abs-*-decimal-digit-to-nat-aux trees current)))

    Theorem: abs-*-decimal-digit-to-nat-aux-nat-equiv-congruence-on-current

    (defthm
         abs-*-decimal-digit-to-nat-aux-nat-equiv-congruence-on-current
      (implies
           (acl2::nat-equiv current current-equiv)
           (equal (abs-*-decimal-digit-to-nat-aux trees current)
                  (abs-*-decimal-digit-to-nat-aux trees current-equiv)))
      :rule-classes :congruence)

    Function: abs-*-decimal-digit-to-nat

    (defun abs-*-decimal-digit-to-nat (trees)
      (declare (xargs :guard (abnf::tree-listp trees)))
      (let ((__function__ 'abs-*-decimal-digit-to-nat))
        (declare (ignorable __function__))
        (abs-*-decimal-digit-to-nat-aux trees 0)))

    Theorem: nat-resultp-of-abs-*-decimal-digit-to-nat

    (defthm nat-resultp-of-abs-*-decimal-digit-to-nat
      (b* ((nat (abs-*-decimal-digit-to-nat trees)))
        (nat-resultp nat))
      :rule-classes :rewrite)

    Theorem: natp-of-abs-*-decimal-digit-to-nat

    (defthm natp-of-abs-*-decimal-digit-to-nat
      (b* ((acl2::?nat (abs-*-decimal-digit-to-nat trees)))
        (implies (not (reserrp nat))
                 (natp nat)))
      :rule-classes :forward-chaining)

    Theorem: abs-*-decimal-digit-to-nat-of-tree-list-fix-trees

    (defthm abs-*-decimal-digit-to-nat-of-tree-list-fix-trees
      (equal (abs-*-decimal-digit-to-nat (abnf::tree-list-fix trees))
             (abs-*-decimal-digit-to-nat trees)))

    Theorem: abs-*-decimal-digit-to-nat-tree-list-equiv-congruence-on-trees

    (defthm
         abs-*-decimal-digit-to-nat-tree-list-equiv-congruence-on-trees
      (implies (abnf::tree-list-equiv trees trees-equiv)
               (equal (abs-*-decimal-digit-to-nat trees)
                      (abs-*-decimal-digit-to-nat trees-equiv)))
      :rule-classes :congruence)