		Search-engine friendly clone of the ACL2 documentation.

Name-alist

Name-alist-fix

(name-alist-fix x) is an fty alist fixing function that follows the drop-keys strategy.

Signature
(name-alist-fix x) → fty::newx
Arguments: x — Guard (name-alist-p x).
Returns: fty::newx — Type (name-alist-p fty::newx).

Note that in the execution this is just an inline identity function.

Definitions and Theorems

Function: name-alist-fix$inline

(defun name-alist-fix$inline (x)
  (declare (xargs :guard (name-alist-p x)))
  (let ((__function__ 'name-alist-fix))
    (declare (ignorable __function__))
    (mbe :logic
         (if (atom x)
             nil
           (let ((rest (name-alist-fix (cdr x))))
             (if (and (consp (car x)) (name-p (caar x)))
                 (let ((fty::first-key (caar x))
                       (fty::first-val (cdar x)))
                   (cons (cons fty::first-key fty::first-val)
                         rest))
               rest)))
         :exec x)))

Theorem: name-alist-p-of-name-alist-fix

(defthm name-alist-p-of-name-alist-fix
  (b* ((fty::newx (name-alist-fix$inline x)))
    (name-alist-p fty::newx))
  :rule-classes :rewrite)

Theorem: name-alist-fix-when-name-alist-p

(defthm name-alist-fix-when-name-alist-p
  (implies (name-alist-p x)
           (equal (name-alist-fix x) x)))

Function: name-alist-equiv$inline

(defun name-alist-equiv$inline (x y)
  (declare (xargs :guard (and (name-alist-p x)
                              (name-alist-p y))))
  (equal (name-alist-fix x)
         (name-alist-fix y)))

Theorem: name-alist-equiv-is-an-equivalence

(defthm name-alist-equiv-is-an-equivalence
  (and (booleanp (name-alist-equiv x y))
       (name-alist-equiv x x)
       (implies (name-alist-equiv x y)
                (name-alist-equiv y x))
       (implies (and (name-alist-equiv x y)
                     (name-alist-equiv y z))
                (name-alist-equiv x z)))
  :rule-classes (:equivalence))

Theorem: name-alist-equiv-implies-equal-name-alist-fix-1

(defthm name-alist-equiv-implies-equal-name-alist-fix-1
  (implies (name-alist-equiv x x-equiv)
           (equal (name-alist-fix x)
                  (name-alist-fix x-equiv)))
  :rule-classes (:congruence))

Theorem: name-alist-fix-under-name-alist-equiv

(defthm name-alist-fix-under-name-alist-equiv
  (name-alist-equiv (name-alist-fix x) x)
  :rule-classes (:rewrite :rewrite-quoted-constant))

Theorem: equal-of-name-alist-fix-1-forward-to-name-alist-equiv

(defthm equal-of-name-alist-fix-1-forward-to-name-alist-equiv
  (implies (equal (name-alist-fix x) y)
           (name-alist-equiv x y))
  :rule-classes :forward-chaining)

Theorem: equal-of-name-alist-fix-2-forward-to-name-alist-equiv

(defthm equal-of-name-alist-fix-2-forward-to-name-alist-equiv
  (implies (equal x (name-alist-fix y))
           (name-alist-equiv x y))
  :rule-classes :forward-chaining)

Theorem: name-alist-equiv-of-name-alist-fix-1-forward

(defthm name-alist-equiv-of-name-alist-fix-1-forward
  (implies (name-alist-equiv (name-alist-fix x) y)
           (name-alist-equiv x y))
  :rule-classes :forward-chaining)

Theorem: name-alist-equiv-of-name-alist-fix-2-forward

(defthm name-alist-equiv-of-name-alist-fix-2-forward
  (implies (name-alist-equiv x (name-alist-fix y))
           (name-alist-equiv x y))
  :rule-classes :forward-chaining)

Theorem: cons-of-name-alist-fix-y-under-name-alist-equiv

(defthm cons-of-name-alist-fix-y-under-name-alist-equiv
  (name-alist-equiv (cons x (name-alist-fix y))
                    (cons x y)))

Theorem: cons-name-alist-equiv-congruence-on-y-under-name-alist-equiv

(defthm cons-name-alist-equiv-congruence-on-y-under-name-alist-equiv
  (implies (name-alist-equiv y y-equiv)
           (name-alist-equiv (cons x y)
                             (cons x y-equiv)))
  :rule-classes :congruence)

Theorem: name-alist-fix-of-acons

(defthm name-alist-fix-of-acons
  (equal (name-alist-fix (cons (cons acl2::a acl2::b) x))
         (let ((rest (name-alist-fix x)))
           (if (and (name-p acl2::a))
               (let ((fty::first-key acl2::a)
                     (fty::first-val acl2::b))
                 (cons (cons fty::first-key fty::first-val)
                       rest))
             rest))))

Theorem: hons-assoc-equal-of-name-alist-fix

(defthm hons-assoc-equal-of-name-alist-fix
  (equal (hons-assoc-equal acl2::k (name-alist-fix x))
         (let ((fty::pair (hons-assoc-equal acl2::k x)))
           (and (name-p acl2::k)
                fty::pair
                (cons acl2::k (cdr fty::pair))))))

Theorem: name-alist-fix-of-append

(defthm name-alist-fix-of-append
  (equal (name-alist-fix (append std::a std::b))
         (append (name-alist-fix std::a)
                 (name-alist-fix std::b))))

Theorem: consp-car-of-name-alist-fix

(defthm consp-car-of-name-alist-fix
  (equal (consp (car (name-alist-fix x)))
         (consp (name-alist-fix x))))