Bitwise conjunction of a value of type
Function:
(defun bitand-sint-schar (x y) (declare (xargs :guard (and (sintp x) (scharp y)))) (bitand-sint-sint x (sint-from-schar y)))
Theorem:
(defthm sintp-of-bitand-sint-schar (sintp (bitand-sint-schar x y)))
Theorem:
(defthm bitand-sint-schar-of-sint-fix-x (equal (bitand-sint-schar (sint-fix x) y) (bitand-sint-schar x y)))
Theorem:
(defthm bitand-sint-schar-sint-equiv-congruence-on-x (implies (sint-equiv x x-equiv) (equal (bitand-sint-schar x y) (bitand-sint-schar x-equiv y))) :rule-classes :congruence)
Theorem:
(defthm bitand-sint-schar-of-schar-fix-y (equal (bitand-sint-schar x (schar-fix y)) (bitand-sint-schar x y)))
Theorem:
(defthm bitand-sint-schar-schar-equiv-congruence-on-y (implies (schar-equiv y y-equiv) (equal (bitand-sint-schar x y) (bitand-sint-schar x y-equiv))) :rule-classes :congruence)