Match
(vl-lex-number echars st warnings) → (mv token? remainder warnings)
Function:
(defun vl-lex-number$inline (echars st warnings) (declare (xargs :guard (and (vl-echarlist-p echars) (vl-lexstate-p st) (vl-warninglist-p warnings)))) (let ((__function__ 'vl-lex-number)) (declare (ignorable __function__)) (b* ((warnings (vl-warninglist-fix warnings)) ((mv token remainder) (vl-lex-time-or-real-number echars st)) ((when token) (mv token remainder warnings)) ((mv token remainder warnings) (vl-lex-integer echars warnings)) ((when token) (mv token remainder warnings)) ((unless (vl-lexstate->extintsp st)) (mv nil echars warnings)) ((mv token remainder) (vl-lex-unbased-unsized-literal echars))) (mv token remainder warnings))))
Theorem:
(defthm vl-warninglist-p-of-vl-lex-number.warnings (b* (((mv ?token? ?remainder ?warnings) (vl-lex-number$inline echars st warnings))) (vl-warninglist-p warnings)) :rule-classes :rewrite)
Theorem:
(defthm vl-token-p-of-vl-lex-number (implies (and (force (vl-echarlist-p echars)) t) (equal (vl-token-p (mv-nth 0 (vl-lex-number echars st warnings))) (if (mv-nth 0 (vl-lex-number echars st warnings)) t nil))))
Theorem:
(defthm true-listp-of-vl-lex-number (equal (true-listp (mv-nth 1 (vl-lex-number echars st warnings))) (true-listp echars)) :rule-classes ((:rewrite) (:type-prescription :corollary (implies (true-listp echars) (true-listp (mv-nth 1 (vl-lex-number echars st warnings)))))))
Theorem:
(defthm vl-echarlist-p-of-vl-lex-number (implies (force (vl-echarlist-p echars)) (equal (vl-echarlist-p (mv-nth 1 (vl-lex-number echars st warnings))) t)))
Theorem:
(defthm append-of-vl-lex-number (implies (and (mv-nth 0 (vl-lex-number echars st warnings)) (force (vl-echarlist-p echars)) t) (equal (append (vl-token->etext (mv-nth 0 (vl-lex-number echars st warnings))) (mv-nth 1 (vl-lex-number echars st warnings))) echars)))
Theorem:
(defthm no-change-loser-of-vl-lex-number (implies (not (mv-nth 0 (vl-lex-number echars st warnings))) (equal (mv-nth 1 (vl-lex-number echars st warnings)) echars)))
Theorem:
(defthm acl2-count-of-vl-lex-number-weak (<= (acl2-count (mv-nth 1 (vl-lex-number echars st warnings))) (acl2-count echars)) :rule-classes ((:rewrite) (:linear)))
Theorem:
(defthm acl2-count-of-vl-lex-number-strong (implies (and (mv-nth 0 (vl-lex-number echars st warnings)) t) (< (acl2-count (mv-nth 1 (vl-lex-number echars st warnings))) (acl2-count echars))) :rule-classes ((:rewrite) (:linear)))