Abstract a
(abs-lowercase-letter cst) → achar
Function:
(defun abs-lowercase-letter (cst) (declare (xargs :guard (abnf::treep cst))) (declare (xargs :guard (cst-matchp cst "lowercase-letter"))) (let ((__function__ 'abs-lowercase-letter)) (declare (ignorable __function__)) (b* ((cst (cst-lowercase-letter-conc-rep-elem cst)) (nat (cst-%x61-7a-nat cst))) (code-char nat))))
Theorem:
(defthm characterp-of-abs-lowercase-letter (b* ((achar (abs-lowercase-letter cst))) (characterp achar)) :rule-classes :rewrite)
Theorem:
(defthm abs-lowercase-letter-of-tree-fix-cst (equal (abs-lowercase-letter (abnf::tree-fix cst)) (abs-lowercase-letter cst)))
Theorem:
(defthm abs-lowercase-letter-tree-equiv-congruence-on-cst (implies (abnf::tree-equiv cst cst-equiv) (equal (abs-lowercase-letter cst) (abs-lowercase-letter cst-equiv))) :rule-classes :congruence)