Abstract a
(abs-lowercase-letter tree) → char
Function:
(defun abs-lowercase-letter (tree) (declare (xargs :guard (abnf::treep tree))) (let ((__function__ 'abs-lowercase-letter)) (declare (ignorable __function__)) (b* (((okf nat) (check-tree-nonleaf-num-range tree "lowercase-letter" 97 122))) (code-char nat))))
Theorem:
(defthm character-resultp-of-abs-lowercase-letter (b* ((char (abs-lowercase-letter tree))) (character-resultp char)) :rule-classes :rewrite)
Theorem:
(defthm lcletter-char-p-of-abs-lowercase-letter (b* ((common-lisp::?char (abs-lowercase-letter tree))) (implies (not (reserrp char)) (str::lcletter-char-p char))))
Theorem:
(defthm abs-lowercase-letter-of-tree-fix-tree (equal (abs-lowercase-letter (abnf::tree-fix tree)) (abs-lowercase-letter tree)))
Theorem:
(defthm abs-lowercase-letter-tree-equiv-congruence-on-tree (implies (abnf::tree-equiv tree tree-equiv) (equal (abs-lowercase-letter tree) (abs-lowercase-letter tree-equiv))) :rule-classes :congruence)