		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Div-schar-ulong

Division of a value of type signed char and a value of type unsigned long [C:6.5.5].

Definitions and Theorems

Function: div-schar-ulong

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

Theorem: ulongp-of-div-schar-ulong

(defthm ulongp-of-div-schar-ulong
  (ulongp (div-schar-ulong x y)))

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

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

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

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

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

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

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

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