		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitand-ullong-uint

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

Definitions and Theorems

Function: bitand-ullong-uint

(defun bitand-ullong-uint (x y)
  (declare (xargs :guard (and (ullongp x) (uintp y))))
  (bitand-ullong-ullong x (ullong-from-uint y)))

Theorem: ullongp-of-bitand-ullong-uint

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

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

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

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

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

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

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

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

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