Abstract a
(abs-*-lowercaseletter/decimaldigit trees) → chars
Function:
(defun abs-*-lowercaseletter/decimaldigit (trees) (declare (xargs :guard (abnf::tree-listp trees))) (let ((__function__ 'abs-*-lowercaseletter/decimaldigit)) (declare (ignorable __function__)) (b* (((when (endp trees)) nil) ((okf char) (abs-lowercaseletter/decimaldigit (car trees))) ((okf chars) (abs-*-lowercaseletter/decimaldigit (cdr trees)))) (cons char chars))))
Theorem:
(defthm character-list-resultp-of-abs-*-lowercaseletter/decimaldigit (b* ((chars (abs-*-lowercaseletter/decimaldigit trees))) (character-list-resultp chars)) :rule-classes :rewrite)
Theorem:
(defthm loletter/digit-char-listp-of-abs-*-lowercaseletter/decimaldigit (b* ((?chars (abs-*-lowercaseletter/decimaldigit trees))) (implies (not (reserrp chars)) (str::lcletter/digit-charlist-p chars))))
Theorem:
(defthm abs-*-lowercaseletter/decimaldigit-of-tree-list-fix-trees (equal (abs-*-lowercaseletter/decimaldigit (abnf::tree-list-fix trees)) (abs-*-lowercaseletter/decimaldigit trees)))
Theorem:
(defthm abs-*-lowercaseletter/decimaldigit-tree-list-equiv-congruence-on-trees (implies (abnf::tree-list-equiv trees trees-equiv) (equal (abs-*-lowercaseletter/decimaldigit trees) (abs-*-lowercaseletter/decimaldigit trees-equiv))) :rule-classes :congruence)