(parstate->tokens-unread parstate) → tokens-unread
Function:
(defun parstate->tokens-unread (parstate) (declare (xargs :stobjs (parstate))) (declare (xargs :guard t)) (let ((__function__ 'parstate->tokens-unread)) (declare (ignorable __function__)) (mbe :logic (if (parstatep parstate) (raw-parstate->tokens-unread parstate) nil) :exec (raw-parstate->tokens-unread parstate))))
Theorem:
(defthm token+span-listp-of-parstate->tokens-unread (b* ((tokens-unread (parstate->tokens-unread parstate))) (token+span-listp tokens-unread)) :rule-classes :rewrite)
Theorem:
(defthm parstate->tokens-unread-of-parstate-fix-parstate (equal (parstate->tokens-unread (parstate-fix parstate)) (parstate->tokens-unread parstate)))
Theorem:
(defthm parstate->tokens-unread-parstate-equiv-congruence-on-parstate (implies (parstate-equiv parstate parstate-equiv) (equal (parstate->tokens-unread parstate) (parstate->tokens-unread parstate-equiv))) :rule-classes :congruence)