		Search-engine friendly clone of the ACL2 documentation.

Sparseint

Sparseint-binary-bitop

Apply a binary bitwise operation (represented as a 4-bit truth table) to two sparseints.

Signature
(sparseint-binary-bitop op x y) → binary-res
Arguments: op — Guard (integerp op).; x — Guard (sparseint-p x).; y — Guard (sparseint-p y).
Returns: binary-res — Type (sparseint-p binary-res).

Definitions and Theorems

Function: sparseint-binary-bitop$inline

(defun sparseint-binary-bitop$inline (op x y)
  (declare (type (unsigned-byte 4) op))
  (declare (xargs :guard (and (integerp op)
                              (sparseint-p x)
                              (sparseint-p y))))
  (let ((__function__ 'sparseint-binary-bitop))
    (declare (ignorable __function__))
    (sparseint$-binary-bitop op (sparseint-fix x)
                             (sparseint-fix y))))

Theorem: sparseint-p-of-sparseint-binary-bitop

(defthm sparseint-p-of-sparseint-binary-bitop
  (b* ((binary-res (sparseint-binary-bitop$inline op x y)))
    (sparseint-p binary-res))
  :rule-classes :rewrite)

Theorem: sparseint-val-of-sparseint-binary-bitop

(defthm sparseint-val-of-sparseint-binary-bitop
  (b* ((?binary-res (sparseint-binary-bitop$inline op x y)))
    (equal (sparseint-val binary-res)
           (binary-bitop op (sparseint-val x)
                         (sparseint-val y)))))

Theorem: sparseint-binary-bitop$inline-of-ifix-op

(defthm sparseint-binary-bitop$inline-of-ifix-op
  (equal (sparseint-binary-bitop$inline (ifix op)
                                        x y)
         (sparseint-binary-bitop$inline op x y)))

Theorem: sparseint-binary-bitop$inline-int-equiv-congruence-on-op

(defthm sparseint-binary-bitop$inline-int-equiv-congruence-on-op
  (implies (int-equiv op op-equiv)
           (equal (sparseint-binary-bitop$inline op x y)
                  (sparseint-binary-bitop$inline op-equiv x y)))
  :rule-classes :congruence)

Theorem: sparseint-binary-bitop$inline-of-sparseint-fix-x

(defthm sparseint-binary-bitop$inline-of-sparseint-fix-x
  (equal (sparseint-binary-bitop$inline op (sparseint-fix x)
                                        y)
         (sparseint-binary-bitop$inline op x y)))

Theorem: sparseint-binary-bitop$inline-sparseint-equiv-congruence-on-x

(defthm
      sparseint-binary-bitop$inline-sparseint-equiv-congruence-on-x
  (implies (sparseint-equiv x x-equiv)
           (equal (sparseint-binary-bitop$inline op x y)
                  (sparseint-binary-bitop$inline op x-equiv y)))
  :rule-classes :congruence)

Theorem: sparseint-binary-bitop$inline-of-sparseint-fix-y

(defthm sparseint-binary-bitop$inline-of-sparseint-fix-y
  (equal (sparseint-binary-bitop$inline op x (sparseint-fix y))
         (sparseint-binary-bitop$inline op x y)))

Theorem: sparseint-binary-bitop$inline-sparseint-equiv-congruence-on-y

(defthm
      sparseint-binary-bitop$inline-sparseint-equiv-congruence-on-y
  (implies (sparseint-equiv y y-equiv)
           (equal (sparseint-binary-bitop$inline op x y)
                  (sparseint-binary-bitop$inline op x y-equiv)))
  :rule-classes :congruence)