Token and remainder theorems for vl-lex-plain-alist, automatically generated by def-token/remainder-thms.
Theorem:
(defthm vl-token-p-of-vl-lex-plain-alist (implies (and (force (vl-echarlist-p echars)) (force (vl-plaintoken-alistp alist))) (equal (vl-token-p (mv-nth 0 (vl-lex-plain-alist echars alist warnings))) (if (mv-nth 0 (vl-lex-plain-alist echars alist warnings)) t nil))))
Theorem:
(defthm true-listp-of-vl-lex-plain-alist (equal (true-listp (mv-nth 1 (vl-lex-plain-alist echars alist warnings))) (true-listp echars)) :rule-classes ((:rewrite) (:type-prescription :corollary (implies (true-listp echars) (true-listp (mv-nth 1 (vl-lex-plain-alist echars alist warnings)))))))
Theorem:
(defthm vl-echarlist-p-of-vl-lex-plain-alist (implies (force (vl-echarlist-p echars)) (equal (vl-echarlist-p (mv-nth 1 (vl-lex-plain-alist echars alist warnings))) t)))
Theorem:
(defthm append-of-vl-lex-plain-alist (implies (and (mv-nth 0 (vl-lex-plain-alist echars alist warnings)) (force (vl-echarlist-p echars)) (force (vl-plaintoken-alistp alist))) (equal (append (vl-token->etext (mv-nth 0 (vl-lex-plain-alist echars alist warnings))) (mv-nth 1 (vl-lex-plain-alist echars alist warnings))) echars)))
Theorem:
(defthm no-change-loser-of-vl-lex-plain-alist (implies (not (mv-nth 0 (vl-lex-plain-alist echars alist warnings))) (equal (mv-nth 1 (vl-lex-plain-alist echars alist warnings)) echars)))
Theorem:
(defthm acl2-count-of-vl-lex-plain-alist-weak (<= (acl2-count (mv-nth 1 (vl-lex-plain-alist echars alist warnings))) (acl2-count echars)) :rule-classes ((:rewrite) (:linear)))
Theorem:
(defthm acl2-count-of-vl-lex-plain-alist-strong (implies (and (mv-nth 0 (vl-lex-plain-alist echars alist warnings)) t) (< (acl2-count (mv-nth 1 (vl-lex-plain-alist echars alist warnings))) (acl2-count echars))) :rule-classes ((:rewrite) (:linear)))