		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Rem-sllong-sint-okp

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

Definitions and Theorems

Function: rem-sllong-sint-okp

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

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

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

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

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

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

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

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

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

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

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