Function:
(defun imap-cst-astring-char-conc? (cst) (declare (xargs :guard (treep cst))) (declare (xargs :guard (imap-cst-matchp cst "astring-char"))) (let ((__function__ 'imap-cst-astring-char-conc?)) (declare (ignorable __function__)) (cond ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "atom-char")) 1) ((equal (tree-nonleaf->rulename? (nth 0 (nth 0 (tree-nonleaf->branches cst)))) (rulename "resp-specials")) 2) (t (prog2$ (acl2::impossible) 1)))))
Theorem:
(defthm posp-of-imap-cst-astring-char-conc? (b* ((number (imap-cst-astring-char-conc? cst))) (posp number)) :rule-classes :rewrite)
Theorem:
(defthm imap-cst-astring-char-conc?-possibilities (b* ((number (imap-cst-astring-char-conc? cst))) (or (equal number 1) (equal number 2))) :rule-classes ((:forward-chaining :trigger-terms ((imap-cst-astring-char-conc? cst)))))
Theorem:
(defthm imap-cst-astring-char-conc?-of-tree-fix-cst (equal (imap-cst-astring-char-conc? (tree-fix cst)) (imap-cst-astring-char-conc? cst)))
Theorem:
(defthm imap-cst-astring-char-conc?-tree-equiv-congruence-on-cst (implies (tree-equiv cst cst-equiv) (equal (imap-cst-astring-char-conc? cst) (imap-cst-astring-char-conc? cst-equiv))) :rule-classes :congruence)
Theorem:
(defthm imap-cst-astring-char-conc?-1-iff-match-conc (implies (imap-cst-matchp cst "astring-char") (iff (equal (imap-cst-astring-char-conc? cst) 1) (imap-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "atom-char"))))
Theorem:
(defthm imap-cst-astring-char-conc?-2-iff-match-conc (implies (imap-cst-matchp cst "astring-char") (iff (equal (imap-cst-astring-char-conc? cst) 2) (imap-cst-list-list-conc-matchp (tree-nonleaf->branches cst) "resp-specials"))))