		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Mul-sint-ushort-okp

Check if the multiplication of a value of type signed int and a value of type unsigned short is well-defined.

Definitions and Theorems

Function: mul-sint-ushort-okp

(defun mul-sint-ushort-okp (x y)
  (declare (xargs :guard (and (sintp x) (ushortp y))))
  (mul-sint-sint-okp x (sint-from-ushort y)))

Theorem: booleanp-of-mul-sint-ushort-okp

(defthm booleanp-of-mul-sint-ushort-okp
  (booleanp (mul-sint-ushort-okp x y)))

Theorem: mul-sint-ushort-okp-of-sint-fix-x

(defthm mul-sint-ushort-okp-of-sint-fix-x
  (equal (mul-sint-ushort-okp (sint-fix x) y)
         (mul-sint-ushort-okp x y)))

Theorem: mul-sint-ushort-okp-sint-equiv-congruence-on-x

(defthm mul-sint-ushort-okp-sint-equiv-congruence-on-x
  (implies (sint-equiv x x-equiv)
           (equal (mul-sint-ushort-okp x y)
                  (mul-sint-ushort-okp x-equiv y)))
  :rule-classes :congruence)

Theorem: mul-sint-ushort-okp-of-ushort-fix-y

(defthm mul-sint-ushort-okp-of-ushort-fix-y
  (equal (mul-sint-ushort-okp x (ushort-fix y))
         (mul-sint-ushort-okp x y)))

Theorem: mul-sint-ushort-okp-ushort-equiv-congruence-on-y

(defthm mul-sint-ushort-okp-ushort-equiv-congruence-on-y
  (implies (ushort-equiv y y-equiv)
           (equal (mul-sint-ushort-okp x y)
                  (mul-sint-ushort-okp x y-equiv)))
  :rule-classes :congruence)