		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitand-ullong-sint

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

Definitions and Theorems

Function: bitand-ullong-sint

(defun bitand-ullong-sint (x y)
  (declare (xargs :guard (and (ullongp x) (sintp y))))
  (bitand-ullong-ullong x (ullong-from-sint y)))

Theorem: ullongp-of-bitand-ullong-sint

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

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

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

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

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

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

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

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

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