		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitand-uchar-sint

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

Definitions and Theorems

Function: bitand-uchar-sint

(defun bitand-uchar-sint (x y)
  (declare (xargs :guard (and (ucharp x) (sintp y))))
  (bitand-sint-sint (sint-from-uchar x)
                    y))

Theorem: sintp-of-bitand-uchar-sint

(defthm sintp-of-bitand-uchar-sint
  (sintp (bitand-uchar-sint x y)))

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

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

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

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

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

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

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

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