		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Bitand-schar-ushort

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

Definitions and Theorems

Function: bitand-schar-ushort

(defun bitand-schar-ushort (x y)
  (declare (xargs :guard (and (scharp x) (ushortp y))))
  (bitand-sint-sint (sint-from-schar x)
                    (sint-from-ushort y)))

Theorem: sintp-of-bitand-schar-ushort

(defthm sintp-of-bitand-schar-ushort
  (sintp (bitand-schar-ushort x y)))

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

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

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

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

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

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

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

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