		Search-engine friendly clone of the ACL2 documentation.

Op-funct

Op-funct-p

Recognizer for op-funct structures.

Signature
(op-funct-p x) → *

Definitions and Theorems

Function: op-funct-p

(defun op-funct-p (x)
  (declare (xargs :guard t))
  (let ((__function__ 'op-funct-p))
    (declare (ignorable __function__))
    (and (consp x)
         (cond ((or (atom x) (eq (car x) :add))
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :sub)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :slt)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :sltu)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :and)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :or)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :xor)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :sll)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :srl)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :sra)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :mul)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :mulh)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :mulhu)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :mulhsu)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :div)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :divu)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               ((eq (car x) :rem)
                (and (true-listp (cdr x))
                     (eql (len (cdr x)) 0)
                     (b* nil t)))
               (t (and (eq (car x) :remu)
                       (and (true-listp (cdr x))
                            (eql (len (cdr x)) 0))
                       (b* nil t)))))))

Theorem: consp-when-op-funct-p

(defthm consp-when-op-funct-p
  (implies (op-funct-p x) (consp x))
  :rule-classes :compound-recognizer)