		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Div-schar-ulong-okp

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

Definitions and Theorems

Function: div-schar-ulong-okp

(defun div-schar-ulong-okp (x y)
  (declare (xargs :guard (and (scharp x) (ulongp y))))
  (div-ulong-ulong-okp (ulong-from-schar x)
                       y))

Theorem: booleanp-of-div-schar-ulong-okp

(defthm booleanp-of-div-schar-ulong-okp
  (booleanp (div-schar-ulong-okp x y)))

Theorem: div-schar-ulong-okp-of-schar-fix-x

(defthm div-schar-ulong-okp-of-schar-fix-x
  (equal (div-schar-ulong-okp (schar-fix x) y)
         (div-schar-ulong-okp x y)))

Theorem: div-schar-ulong-okp-schar-equiv-congruence-on-x

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

Theorem: div-schar-ulong-okp-of-ulong-fix-y

(defthm div-schar-ulong-okp-of-ulong-fix-y
  (equal (div-schar-ulong-okp x (ulong-fix y))
         (div-schar-ulong-okp x y)))

Theorem: div-schar-ulong-okp-ulong-equiv-congruence-on-y

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