Check if a binary numeral (without prefix) is well-formed.
(bindig/uscore-list-wfp dus) → yes/no
A
Function:
(defun bindig/uscore-list-wfp (dus) (declare (xargs :guard (bindig/uscore-listp dus))) (let ((__function__ 'bindig/uscore-list-wfp)) (declare (ignorable __function__)) (and (consp dus) (bindig/uscore-case (car dus) :digit) (bindig/uscore-case (car (last dus)) :digit))))
Theorem:
(defthm booleanp-of-bindig/uscore-list-wfp (b* ((yes/no (bindig/uscore-list-wfp dus))) (booleanp yes/no)) :rule-classes :rewrite)
Theorem:
(defthm bindig/uscore-list-wfp-of-bindig/uscore-list-fix-dus (equal (bindig/uscore-list-wfp (bindig/uscore-list-fix dus)) (bindig/uscore-list-wfp dus)))
Theorem:
(defthm bindig/uscore-list-wfp-bindig/uscore-list-equiv-congruence-on-dus (implies (bindig/uscore-list-equiv dus dus-equiv) (equal (bindig/uscore-list-wfp dus) (bindig/uscore-list-wfp dus-equiv))) :rule-classes :congruence)