		Search-engine friendly clone of the ACL2 documentation.

Grammar

Cst-lexeme-conc1-rep

Signature
(cst-lexeme-conc1-rep abnf::cst) → abnf::csts
Arguments: abnf::cst — Guard (abnf::treep abnf::cst).
Returns: abnf::csts — Type (abnf::tree-listp abnf::csts).

Definitions and Theorems

Function: cst-lexeme-conc1-rep

(defun cst-lexeme-conc1-rep (abnf::cst)
  (declare (xargs :guard (abnf::treep abnf::cst)))
  (declare (xargs :guard (and (cst-matchp abnf::cst "lexeme")
                              (equal (cst-lexeme-conc? abnf::cst)
                                     1))))
  (let ((__function__ 'cst-lexeme-conc1-rep))
    (declare (ignorable __function__))
    (abnf::tree-list-fix (nth 0 (cst-lexeme-conc1 abnf::cst)))))

Theorem: tree-listp-of-cst-lexeme-conc1-rep

(defthm tree-listp-of-cst-lexeme-conc1-rep
  (b* ((abnf::csts (cst-lexeme-conc1-rep abnf::cst)))
    (abnf::tree-listp abnf::csts))
  :rule-classes :rewrite)

Theorem: cst-lexeme-conc1-rep-match

(defthm cst-lexeme-conc1-rep-match
  (implies (and (cst-matchp abnf::cst "lexeme")
                (equal (cst-lexeme-conc? abnf::cst) 1))
           (b* ((abnf::csts (cst-lexeme-conc1-rep abnf::cst)))
             (cst-list-rep-matchp abnf::csts "token")))
  :rule-classes :rewrite)

Theorem: cst-lexeme-conc1-rep-of-tree-fix-cst

(defthm cst-lexeme-conc1-rep-of-tree-fix-cst
  (equal (cst-lexeme-conc1-rep (abnf::tree-fix abnf::cst))
         (cst-lexeme-conc1-rep abnf::cst)))

Theorem: cst-lexeme-conc1-rep-tree-equiv-congruence-on-cst

(defthm cst-lexeme-conc1-rep-tree-equiv-congruence-on-cst
  (implies (abnf::tree-equiv abnf::cst cst-equiv)
           (equal (cst-lexeme-conc1-rep abnf::cst)
                  (cst-lexeme-conc1-rep cst-equiv)))
  :rule-classes :congruence)