		Search-engine friendly clone of the ACL2 documentation.

Sparseint

Sparseint-bitnand

Compute the lognand of two sparseints.

Signature
(sparseint-bitnand x y) → res
Arguments: x — Guard (sparseint-p x).; y — Guard (sparseint-p y).
Returns: res — Type (sparseint-p res).

Definitions and Theorems

Function: sparseint-bitnand$inline

(defun sparseint-bitnand$inline (x y)
  (declare (xargs :guard (and (sparseint-p x) (sparseint-p y))))
  (let ((__function__ 'sparseint-bitnand))
    (declare (ignorable __function__))
    (sparseint-binary-bitop 7 x y)))

Theorem: sparseint-p-of-sparseint-bitnand

(defthm sparseint-p-of-sparseint-bitnand
  (b* ((res (sparseint-bitnand$inline x y)))
    (sparseint-p res))
  :rule-classes :type-prescription)

Theorem: sparseint-bitnand-correct

(defthm sparseint-bitnand-correct
  (b* ((?res (sparseint-bitnand$inline x y)))
    (equal (sparseint-val res)
           (lognand (sparseint-val x)
                    (sparseint-val y)))))

Theorem: sparseint-bitnand$inline-of-sparseint-fix-x

(defthm sparseint-bitnand$inline-of-sparseint-fix-x
  (equal (sparseint-bitnand$inline (sparseint-fix x)
                                   y)
         (sparseint-bitnand$inline x y)))

Theorem: sparseint-bitnand$inline-sparseint-equiv-congruence-on-x

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

Theorem: sparseint-bitnand$inline-of-sparseint-fix-y

(defthm sparseint-bitnand$inline-of-sparseint-fix-y
  (equal (sparseint-bitnand$inline x (sparseint-fix y))
         (sparseint-bitnand$inline x y)))

Theorem: sparseint-bitnand$inline-sparseint-equiv-congruence-on-y

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