Constraints induced by a terminated tree that matches
Theorem:
(defthm constraints-from-tree-match-alpha (implies (and (tree-match-element-p tree (element-rulename *alpha*) *grammar*) (tree-terminatedp tree)) (or (and (<= (char-code #\A) (car (tree->string tree))) (<= (car (tree->string tree)) (char-code #\Z))) (and (<= (char-code #\a) (car (tree->string tree))) (<= (car (tree->string tree)) (char-code #\z))))) :rule-classes nil)