Basic theorems about svex-alistlist-p, generated by std::deflist.
Theorem:
(defthm svex-alistlist-p-of-cons (equal (svex-alistlist-p (cons acl2::a x)) (and (svex-alist-p acl2::a) (svex-alistlist-p x))) :rule-classes ((:rewrite)))
Theorem:
(defthm svex-alistlist-p-of-cdr-when-svex-alistlist-p (implies (svex-alistlist-p (double-rewrite x)) (svex-alistlist-p (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm svex-alistlist-p-when-not-consp (implies (not (consp x)) (equal (svex-alistlist-p x) (not x))) :rule-classes ((:rewrite)))
Theorem:
(defthm svex-alist-p-of-car-when-svex-alistlist-p (implies (svex-alistlist-p x) (svex-alist-p (car x))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-svex-alistlist-p-compound-recognizer (implies (svex-alistlist-p x) (true-listp x)) :rule-classes :compound-recognizer)
Theorem:
(defthm svex-alistlist-p-of-list-fix (implies (svex-alistlist-p x) (svex-alistlist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm svex-alistlist-p-of-rev (equal (svex-alistlist-p (rev x)) (svex-alistlist-p (list-fix x))) :rule-classes ((:rewrite)))
Theorem:
(defthm svex-alistlist-p-of-repeat (iff (svex-alistlist-p (repeat acl2::n x)) (or (svex-alist-p x) (zp acl2::n))) :rule-classes ((:rewrite)))
Theorem:
(defthm svex-alistlist-p-of-take (implies (svex-alistlist-p (double-rewrite x)) (iff (svex-alistlist-p (take acl2::n x)) (or (svex-alist-p nil) (<= (nfix acl2::n) (len x))))) :rule-classes ((:rewrite)))
Theorem:
(defthm svex-alistlist-p-of-nthcdr (implies (svex-alistlist-p (double-rewrite x)) (svex-alistlist-p (nthcdr acl2::n x))) :rule-classes ((:rewrite)))