		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitand-sllong-ushort

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

Definitions and Theorems

Function: bitand-sllong-ushort

(defun bitand-sllong-ushort (x y)
  (declare (xargs :guard (and (sllongp x) (ushortp y))))
  (bitand-sllong-sllong x (sllong-from-ushort y)))

Theorem: sllongp-of-bitand-sllong-ushort

(defthm sllongp-of-bitand-sllong-ushort
  (sllongp (bitand-sllong-ushort x y)))

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

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

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

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

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

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

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

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