		Search-engine friendly clone of the ACL2 documentation.

Lucid

Vl-lucidmergealist-count

Signature
(vl-lucidmergealist-count x) → count
Arguments: x — Guard (vl-lucidmergealist-p x).
Returns: count — Type (natp count).

Definitions and Theorems

Function: vl-lucidmergealist-count

(defun vl-lucidmergealist-count (x)
  (declare (xargs :guard (vl-lucidmergealist-p x)))
  (let ((__function__ 'vl-lucidmergealist-count))
    (declare (ignorable __function__))
    (let ((x (mbe :logic (vl-lucidmergealist-fix x)
                  :exec x)))
      (if (atom x)
          1
        (+ 1
           (vl-lucidmergealist-count (cdr x)))))))

Theorem: natp-of-vl-lucidmergealist-count

(defthm natp-of-vl-lucidmergealist-count
  (b* ((count (vl-lucidmergealist-count x)))
    (natp count))
  :rule-classes :type-prescription)

Theorem: vl-lucidmergealist-count-of-vl-lucidmergealist-fix-x

(defthm vl-lucidmergealist-count-of-vl-lucidmergealist-fix-x
  (equal (vl-lucidmergealist-count (vl-lucidmergealist-fix x))
         (vl-lucidmergealist-count x)))

Theorem: vl-lucidmergealist-count-vl-lucidmergealist-equiv-congruence-on-x

(defthm
  vl-lucidmergealist-count-vl-lucidmergealist-equiv-congruence-on-x
  (implies (vl-lucidmergealist-equiv x x-equiv)
           (equal (vl-lucidmergealist-count x)
                  (vl-lucidmergealist-count x-equiv)))
  :rule-classes :congruence)

Theorem: vl-lucidmergealist-count-of-cons

(defthm vl-lucidmergealist-count-of-cons
  (>= (vl-lucidmergealist-count (cons acl2::a acl2::b))
      (vl-lucidmergealist-count acl2::b))
  :rule-classes :linear)

Theorem: vl-lucidmergealist-count-of-cdr

(defthm vl-lucidmergealist-count-of-cdr
  (<= (vl-lucidmergealist-count (cdr x))
      (vl-lucidmergealist-count x))
  :rule-classes :linear)

Theorem: vl-lucidmergealist-count-of-cdr-strong

(defthm vl-lucidmergealist-count-of-cdr-strong
  (implies (and (vl-lucidmergealist-p x) (consp x))
           (< (vl-lucidmergealist-count (cdr x))
              (vl-lucidmergealist-count x)))
  :rule-classes :linear)