Base case of the completeness lemma for parse-element.
Theorem: parse-element-when-tree-match-base-case
(defthm parse-element-when-tree-match-base-case (implies (not (mv-nth 0 (parse-rulename input))) (pred-element input)))