		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Div-ulong-sint

Division of a value of type unsigned long and a value of type signed int [C17:6.5.5].

Definitions and Theorems

Function: div-ulong-sint

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

Theorem: ulongp-of-div-ulong-sint

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

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

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

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

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

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

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

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

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