		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitand-ulong-ullong

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

Definitions and Theorems

Function: bitand-ulong-ullong

(defun bitand-ulong-ullong (x y)
  (declare (xargs :guard (and (ulongp x) (ullongp y))))
  (bitand-ullong-ullong (ullong-from-ulong x)
                        y))

Theorem: ullongp-of-bitand-ulong-ullong

(defthm ullongp-of-bitand-ulong-ullong
  (ullongp (bitand-ulong-ullong x y)))

Theorem: bitand-ulong-ullong-of-ulong-fix-x

(defthm bitand-ulong-ullong-of-ulong-fix-x
  (equal (bitand-ulong-ullong (ulong-fix x) y)
         (bitand-ulong-ullong x y)))

Theorem: bitand-ulong-ullong-ulong-equiv-congruence-on-x

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

Theorem: bitand-ulong-ullong-of-ullong-fix-y

(defthm bitand-ulong-ullong-of-ullong-fix-y
  (equal (bitand-ulong-ullong x (ullong-fix y))
         (bitand-ulong-ullong x y)))

Theorem: bitand-ulong-ullong-ullong-equiv-congruence-on-y

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