Recognizer for bip32-index-tree.
(bip32-index-treep x) → yes/no
Function:
(defun bip32-index-treep (x) (declare (xargs :guard t)) (and (bip32-path-setp x) (not (emptyp x)) (bip32-path-set-closedp x)))
Theorem:
(defthm booleanp-of-bip32-index-treep (b* ((yes/no (bip32-index-treep x))) (booleanp yes/no)) :rule-classes :rewrite)
Theorem:
(defthm bip32-path-setp-when-bip32-index-treep (implies (bip32-index-treep x) (bip32-path-setp x)) :rule-classes (:rewrite :forward-chaining))
Theorem:
(defthm bip32-index-treep-of-singleton-empty-path (bip32-index-treep '(nil)))