		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Div-uint-uint-okp

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

Definitions and Theorems

Function: div-uint-uint-okp

(defun div-uint-uint-okp (x y)
  (declare (xargs :guard (and (uintp x) (uintp y))))
  (not (equal (integer-from-uint y) 0)))

Theorem: booleanp-of-div-uint-uint-okp

(defthm booleanp-of-div-uint-uint-okp
  (booleanp (div-uint-uint-okp x y)))

Theorem: div-uint-uint-okp-of-uint-fix-x

(defthm div-uint-uint-okp-of-uint-fix-x
  (equal (div-uint-uint-okp (uint-fix x) y)
         (div-uint-uint-okp x y)))

Theorem: div-uint-uint-okp-uint-equiv-congruence-on-x

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

Theorem: div-uint-uint-okp-of-uint-fix-y

(defthm div-uint-uint-okp-of-uint-fix-y
  (equal (div-uint-uint-okp x (uint-fix y))
         (div-uint-uint-okp x y)))

Theorem: div-uint-uint-okp-uint-equiv-congruence-on-y

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