		Search-engine friendly clone of the ACL2 documentation.

Func-list

Func-list-fix

(func-list-fix x) is a usual ACL2::fty list fixing function.

Signature
(func-list-fix x) → fty::newx
Arguments: x — Guard (func-listp x).
Returns: fty::newx — Type (func-listp fty::newx).

In the logic, we apply func-fix to each member of the x. In the execution, none of that is actually necessary and this is just an inlined identity function.

Definitions and Theorems

Function: func-list-fix$inline

(defun func-list-fix$inline (x)
  (declare (xargs :guard (func-listp x)))
  (let ((acl2::__function__ 'func-list-fix))
    (declare (ignorable acl2::__function__))
    (mbe :logic
         (if (atom x)
             nil
           (cons (func-fix (car x))
                 (func-list-fix (cdr x))))
         :exec x)))

Theorem: func-listp-of-func-list-fix

(defthm func-listp-of-func-list-fix
  (b* ((fty::newx (func-list-fix$inline x)))
    (func-listp fty::newx))
  :rule-classes :rewrite)

Theorem: func-list-fix-when-func-listp

(defthm func-list-fix-when-func-listp
  (implies (func-listp x)
           (equal (func-list-fix x) x)))

Function: func-list-equiv$inline

(defun func-list-equiv$inline (acl2::x acl2::y)
  (declare (xargs :guard (and (func-listp acl2::x)
                              (func-listp acl2::y))))
  (equal (func-list-fix acl2::x)
         (func-list-fix acl2::y)))

Theorem: func-list-equiv-is-an-equivalence

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

Theorem: func-list-equiv-implies-equal-func-list-fix-1

(defthm func-list-equiv-implies-equal-func-list-fix-1
  (implies (func-list-equiv acl2::x x-equiv)
           (equal (func-list-fix acl2::x)
                  (func-list-fix x-equiv)))
  :rule-classes (:congruence))

Theorem: func-list-fix-under-func-list-equiv

(defthm func-list-fix-under-func-list-equiv
  (func-list-equiv (func-list-fix acl2::x)
                   acl2::x)
  :rule-classes (:rewrite :rewrite-quoted-constant))

Theorem: equal-of-func-list-fix-1-forward-to-func-list-equiv

(defthm equal-of-func-list-fix-1-forward-to-func-list-equiv
  (implies (equal (func-list-fix acl2::x) acl2::y)
           (func-list-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: equal-of-func-list-fix-2-forward-to-func-list-equiv

(defthm equal-of-func-list-fix-2-forward-to-func-list-equiv
  (implies (equal acl2::x (func-list-fix acl2::y))
           (func-list-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: func-list-equiv-of-func-list-fix-1-forward

(defthm func-list-equiv-of-func-list-fix-1-forward
  (implies (func-list-equiv (func-list-fix acl2::x)
                            acl2::y)
           (func-list-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: func-list-equiv-of-func-list-fix-2-forward

(defthm func-list-equiv-of-func-list-fix-2-forward
  (implies (func-list-equiv acl2::x (func-list-fix acl2::y))
           (func-list-equiv acl2::x acl2::y))
  :rule-classes :forward-chaining)

Theorem: car-of-func-list-fix-x-under-func-equiv

(defthm car-of-func-list-fix-x-under-func-equiv
  (func-equiv (car (func-list-fix acl2::x))
              (car acl2::x)))

Theorem: car-func-list-equiv-congruence-on-x-under-func-equiv

(defthm car-func-list-equiv-congruence-on-x-under-func-equiv
  (implies (func-list-equiv acl2::x x-equiv)
           (func-equiv (car acl2::x)
                       (car x-equiv)))
  :rule-classes :congruence)

Theorem: cdr-of-func-list-fix-x-under-func-list-equiv

(defthm cdr-of-func-list-fix-x-under-func-list-equiv
  (func-list-equiv (cdr (func-list-fix acl2::x))
                   (cdr acl2::x)))

Theorem: cdr-func-list-equiv-congruence-on-x-under-func-list-equiv

(defthm cdr-func-list-equiv-congruence-on-x-under-func-list-equiv
  (implies (func-list-equiv acl2::x x-equiv)
           (func-list-equiv (cdr acl2::x)
                            (cdr x-equiv)))
  :rule-classes :congruence)

Theorem: cons-of-func-fix-x-under-func-list-equiv

(defthm cons-of-func-fix-x-under-func-list-equiv
  (func-list-equiv (cons (func-fix acl2::x) acl2::y)
                   (cons acl2::x acl2::y)))

Theorem: cons-func-equiv-congruence-on-x-under-func-list-equiv

(defthm cons-func-equiv-congruence-on-x-under-func-list-equiv
  (implies (func-equiv acl2::x x-equiv)
           (func-list-equiv (cons acl2::x acl2::y)
                            (cons x-equiv acl2::y)))
  :rule-classes :congruence)

Theorem: cons-of-func-list-fix-y-under-func-list-equiv

(defthm cons-of-func-list-fix-y-under-func-list-equiv
  (func-list-equiv (cons acl2::x (func-list-fix acl2::y))
                   (cons acl2::x acl2::y)))

Theorem: cons-func-list-equiv-congruence-on-y-under-func-list-equiv

(defthm cons-func-list-equiv-congruence-on-y-under-func-list-equiv
  (implies (func-list-equiv acl2::y y-equiv)
           (func-list-equiv (cons acl2::x acl2::y)
                            (cons acl2::x y-equiv)))
  :rule-classes :congruence)

Theorem: consp-of-func-list-fix

(defthm consp-of-func-list-fix
  (equal (consp (func-list-fix acl2::x))
         (consp acl2::x)))

Theorem: func-list-fix-under-iff

(defthm func-list-fix-under-iff
  (iff (func-list-fix acl2::x)
       (consp acl2::x)))

Theorem: func-list-fix-of-cons

(defthm func-list-fix-of-cons
  (equal (func-list-fix (cons a x))
         (cons (func-fix a) (func-list-fix x))))

Theorem: len-of-func-list-fix

(defthm len-of-func-list-fix
  (equal (len (func-list-fix acl2::x))
         (len acl2::x)))

Theorem: func-list-fix-of-append

(defthm func-list-fix-of-append
  (equal (func-list-fix (append std::a std::b))
         (append (func-list-fix std::a)
                 (func-list-fix std::b))))

Theorem: func-list-fix-of-repeat

(defthm func-list-fix-of-repeat
  (equal (func-list-fix (acl2::repeat acl2::n acl2::x))
         (acl2::repeat acl2::n (func-fix acl2::x))))

Theorem: list-equiv-refines-func-list-equiv

(defthm list-equiv-refines-func-list-equiv
  (implies (acl2::list-equiv acl2::x acl2::y)
           (func-list-equiv acl2::x acl2::y))
  :rule-classes :refinement)

Theorem: nth-of-func-list-fix

(defthm nth-of-func-list-fix
  (equal (nth acl2::n (func-list-fix acl2::x))
         (if (< (nfix acl2::n) (len acl2::x))
             (func-fix (nth acl2::n acl2::x))
           nil)))

Theorem: func-list-equiv-implies-func-list-equiv-append-1

(defthm func-list-equiv-implies-func-list-equiv-append-1
  (implies (func-list-equiv acl2::x fty::x-equiv)
           (func-list-equiv (append acl2::x acl2::y)
                            (append fty::x-equiv acl2::y)))
  :rule-classes (:congruence))

Theorem: func-list-equiv-implies-func-list-equiv-append-2

(defthm func-list-equiv-implies-func-list-equiv-append-2
  (implies (func-list-equiv acl2::y fty::y-equiv)
           (func-list-equiv (append acl2::x acl2::y)
                            (append acl2::x fty::y-equiv)))
  :rule-classes (:congruence))

Theorem: func-list-equiv-implies-func-list-equiv-nthcdr-2

(defthm func-list-equiv-implies-func-list-equiv-nthcdr-2
  (implies (func-list-equiv acl2::l l-equiv)
           (func-list-equiv (nthcdr acl2::n acl2::l)
                            (nthcdr acl2::n l-equiv)))
  :rule-classes (:congruence))

Theorem: func-list-equiv-implies-func-list-equiv-take-2

(defthm func-list-equiv-implies-func-list-equiv-take-2
  (implies (func-list-equiv acl2::l l-equiv)
           (func-list-equiv (take acl2::n acl2::l)
                            (take acl2::n l-equiv)))
  :rule-classes (:congruence))