		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Sub-sshort-uchar-okp

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

Definitions and Theorems

Function: sub-sshort-uchar-okp

(defun sub-sshort-uchar-okp (x y)
  (declare (xargs :guard (and (sshortp x) (ucharp y))))
  (sub-sint-sint-okp (sint-from-sshort x)
                     (sint-from-uchar y)))

Theorem: booleanp-of-sub-sshort-uchar-okp

(defthm booleanp-of-sub-sshort-uchar-okp
  (booleanp (sub-sshort-uchar-okp x y)))

Theorem: sub-sshort-uchar-okp-of-sshort-fix-x

(defthm sub-sshort-uchar-okp-of-sshort-fix-x
  (equal (sub-sshort-uchar-okp (sshort-fix x) y)
         (sub-sshort-uchar-okp x y)))

Theorem: sub-sshort-uchar-okp-sshort-equiv-congruence-on-x

(defthm sub-sshort-uchar-okp-sshort-equiv-congruence-on-x
  (implies (sshort-equiv x x-equiv)
           (equal (sub-sshort-uchar-okp x y)
                  (sub-sshort-uchar-okp x-equiv y)))
  :rule-classes :congruence)

Theorem: sub-sshort-uchar-okp-of-uchar-fix-y

(defthm sub-sshort-uchar-okp-of-uchar-fix-y
  (equal (sub-sshort-uchar-okp x (uchar-fix y))
         (sub-sshort-uchar-okp x y)))

Theorem: sub-sshort-uchar-okp-uchar-equiv-congruence-on-y

(defthm sub-sshort-uchar-okp-uchar-equiv-congruence-on-y
  (implies (uchar-equiv y y-equiv)
           (equal (sub-sshort-uchar-okp x y)
                  (sub-sshort-uchar-okp x y-equiv)))
  :rule-classes :congruence)