(a4vec->aiglist x) → lst
Function:
(defun a4vec->aiglist (x) (declare (xargs :guard (a4vec-p x))) (let ((__function__ 'a4vec->aiglist)) (declare (ignorable __function__)) (b* (((a4vec x) x)) (append x.upper x.lower))))
Theorem:
(defthm true-listp-of-a4vec->aiglist (b* ((lst (a4vec->aiglist x))) (true-listp lst)) :rule-classes :type-prescription)
Theorem:
(defthm a4vec->aiglist-of-a4vec-fix-x (equal (a4vec->aiglist (a4vec-fix x)) (a4vec->aiglist x)))
Theorem:
(defthm a4vec->aiglist-a4vec-equiv-congruence-on-x (implies (a4vec-equiv x x-equiv) (equal (a4vec->aiglist x) (a4vec->aiglist x-equiv))) :rule-classes :congruence)