Get the top-node-alist field from a svexl-alist.
(svexl-alist->top-node-alist x) → top-node-alist
This is an ordinary field accessor created by fty::defprod.
Function:
(defun svexl-alist->top-node-alist$inline (x) (declare (xargs :guard (svexl-alist-p x))) (declare (xargs :guard t)) (let ((acl2::__function__ 'svexl-alist->top-node-alist)) (declare (ignorable acl2::__function__)) (mbe :logic (b* ((x (and t x))) (svexl-node-alist-fix (cdr (std::da-nth 0 x)))) :exec (cdr (std::da-nth 0 x)))))
Theorem:
(defthm svexl-node-alist-p-of-svexl-alist->top-node-alist (b* ((top-node-alist (svexl-alist->top-node-alist$inline x))) (svexl-node-alist-p top-node-alist)) :rule-classes :rewrite)
Theorem:
(defthm svexl-alist->top-node-alist$inline-of-svexl-alist-fix-x (equal (svexl-alist->top-node-alist$inline (svexl-alist-fix x)) (svexl-alist->top-node-alist$inline x)))
Theorem:
(defthm svexl-alist->top-node-alist$inline-svexl-alist-equiv-congruence-on-x (implies (svexl-alist-equiv x x-equiv) (equal (svexl-alist->top-node-alist$inline x) (svexl-alist->top-node-alist$inline x-equiv))) :rule-classes :congruence)