Lex a
(lex-58-lcletter/decdigit input) → (mv trees rest-input)
Function:
(defun lex-58-lcletter/decdigit (input) (declare (xargs :guard (nat-listp input))) (let ((__function__ 'lex-58-lcletter/decdigit)) (declare (ignorable __function__)) (b* (((mv trees input1) (lex-*-lcletter/decdigit input)) ((unless (= (len trees) 58)) (mv (reserrf (list :found trees :required 58)) (nat-list-fix input)))) (mv trees input1))))
Theorem:
(defthm tree-list-resultp-of-lex-58-lcletter/decdigit.trees (b* (((mv ?trees ?rest-input) (lex-58-lcletter/decdigit input))) (abnf::tree-list-resultp trees)) :rule-classes :rewrite)
Theorem:
(defthm nat-listp-of-lex-58-lcletter/decdigit.rest-input (b* (((mv ?trees ?rest-input) (lex-58-lcletter/decdigit input))) (nat-listp rest-input)) :rule-classes :rewrite)
Theorem:
(defthm len-of-lex-58-lcletter/decdigit-<= (b* (((mv ?trees ?rest-input) (lex-58-lcletter/decdigit input))) (<= (len rest-input) (len input))) :rule-classes :linear)
Theorem:
(defthm len-of-lex-58-lcletter/decdigit-< (b* (((mv ?trees ?rest-input) (lex-58-lcletter/decdigit input))) (implies (not (reserrp trees)) (<= (len rest-input) (len input)))) :rule-classes :linear)
Theorem:
(defthm lex-58-lcletter/decdigit-of-nat-list-fix-input (equal (lex-58-lcletter/decdigit (nat-list-fix input)) (lex-58-lcletter/decdigit input)))
Theorem:
(defthm lex-58-lcletter/decdigit-nat-list-equiv-congruence-on-input (implies (acl2::nat-list-equiv input input-equiv) (equal (lex-58-lcletter/decdigit input) (lex-58-lcletter/decdigit input-equiv))) :rule-classes :congruence)