Recognizer of states with base RV32I.
(stat-rv32i-p x) → yes/no
These only depend on the base, not on the M extension or the endianness.
Function:
(defun stat-rv32i-p (x) (declare (xargs :guard t)) (let ((__function__ 'stat-rv32i-p)) (declare (ignorable __function__)) (and (statp x) (stat-validp x (feat-rv32i-le)))))
Theorem:
(defthm booleanp-of-stat-rv32i-p (b* ((yes/no (stat-rv32i-p x))) (booleanp yes/no)) :rule-classes :rewrite)
Theorem:
(defthm stat-rv32i-p-alt-def-be (equal (stat-rv32i-p x) (and (statp x) (stat-validp x (feat-rv32i-be)))))
Theorem:
(defthm stat-rv32i-p-alt-def-m-le (equal (stat-rv32i-p x) (and (statp x) (stat-validp x (feat-rv32im-le)))))
Theorem:
(defthm stat-rv32i-p-alt-def-m-be (equal (stat-rv32i-p x) (and (statp x) (stat-validp x (feat-rv32im-be)))))
Theorem:
(defthm unsigned-byte-p-32-of-nth-of-stat-rv32i->xregs (implies (and (stat-validp stat (feat-rv32i-le)) (natp reg) (< reg 32)) (unsigned-byte-p 32 (nth (1- reg) (stat->xregs stat)))))