(http-cst-field-vchar-conc1-rep cst) → csts
Function:
(defun http-cst-field-vchar-conc1-rep (cst) (declare (xargs :guard (treep cst))) (declare (xargs :guard (and (http-cst-matchp cst "field-vchar") (equal (http-cst-field-vchar-conc? cst) 1)))) (let ((__function__ 'http-cst-field-vchar-conc1-rep)) (declare (ignorable __function__)) (tree-list-fix (nth 0 (http-cst-field-vchar-conc1 cst)))))
Theorem:
(defthm tree-listp-of-http-cst-field-vchar-conc1-rep (b* ((csts (http-cst-field-vchar-conc1-rep cst))) (tree-listp csts)) :rule-classes :rewrite)
Theorem:
(defthm http-cst-field-vchar-conc1-rep-match (implies (and (http-cst-matchp cst "field-vchar") (equal (http-cst-field-vchar-conc? cst) 1)) (b* ((csts (http-cst-field-vchar-conc1-rep cst))) (http-cst-list-rep-matchp csts "vchar"))) :rule-classes :rewrite)
Theorem:
(defthm http-cst-field-vchar-conc1-rep-of-tree-fix-cst (equal (http-cst-field-vchar-conc1-rep (tree-fix cst)) (http-cst-field-vchar-conc1-rep cst)))
Theorem:
(defthm http-cst-field-vchar-conc1-rep-tree-equiv-congruence-on-cst (implies (tree-equiv cst cst-equiv) (equal (http-cst-field-vchar-conc1-rep cst) (http-cst-field-vchar-conc1-rep cst-equiv))) :rule-classes :congruence)