(vl-scopestack->toplevel x) → top
Function:
(defun vl-scopestack->toplevel (x) (declare (xargs :guard (vl-scopestack-p x))) (let ((__function__ 'vl-scopestack->toplevel)) (declare (ignorable __function__)) (vl-scopestack-case x :local (vl-scopestack->toplevel x.super) :otherwise (vl-scopestack-fix x))))
Theorem:
(defthm vl-scopestack-p-of-vl-scopestack->toplevel (b* ((top (vl-scopestack->toplevel x))) (vl-scopestack-p top)) :rule-classes :rewrite)
Theorem:
(defthm vl-scopestack->toplevel-of-vl-scopestack-fix-x (equal (vl-scopestack->toplevel (vl-scopestack-fix x)) (vl-scopestack->toplevel x)))
Theorem:
(defthm vl-scopestack->toplevel-vl-scopestack-equiv-congruence-on-x (implies (vl-scopestack-equiv x x-equiv) (equal (vl-scopestack->toplevel x) (vl-scopestack->toplevel x-equiv))) :rule-classes :congruence)