Constraints induced by a terminated tree that matches
Theorem:
(defthm constraints-from-tree-match-num-val (implies (and (tree-match-element-p tree (element-rulename *num-val*) *grammar*) (tree-terminatedp tree)) (and (equal (car (tree->string tree)) (char-code #\%)) (member-equal (cadr (tree->string tree)) (chars=>nats '(#\B #\D #\X #\b #\d #\x))))) :rule-classes nil)