		Search-engine friendly clone of the ACL2 documentation.

Lucid

Vl-lucid-resolved-slices->bits

Signature
(vl-lucid-resolved-slices->bits x ctx) → indices
Arguments: x — Guard (vl-lucidocclist-p x).; ctx — Guard (any-p ctx).
Returns: indices — Type (and (integer-listp indices) (setp indices)).

Definitions and Theorems

Function: vl-lucid-resolved-slices->bits

(defun vl-lucid-resolved-slices->bits (x ctx)
  (declare (xargs :guard (and (vl-lucidocclist-p x)
                              (any-p ctx))))
  (declare (xargs :guard (and (vl-lucid-all-slices-p x)
                              (vl-lucid-all-slices-resolved-p x))))
  (let ((__function__ 'vl-lucid-resolved-slices->bits))
    (declare (ignorable __function__))
    (if (atom x)
        nil
      (union (vl-lucid-resolved-slice->bits (car x)
                                            ctx)
             (vl-lucid-resolved-slices->bits (cdr x)
                                             ctx)))))

Theorem: return-type-of-vl-lucid-resolved-slices->bits

(defthm return-type-of-vl-lucid-resolved-slices->bits
  (b* ((indices (vl-lucid-resolved-slices->bits x ctx)))
    (and (integer-listp indices)
         (setp indices)))
  :rule-classes :rewrite)

Theorem: vl-lucid-resolved-slices->bits-of-vl-lucidocclist-fix-x

(defthm vl-lucid-resolved-slices->bits-of-vl-lucidocclist-fix-x
  (equal (vl-lucid-resolved-slices->bits (vl-lucidocclist-fix x)
                                         ctx)
         (vl-lucid-resolved-slices->bits x ctx)))

Theorem: vl-lucid-resolved-slices->bits-vl-lucidocclist-equiv-congruence-on-x

(defthm
 vl-lucid-resolved-slices->bits-vl-lucidocclist-equiv-congruence-on-x
 (implies (vl-lucidocclist-equiv x x-equiv)
          (equal (vl-lucid-resolved-slices->bits x ctx)
                 (vl-lucid-resolved-slices->bits x-equiv ctx)))
 :rule-classes :congruence)

Theorem: vl-lucid-resolved-slices->bits-of-identity-ctx

(defthm vl-lucid-resolved-slices->bits-of-identity-ctx
  (equal (vl-lucid-resolved-slices->bits x (identity ctx))
         (vl-lucid-resolved-slices->bits x ctx)))

Theorem: vl-lucid-resolved-slices->bits-equal-congruence-on-ctx

(defthm vl-lucid-resolved-slices->bits-equal-congruence-on-ctx
  (implies (equal ctx ctx-equiv)
           (equal (vl-lucid-resolved-slices->bits x ctx)
                  (vl-lucid-resolved-slices->bits x ctx-equiv)))
  :rule-classes :congruence)