		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Sub-schar-sint-okp

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

Definitions and Theorems

Function: sub-schar-sint-okp

(defun sub-schar-sint-okp (x y)
  (declare (xargs :guard (and (scharp x) (sintp y))))
  (sub-sint-sint-okp (sint-from-schar x)
                     y))

Theorem: booleanp-of-sub-schar-sint-okp

(defthm booleanp-of-sub-schar-sint-okp
  (booleanp (sub-schar-sint-okp x y)))

Theorem: sub-schar-sint-okp-of-schar-fix-x

(defthm sub-schar-sint-okp-of-schar-fix-x
  (equal (sub-schar-sint-okp (schar-fix x) y)
         (sub-schar-sint-okp x y)))

Theorem: sub-schar-sint-okp-schar-equiv-congruence-on-x

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

Theorem: sub-schar-sint-okp-of-sint-fix-y

(defthm sub-schar-sint-okp-of-sint-fix-y
  (equal (sub-schar-sint-okp x (sint-fix y))
         (sub-schar-sint-okp x y)))

Theorem: sub-schar-sint-okp-sint-equiv-congruence-on-y

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