		Search-engine friendly clone of the ACL2 documentation.

Representation-of-integers

Ulongp

Recognizer of values of type unsigned long.

Signature
(ulongp x) → yes/no
Returns: yes/no — Type (booleanp yes/no).

Definitions and Theorems

Function: ulongp

(defun ulongp (x)
  (declare (xargs :guard t))
  (let ((__function__ 'ulongp))
    (declare (ignorable __function__))
    (and (consp x)
         (eq (car x) :ulong)
         (true-listp (cdr x))
         (eql (len (cdr x)) 1)
         (b* ((get (std::da-nth 0 (cdr x))))
           (ulong-integerp get)))))

Theorem: booleanp-of-ulongp

(defthm booleanp-of-ulongp
  (b* ((yes/no (ulongp x)))
    (booleanp yes/no))
  :rule-classes :rewrite)

Theorem: consp-when-ulongp

(defthm consp-when-ulongp
  (implies (ulongp x) (consp x))
  :rule-classes :compound-recognizer)