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