(update-ppstate->lexemes-read lexemes-read ppstate) → ppstate
Function:
(defun update-ppstate->lexemes-read (lexemes-read ppstate) (declare (xargs :stobjs (ppstate))) (declare (xargs :guard (natp lexemes-read))) (b* ((ppstate (ppstate-fix ppstate))) (raw-update-ppstate->lexemes-read (nfix lexemes-read) ppstate)))
Theorem:
(defthm ppstatep-of-update-ppstate->lexemes-read (b* ((ppstate (update-ppstate->lexemes-read lexemes-read ppstate))) (ppstatep ppstate)) :rule-classes :rewrite)
Theorem:
(defthm update-ppstate->lexemes-read-of-nfix-lexemes-read (equal (update-ppstate->lexemes-read (nfix lexemes-read) ppstate) (update-ppstate->lexemes-read lexemes-read ppstate)))
Theorem:
(defthm update-ppstate->lexemes-read-nat-equiv-congruence-on-lexemes-read (implies (acl2::nat-equiv lexemes-read lexemes-read-equiv) (equal (update-ppstate->lexemes-read lexemes-read ppstate) (update-ppstate->lexemes-read lexemes-read-equiv ppstate))) :rule-classes :congruence)
Theorem:
(defthm update-ppstate->lexemes-read-of-ppstate-fix-ppstate (equal (update-ppstate->lexemes-read lexemes-read (ppstate-fix ppstate)) (update-ppstate->lexemes-read lexemes-read ppstate)))
Theorem:
(defthm update-ppstate->lexemes-read-ppstate-equiv-congruence-on-ppstate (implies (ppstate-equiv ppstate ppstate-equiv) (equal (update-ppstate->lexemes-read lexemes-read ppstate) (update-ppstate->lexemes-read lexemes-read ppstate-equiv))) :rule-classes :congruence)