		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Rem-sint-ullong-okp

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

Definitions and Theorems

Function: rem-sint-ullong-okp

(defun rem-sint-ullong-okp (x y)
  (declare (xargs :guard (and (sintp x) (ullongp y))))
  (rem-ullong-ullong-okp (ullong-from-sint x)
                         y))

Theorem: booleanp-of-rem-sint-ullong-okp

(defthm booleanp-of-rem-sint-ullong-okp
  (booleanp (rem-sint-ullong-okp x y)))

Theorem: rem-sint-ullong-okp-of-sint-fix-x

(defthm rem-sint-ullong-okp-of-sint-fix-x
  (equal (rem-sint-ullong-okp (sint-fix x) y)
         (rem-sint-ullong-okp x y)))

Theorem: rem-sint-ullong-okp-sint-equiv-congruence-on-x

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

Theorem: rem-sint-ullong-okp-of-ullong-fix-y

(defthm rem-sint-ullong-okp-of-ullong-fix-y
  (equal (rem-sint-ullong-okp x (ullong-fix y))
         (rem-sint-ullong-okp x y)))

Theorem: rem-sint-ullong-okp-ullong-equiv-congruence-on-y

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