Recognizer for fun-env.
(fun-envp x) → *
Function:
(defun fun-envp (x) (declare (xargs :guard t)) (if (atom x) (null x) (and (consp (car x)) (identp (caar x)) (fun-infop (cdar x)) (or (null (cdr x)) (and (consp (cdr x)) (consp (cadr x)) (acl2::fast-<< (caar x) (caadr x)) (fun-envp (cdr x)))))))
Theorem:
(defthm booleanp-of-fun-envp (booleanp (fun-envp x)))
Theorem:
(defthm mapp-when-fun-envp (implies (fun-envp x) (omap::mapp x)) :rule-classes (:rewrite :forward-chaining))
Theorem:
(defthm fun-envp-of-tail (implies (fun-envp x) (fun-envp (omap::tail x))))
Theorem:
(defthm identp-of-head-key-when-fun-envp (implies (and (fun-envp x) (not (omap::emptyp x))) (identp (mv-nth 0 (omap::head x)))))
Theorem:
(defthm fun-infop-of-head-val-when-fun-envp (implies (and (fun-envp x) (not (omap::emptyp x))) (fun-infop (mv-nth 1 (omap::head x)))))
Theorem:
(defthm fun-envp-of-update (implies (and (fun-envp x) (identp k) (fun-infop v)) (fun-envp (omap::update k v x))))
Theorem:
(defthm fun-envp-of-update* (implies (and (fun-envp x) (fun-envp y)) (fun-envp (omap::update* x y))))
Theorem:
(defthm fun-envp-of-delete (implies (fun-envp x) (fun-envp (omap::delete k x))))
Theorem:
(defthm fun-envp-of-delete* (implies (fun-envp x) (fun-envp (omap::delete* k x))))
Theorem:
(defthm identp-when-assoc-fun-envp-binds-free-x (implies (and (omap::assoc k x) (fun-envp x)) (identp k)))
Theorem:
(defthm identp-of-car-of-assoc-fun-envp (implies (and (fun-envp x) (omap::assoc k x)) (identp (car (omap::assoc k x)))))
Theorem:
(defthm fun-infop-of-cdr-of-assoc-fun-envp (implies (and (fun-envp x) (omap::assoc k x)) (fun-infop (cdr (omap::assoc k x)))))
Theorem:
(defthm fun-infop-of-lookup-when-fun-envp (implies (and (fun-envp x) (omap::assoc k x)) (fun-infop (omap::lookup k x))))