(uri-cst-uri-reference-conc2-rep cst) → csts
Function:
(defun uri-cst-uri-reference-conc2-rep (cst) (declare (xargs :guard (treep cst))) (declare (xargs :guard (and (uri-cst-matchp cst "uri-reference") (equal (uri-cst-uri-reference-conc? cst) 2)))) (let ((__function__ 'uri-cst-uri-reference-conc2-rep)) (declare (ignorable __function__)) (tree-list-fix (nth 0 (uri-cst-uri-reference-conc2 cst)))))
Theorem:
(defthm tree-listp-of-uri-cst-uri-reference-conc2-rep (b* ((csts (uri-cst-uri-reference-conc2-rep cst))) (tree-listp csts)) :rule-classes :rewrite)
Theorem:
(defthm uri-cst-uri-reference-conc2-rep-match (implies (and (uri-cst-matchp cst "uri-reference") (equal (uri-cst-uri-reference-conc? cst) 2)) (b* ((csts (uri-cst-uri-reference-conc2-rep cst))) (uri-cst-list-rep-matchp csts "relative-ref"))) :rule-classes :rewrite)
Theorem:
(defthm uri-cst-uri-reference-conc2-rep-of-tree-fix-cst (equal (uri-cst-uri-reference-conc2-rep (tree-fix cst)) (uri-cst-uri-reference-conc2-rep cst)))
Theorem:
(defthm uri-cst-uri-reference-conc2-rep-tree-equiv-congruence-on-cst (implies (tree-equiv cst cst-equiv) (equal (uri-cst-uri-reference-conc2-rep cst) (uri-cst-uri-reference-conc2-rep cst-equiv))) :rule-classes :congruence)