Completeness theorem for parse-defined-as.
Theorem:
(defthm parse-defined-as-when-tree-match (implies (and (tree-match-element-p tree (element-rulename *defined-as*) *grammar*) (tree-terminatedp tree) (mv-nth 0 (parse-cwsp rest-input)) (mv-nth 0 (parse-ichar #\/ rest-input))) (equal (parse-defined-as (append (tree->string tree) rest-input)) (mv nil (tree-fix tree) (nat-list-fix rest-input)))))