• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Zfc
    • Acre
    • Milawa
    • Smtlink
    • Abnf
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Pfcs
    • Legacy-defrstobj
    • Proof-checker-array
    • Soft
    • C
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Leftist-trees
    • Java
    • Taspi
    • Bitcoin
    • Riscv
    • Des
    • Ethereum
    • X86isa
    • Sha-2
    • Yul
    • Zcash
    • Proof-checker-itp13
    • Regex
    • ACL2-programming-language
    • Json
    • Jfkr
    • Equational
    • Cryptography
    • Poseidon
    • Where-do-i-place-my-book
    • Axe
    • Bigmems
    • Builtins
    • Execloader
    • Aleo
    • Solidity
      • Values
        • Integer-values
          • Integer-operations
          • Bit-size
          • Uint
          • Int
            • Intp
            • Int-fix
            • Make-int
            • Int-equiv
            • Change-int
            • Int->value
            • Int->size
        • Boolean-values
    • Paco
    • Concurrent-programs
    • Bls12-377-curves
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Int

Int-fix

Fixing function for int structures.

Signature

(int-fix x) → new-x

Arguments

x — Guard (intp x).

Returns

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

Definitions and Theorems

Function: int-fix$inline

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

Theorem: intp-of-int-fix

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

Theorem: int-fix-when-intp

(defthm int-fix-when-intp
  (implies (intp x)
           (equal (int-fix x) x)))

Function: int-equiv$inline

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

Theorem: int-equiv-is-an-equivalence

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

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

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

Theorem: int-fix-under-int-equiv

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

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

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

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

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

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

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

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

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