		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integer-operations

Ge-ulong-schar

Greater-than-or-equal-to relation of a value of type unsigned long and a value of type signed char [C:6.5.8].

Definitions and Theorems

Function: ge-ulong-schar

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

Theorem: sintp-of-ge-ulong-schar

(defthm sintp-of-ge-ulong-schar
  (sintp (ge-ulong-schar x y)))

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

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

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

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

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

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

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

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