		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitand-uint-ushort

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

Definitions and Theorems

Function: bitand-uint-ushort

(defun bitand-uint-ushort (x y)
  (declare (xargs :guard (and (uintp x) (ushortp y))))
  (bitand-uint-uint x (uint-from-ushort y)))

Theorem: uintp-of-bitand-uint-ushort

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

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

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

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

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

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

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

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

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