		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitand-uint-uint

Bitwise conjunction of a value of type unsigned int and a value of type unsigned int [C17:6.5.10].

Definitions and Theorems

Function: bitand-uint-uint

(defun bitand-uint-uint (x y)
  (declare (xargs :guard (and (uintp x) (uintp y))))
  (uint-from-integer (logand (integer-from-uint x)
                             (integer-from-uint y))))

Theorem: uintp-of-bitand-uint-uint

(defthm uintp-of-bitand-uint-uint
  (uintp (bitand-uint-uint x y)))

Theorem: bitand-uint-uint-of-uint-fix-x

(defthm bitand-uint-uint-of-uint-fix-x
  (equal (bitand-uint-uint (uint-fix x) y)
         (bitand-uint-uint x y)))

Theorem: bitand-uint-uint-uint-equiv-congruence-on-x

(defthm bitand-uint-uint-uint-equiv-congruence-on-x
  (implies (uint-equiv x x-equiv)
           (equal (bitand-uint-uint x y)
                  (bitand-uint-uint x-equiv y)))
  :rule-classes :congruence)

Theorem: bitand-uint-uint-of-uint-fix-y

(defthm bitand-uint-uint-of-uint-fix-y
  (equal (bitand-uint-uint x (uint-fix y))
         (bitand-uint-uint x y)))

Theorem: bitand-uint-uint-uint-equiv-congruence-on-y

(defthm bitand-uint-uint-uint-equiv-congruence-on-y
  (implies (uint-equiv y y-equiv)
           (equal (bitand-uint-uint x y)
                  (bitand-uint-uint x y-equiv)))
  :rule-classes :congruence)