(n-output-comb-transformlist-fix x) is a usual ACL2::fty list fixing function.
(n-output-comb-transformlist-fix x) → fty::newx
In the logic, we apply n-output-comb-transform-fix to each member of the x. In the execution, none of that is actually necessary and this is just an inlined identity function.
Function:
(defun n-output-comb-transformlist-fix$inline (x) (declare (xargs :guard (n-output-comb-transformlist-p x))) (let ((__function__ 'n-output-comb-transformlist-fix)) (declare (ignorable __function__)) (mbe :logic (if (atom x) nil (cons (n-output-comb-transform-fix (car x)) (n-output-comb-transformlist-fix (cdr x)))) :exec x)))
Theorem:
(defthm n-output-comb-transformlist-p-of-n-output-comb-transformlist-fix (b* ((fty::newx (n-output-comb-transformlist-fix$inline x))) (n-output-comb-transformlist-p fty::newx)) :rule-classes :rewrite)
Theorem:
(defthm n-output-comb-transformlist-fix-when-n-output-comb-transformlist-p (implies (n-output-comb-transformlist-p x) (equal (n-output-comb-transformlist-fix x) x)))
Function:
(defun n-output-comb-transformlist-equiv$inline (x acl2::y) (declare (xargs :guard (and (n-output-comb-transformlist-p x) (n-output-comb-transformlist-p acl2::y)))) (equal (n-output-comb-transformlist-fix x) (n-output-comb-transformlist-fix acl2::y)))
Theorem:
(defthm n-output-comb-transformlist-equiv-is-an-equivalence (and (booleanp (n-output-comb-transformlist-equiv x y)) (n-output-comb-transformlist-equiv x x) (implies (n-output-comb-transformlist-equiv x y) (n-output-comb-transformlist-equiv y x)) (implies (and (n-output-comb-transformlist-equiv x y) (n-output-comb-transformlist-equiv y z)) (n-output-comb-transformlist-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm n-output-comb-transformlist-equiv-implies-equal-n-output-comb-transformlist-fix-1 (implies (n-output-comb-transformlist-equiv x x-equiv) (equal (n-output-comb-transformlist-fix x) (n-output-comb-transformlist-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm n-output-comb-transformlist-fix-under-n-output-comb-transformlist-equiv (n-output-comb-transformlist-equiv (n-output-comb-transformlist-fix x) x) :rule-classes (:rewrite :rewrite-quoted-constant))
Theorem:
(defthm equal-of-n-output-comb-transformlist-fix-1-forward-to-n-output-comb-transformlist-equiv (implies (equal (n-output-comb-transformlist-fix x) acl2::y) (n-output-comb-transformlist-equiv x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm equal-of-n-output-comb-transformlist-fix-2-forward-to-n-output-comb-transformlist-equiv (implies (equal x (n-output-comb-transformlist-fix acl2::y)) (n-output-comb-transformlist-equiv x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm n-output-comb-transformlist-equiv-of-n-output-comb-transformlist-fix-1-forward (implies (n-output-comb-transformlist-equiv (n-output-comb-transformlist-fix x) acl2::y) (n-output-comb-transformlist-equiv x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm n-output-comb-transformlist-equiv-of-n-output-comb-transformlist-fix-2-forward (implies (n-output-comb-transformlist-equiv x (n-output-comb-transformlist-fix acl2::y)) (n-output-comb-transformlist-equiv x acl2::y)) :rule-classes :forward-chaining)
Theorem:
(defthm car-of-n-output-comb-transformlist-fix-x-under-n-output-comb-transform-equiv (n-output-comb-transform-equiv (car (n-output-comb-transformlist-fix x)) (car x)))
Theorem:
(defthm car-n-output-comb-transformlist-equiv-congruence-on-x-under-n-output-comb-transform-equiv (implies (n-output-comb-transformlist-equiv x x-equiv) (n-output-comb-transform-equiv (car x) (car x-equiv))) :rule-classes :congruence)
Theorem:
(defthm cdr-of-n-output-comb-transformlist-fix-x-under-n-output-comb-transformlist-equiv (n-output-comb-transformlist-equiv (cdr (n-output-comb-transformlist-fix x)) (cdr x)))
Theorem:
(defthm cdr-n-output-comb-transformlist-equiv-congruence-on-x-under-n-output-comb-transformlist-equiv (implies (n-output-comb-transformlist-equiv x x-equiv) (n-output-comb-transformlist-equiv (cdr x) (cdr x-equiv))) :rule-classes :congruence)
Theorem:
(defthm cons-of-n-output-comb-transform-fix-x-under-n-output-comb-transformlist-equiv (n-output-comb-transformlist-equiv (cons (n-output-comb-transform-fix x) acl2::y) (cons x acl2::y)))
Theorem:
(defthm cons-n-output-comb-transform-equiv-congruence-on-x-under-n-output-comb-transformlist-equiv (implies (n-output-comb-transform-equiv x x-equiv) (n-output-comb-transformlist-equiv (cons x acl2::y) (cons x-equiv acl2::y))) :rule-classes :congruence)
Theorem:
(defthm cons-of-n-output-comb-transformlist-fix-y-under-n-output-comb-transformlist-equiv (n-output-comb-transformlist-equiv (cons x (n-output-comb-transformlist-fix acl2::y)) (cons x acl2::y)))
Theorem:
(defthm cons-n-output-comb-transformlist-equiv-congruence-on-y-under-n-output-comb-transformlist-equiv (implies (n-output-comb-transformlist-equiv acl2::y y-equiv) (n-output-comb-transformlist-equiv (cons x acl2::y) (cons x y-equiv))) :rule-classes :congruence)
Theorem:
(defthm consp-of-n-output-comb-transformlist-fix (equal (consp (n-output-comb-transformlist-fix x)) (consp x)))
Theorem:
(defthm n-output-comb-transformlist-fix-under-iff (iff (n-output-comb-transformlist-fix x) (consp x)))
Theorem:
(defthm n-output-comb-transformlist-fix-of-cons (equal (n-output-comb-transformlist-fix (cons a x)) (cons (n-output-comb-transform-fix a) (n-output-comb-transformlist-fix x))))
Theorem:
(defthm len-of-n-output-comb-transformlist-fix (equal (len (n-output-comb-transformlist-fix x)) (len x)))
Theorem:
(defthm n-output-comb-transformlist-fix-of-append (equal (n-output-comb-transformlist-fix (append std::a std::b)) (append (n-output-comb-transformlist-fix std::a) (n-output-comb-transformlist-fix std::b))))
Theorem:
(defthm n-output-comb-transformlist-fix-of-repeat (equal (n-output-comb-transformlist-fix (acl2::repeat acl2::n x)) (acl2::repeat acl2::n (n-output-comb-transform-fix x))))
Theorem:
(defthm list-equiv-refines-n-output-comb-transformlist-equiv (implies (list-equiv x acl2::y) (n-output-comb-transformlist-equiv x acl2::y)) :rule-classes :refinement)
Theorem:
(defthm nth-of-n-output-comb-transformlist-fix (equal (nth acl2::n (n-output-comb-transformlist-fix x)) (if (< (nfix acl2::n) (len x)) (n-output-comb-transform-fix (nth acl2::n x)) nil)))
Theorem:
(defthm n-output-comb-transformlist-equiv-implies-n-output-comb-transformlist-equiv-append-1 (implies (n-output-comb-transformlist-equiv x fty::x-equiv) (n-output-comb-transformlist-equiv (append x acl2::y) (append fty::x-equiv acl2::y))) :rule-classes (:congruence))
Theorem:
(defthm n-output-comb-transformlist-equiv-implies-n-output-comb-transformlist-equiv-append-2 (implies (n-output-comb-transformlist-equiv acl2::y fty::y-equiv) (n-output-comb-transformlist-equiv (append x acl2::y) (append x fty::y-equiv))) :rule-classes (:congruence))
Theorem:
(defthm n-output-comb-transformlist-equiv-implies-n-output-comb-transformlist-equiv-nthcdr-2 (implies (n-output-comb-transformlist-equiv acl2::l l-equiv) (n-output-comb-transformlist-equiv (nthcdr acl2::n acl2::l) (nthcdr acl2::n l-equiv))) :rule-classes (:congruence))
Theorem:
(defthm n-output-comb-transformlist-equiv-implies-n-output-comb-transformlist-equiv-take-2 (implies (n-output-comb-transformlist-equiv acl2::l l-equiv) (n-output-comb-transformlist-equiv (take acl2::n acl2::l) (take acl2::n l-equiv))) :rule-classes (:congruence))