(update-parstate->tokens-read tokens-read parstate) → parstate
Function:
(defun update-parstate->tokens-read (tokens-read parstate) (declare (xargs :stobjs (parstate))) (declare (xargs :guard (token+span-listp tokens-read))) (let ((__function__ 'update-parstate->tokens-read)) (declare (ignorable __function__)) (b* ((parstate (parstate-fix parstate))) (raw-update-parstate->tokens-read (token+span-list-fix tokens-read) parstate))))
Theorem:
(defthm parstatep-of-update-parstate->tokens-read (b* ((parstate (update-parstate->tokens-read tokens-read parstate))) (parstatep parstate)) :rule-classes :rewrite)
Theorem:
(defthm update-parstate->tokens-read-of-token+span-list-fix-tokens-read (equal (update-parstate->tokens-read (token+span-list-fix tokens-read) parstate) (update-parstate->tokens-read tokens-read parstate)))
Theorem:
(defthm update-parstate->tokens-read-token+span-list-equiv-congruence-on-tokens-read (implies (token+span-list-equiv tokens-read tokens-read-equiv) (equal (update-parstate->tokens-read tokens-read parstate) (update-parstate->tokens-read tokens-read-equiv parstate))) :rule-classes :congruence)
Theorem:
(defthm update-parstate->tokens-read-of-parstate-fix-parstate (equal (update-parstate->tokens-read tokens-read (parstate-fix parstate)) (update-parstate->tokens-read tokens-read parstate)))
Theorem:
(defthm update-parstate->tokens-read-parstate-equiv-congruence-on-parstate (implies (parstate-equiv parstate parstate-equiv) (equal (update-parstate->tokens-read tokens-read parstate) (update-parstate->tokens-read tokens-read parstate-equiv))) :rule-classes :congruence)