Basic theorems about fgl-runelist-p, generated by deflist.
Theorem:
(defthm fgl-runelist-p-of-cons (equal (fgl-runelist-p (cons a x)) (and (fgl-rune-p a) (fgl-runelist-p x))) :rule-classes ((:rewrite)))
Theorem:
(defthm fgl-runelist-p-of-cdr-when-fgl-runelist-p (implies (fgl-runelist-p (double-rewrite x)) (fgl-runelist-p (cdr x))) :rule-classes ((:rewrite)))
Theorem:
(defthm fgl-runelist-p-when-not-consp (implies (not (consp x)) (equal (fgl-runelist-p x) (not x))) :rule-classes ((:rewrite)))
Theorem:
(defthm fgl-rune-p-of-car-when-fgl-runelist-p (implies (fgl-runelist-p x) (iff (fgl-rune-p (car x)) (or (consp x) (fgl-rune-p nil)))) :rule-classes ((:rewrite)))
Theorem:
(defthm true-listp-when-fgl-runelist-p-compound-recognizer (implies (fgl-runelist-p x) (true-listp x)) :rule-classes :compound-recognizer)