(svexlistlist-fix x) is a usual fty list fixing function.
(svexlistlist-fix x) → fty::newx
In the logic, we apply svexlist-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 svexlistlist-fix$inline (x) (declare (xargs :guard (svexlistlist-p x))) (let ((__function__ 'svexlistlist-fix)) (declare (ignorable __function__)) (mbe :logic (if (atom x) nil (cons (svexlist-fix (car x)) (svexlistlist-fix (cdr x)))) :exec x)))
Theorem:
(defthm svexlistlist-p-of-svexlistlist-fix (b* ((fty::newx (svexlistlist-fix$inline x))) (svexlistlist-p fty::newx)) :rule-classes :rewrite)
Theorem:
(defthm svexlistlist-fix-when-svexlistlist-p (implies (svexlistlist-p x) (equal (svexlistlist-fix x) x)))
Function:
(defun svexlistlist-equiv$inline (x y) (declare (xargs :guard (and (svexlistlist-p x) (svexlistlist-p y)))) (equal (svexlistlist-fix x) (svexlistlist-fix y)))
Theorem:
(defthm svexlistlist-equiv-is-an-equivalence (and (booleanp (svexlistlist-equiv x y)) (svexlistlist-equiv x x) (implies (svexlistlist-equiv x y) (svexlistlist-equiv y x)) (implies (and (svexlistlist-equiv x y) (svexlistlist-equiv y z)) (svexlistlist-equiv x z))) :rule-classes (:equivalence))
Theorem:
(defthm svexlistlist-equiv-implies-equal-svexlistlist-fix-1 (implies (svexlistlist-equiv x x-equiv) (equal (svexlistlist-fix x) (svexlistlist-fix x-equiv))) :rule-classes (:congruence))
Theorem:
(defthm svexlistlist-fix-under-svexlistlist-equiv (svexlistlist-equiv (svexlistlist-fix x) x) :rule-classes (:rewrite :rewrite-quoted-constant))
Theorem:
(defthm equal-of-svexlistlist-fix-1-forward-to-svexlistlist-equiv (implies (equal (svexlistlist-fix x) y) (svexlistlist-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm equal-of-svexlistlist-fix-2-forward-to-svexlistlist-equiv (implies (equal x (svexlistlist-fix y)) (svexlistlist-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm svexlistlist-equiv-of-svexlistlist-fix-1-forward (implies (svexlistlist-equiv (svexlistlist-fix x) y) (svexlistlist-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm svexlistlist-equiv-of-svexlistlist-fix-2-forward (implies (svexlistlist-equiv x (svexlistlist-fix y)) (svexlistlist-equiv x y)) :rule-classes :forward-chaining)
Theorem:
(defthm car-of-svexlistlist-fix-x-under-svexlist-equiv (svexlist-equiv (car (svexlistlist-fix x)) (car x)))
Theorem:
(defthm car-svexlistlist-equiv-congruence-on-x-under-svexlist-equiv (implies (svexlistlist-equiv x x-equiv) (svexlist-equiv (car x) (car x-equiv))) :rule-classes :congruence)
Theorem:
(defthm cdr-of-svexlistlist-fix-x-under-svexlistlist-equiv (svexlistlist-equiv (cdr (svexlistlist-fix x)) (cdr x)))
Theorem:
(defthm cdr-svexlistlist-equiv-congruence-on-x-under-svexlistlist-equiv (implies (svexlistlist-equiv x x-equiv) (svexlistlist-equiv (cdr x) (cdr x-equiv))) :rule-classes :congruence)
Theorem:
(defthm cons-of-svexlist-fix-x-under-svexlistlist-equiv (svexlistlist-equiv (cons (svexlist-fix x) y) (cons x y)))
Theorem:
(defthm cons-svexlist-equiv-congruence-on-x-under-svexlistlist-equiv (implies (svexlist-equiv x x-equiv) (svexlistlist-equiv (cons x y) (cons x-equiv y))) :rule-classes :congruence)
Theorem:
(defthm cons-of-svexlistlist-fix-y-under-svexlistlist-equiv (svexlistlist-equiv (cons x (svexlistlist-fix y)) (cons x y)))
Theorem:
(defthm cons-svexlistlist-equiv-congruence-on-y-under-svexlistlist-equiv (implies (svexlistlist-equiv y y-equiv) (svexlistlist-equiv (cons x y) (cons x y-equiv))) :rule-classes :congruence)
Theorem:
(defthm consp-of-svexlistlist-fix (equal (consp (svexlistlist-fix x)) (consp x)))
Theorem:
(defthm svexlistlist-fix-under-iff (iff (svexlistlist-fix x) (consp x)))
Theorem:
(defthm svexlistlist-fix-of-cons (equal (svexlistlist-fix (cons a x)) (cons (svexlist-fix a) (svexlistlist-fix x))))
Theorem:
(defthm len-of-svexlistlist-fix (equal (len (svexlistlist-fix x)) (len x)))
Theorem:
(defthm svexlistlist-fix-of-append (equal (svexlistlist-fix (append std::a std::b)) (append (svexlistlist-fix std::a) (svexlistlist-fix std::b))))
Theorem:
(defthm svexlistlist-fix-of-repeat (equal (svexlistlist-fix (repeat acl2::n x)) (repeat acl2::n (svexlist-fix x))))
Theorem:
(defthm list-equiv-refines-svexlistlist-equiv (implies (list-equiv x y) (svexlistlist-equiv x y)) :rule-classes :refinement)
Theorem:
(defthm nth-of-svexlistlist-fix (equal (nth acl2::n (svexlistlist-fix x)) (if (< (nfix acl2::n) (len x)) (svexlist-fix (nth acl2::n x)) nil)))
Theorem:
(defthm svexlistlist-equiv-implies-svexlistlist-equiv-append-1 (implies (svexlistlist-equiv x fty::x-equiv) (svexlistlist-equiv (append x y) (append fty::x-equiv y))) :rule-classes (:congruence))
Theorem:
(defthm svexlistlist-equiv-implies-svexlistlist-equiv-append-2 (implies (svexlistlist-equiv y fty::y-equiv) (svexlistlist-equiv (append x y) (append x fty::y-equiv))) :rule-classes (:congruence))
Theorem:
(defthm svexlistlist-equiv-implies-svexlistlist-equiv-nthcdr-2 (implies (svexlistlist-equiv acl2::l l-equiv) (svexlistlist-equiv (nthcdr acl2::n acl2::l) (nthcdr acl2::n l-equiv))) :rule-classes (:congruence))
Theorem:
(defthm svexlistlist-equiv-implies-svexlistlist-equiv-take-2 (implies (svexlistlist-equiv acl2::l l-equiv) (svexlistlist-equiv (take acl2::n acl2::l) (take acl2::n l-equiv))) :rule-classes (:congruence))