• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
    • Kestrel-books
      • Crypto-hdwallet
      • Apt
      • Error-checking
      • Fty-extensions
      • Isar
      • Kestrel-utilities
      • Set
      • Soft
      • C
      • Bv
      • Imp-language
      • Event-macros
      • Java
      • Bitcoin
      • Ethereum
      • Yul
      • Zcash
      • ACL2-programming-language
      • Prime-fields
      • Json
      • Syntheto
      • File-io-light
      • Cryptography
      • Number-theory
      • Lists-light
      • Axe
      • Builtins
      • Solidity
        • Values
          • Integer-values
            • Integer-operations
            • Bit-size
            • Uint
              • Uintp
              • Uint-fix
              • Uint-equiv
              • Make-uint
              • Change-uint
              • Uint->value
              • Uint->size
            • Int
          • Boolean-values
      • Helpers
      • Htclient
      • Typed-lists-light
      • Arithmetic-light
    • X86isa
    • Axe
    • Execloader
  • Math
  • Testing-utilities

• Uint

Uint-fix

Fixing function for uint structures.

Signature

(uint-fix x) → new-x

Arguments

x — Guard (uintp x).

Returns

new-x — Type (uintp new-x).

Definitions and Theorems

Function: uint-fix$inline

(defun uint-fix$inline (x)
  (declare (xargs :guard (uintp x)))
  (let ((__function__ 'uint-fix))
    (declare (ignorable __function__))
    (mbe :logic
         (b* ((size (bit-size-fix (std::da-nth 0 (cdr x))))
              (value (nfix (std::da-nth 1 (cdr x)))))
           (let ((value (unsigned-byte-fix size value)))
             (cons :uint (list size value))))
         :exec x)))

Theorem: uintp-of-uint-fix

(defthm uintp-of-uint-fix
  (b* ((new-x (uint-fix$inline x)))
    (uintp new-x))
  :rule-classes :rewrite)

Theorem: uint-fix-when-uintp

(defthm uint-fix-when-uintp
  (implies (uintp x)
           (equal (uint-fix x) x)))

Function: uint-equiv$inline

(defun uint-equiv$inline (acl2::x acl2::y)
  (declare (xargs :guard (and (uintp acl2::x) (uintp acl2::y))))
  (equal (uint-fix acl2::x)
         (uint-fix acl2::y)))

Theorem: uint-equiv-is-an-equivalence

(defthm uint-equiv-is-an-equivalence
  (and (booleanp (uint-equiv x y))
       (uint-equiv x x)
       (implies (uint-equiv x y)
                (uint-equiv y x))
       (implies (and (uint-equiv x y) (uint-equiv y z))
                (uint-equiv x z)))
  :rule-classes (:equivalence))

Theorem: uint-equiv-implies-equal-uint-fix-1

(defthm uint-equiv-implies-equal-uint-fix-1
  (implies (uint-equiv acl2::x x-equiv)
           (equal (uint-fix acl2::x)
                  (uint-fix x-equiv)))
  :rule-classes (:congruence))

Theorem: uint-fix-under-uint-equiv

(defthm uint-fix-under-uint-equiv
  (uint-equiv (uint-fix acl2::x) acl2::x)
  :rule-classes (:rewrite :rewrite-quoted-constant))

Theorem: equal-of-uint-fix-1-forward-to-uint-equiv

(defthm equal-of-uint-fix-1-forward-to-uint-equiv
  (implies (equal (uint-fix acl2::x) acl2::y)
           (uint-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: equal-of-uint-fix-2-forward-to-uint-equiv

(defthm equal-of-uint-fix-2-forward-to-uint-equiv
  (implies (equal acl2::x (uint-fix acl2::y))
           (uint-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: uint-equiv-of-uint-fix-1-forward

(defthm uint-equiv-of-uint-fix-1-forward
  (implies (uint-equiv (uint-fix acl2::x) acl2::y)
           (uint-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: uint-equiv-of-uint-fix-2-forward

(defthm uint-equiv-of-uint-fix-2-forward
  (implies (uint-equiv acl2::x (uint-fix acl2::y))
           (uint-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)