		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Div-sint-uchar-okp

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

Definitions and Theorems

Function: div-sint-uchar-okp

(defun div-sint-uchar-okp (x y)
  (declare (xargs :guard (and (sintp x) (ucharp y))))
  (div-sint-sint-okp x (sint-from-uchar y)))

Theorem: booleanp-of-div-sint-uchar-okp

(defthm booleanp-of-div-sint-uchar-okp
  (booleanp (div-sint-uchar-okp x y)))

Theorem: div-sint-uchar-okp-of-sint-fix-x

(defthm div-sint-uchar-okp-of-sint-fix-x
  (equal (div-sint-uchar-okp (sint-fix x) y)
         (div-sint-uchar-okp x y)))

Theorem: div-sint-uchar-okp-sint-equiv-congruence-on-x

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

Theorem: div-sint-uchar-okp-of-uchar-fix-y

(defthm div-sint-uchar-okp-of-uchar-fix-y
  (equal (div-sint-uchar-okp x (uchar-fix y))
         (div-sint-uchar-okp x y)))

Theorem: div-sint-uchar-okp-uchar-equiv-congruence-on-y

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