(vl-paramdecl-lucidcheck x ss st) → new-st
Function:
(defun vl-paramdecl-lucidcheck (x ss st) (declare (xargs :guard (and (vl-paramdecl-p x) (vl-scopestack-p ss) (vl-lucidstate-p st)))) (declare (xargs :guard t)) (let ((__function__ 'vl-paramdecl-lucidcheck)) (declare (ignorable __function__)) (b* ((x (vl-paramdecl-fix x)) (ss (vl-scopestack-fix ss)) (st (vl-lucidstate-fix st))) (b* (((vl-paramdecl x)) (ctx (vl-lucid-ctx ss x))) (vl-paramtype-case x.type (:vl-implicitvalueparam (b* (((unless x.type.default) st) (st (vl-lucid-mark-simple :set x.name ss st ctx)) (st (vl-rhsexpr-lucidcheck x.type.default ss st ctx))) st)) (:vl-explicitvalueparam (b* ((st (vl-datatype-lucidcheck x.type.type ss st ctx)) ((unless x.type.default) st) (st (vl-lucid-mark-simple :set x.name ss st ctx)) (st (vl-rhsexpr-lucidcheck x.type.default ss st ctx))) st)) (:vl-typeparam (b* (((unless x.type.default) st) (st (vl-lucid-mark-simple :set x.name ss st ctx)) (st (vl-datatype-lucidcheck x.type.default ss st ctx))) st)))))))
Theorem:
(defthm vl-lucidstate-p-of-vl-paramdecl-lucidcheck (b* ((new-st (vl-paramdecl-lucidcheck x ss st))) (vl-lucidstate-p new-st)) :rule-classes :rewrite)
Theorem:
(defthm vl-paramdecl-lucidcheck-of-vl-paramdecl-fix-x (equal (vl-paramdecl-lucidcheck (vl-paramdecl-fix x) ss st) (vl-paramdecl-lucidcheck x ss st)))
Theorem:
(defthm vl-paramdecl-lucidcheck-vl-paramdecl-equiv-congruence-on-x (implies (vl-paramdecl-equiv x x-equiv) (equal (vl-paramdecl-lucidcheck x ss st) (vl-paramdecl-lucidcheck x-equiv ss st))) :rule-classes :congruence)
Theorem:
(defthm vl-paramdecl-lucidcheck-of-vl-scopestack-fix-ss (equal (vl-paramdecl-lucidcheck x (vl-scopestack-fix ss) st) (vl-paramdecl-lucidcheck x ss st)))
Theorem:
(defthm vl-paramdecl-lucidcheck-vl-scopestack-equiv-congruence-on-ss (implies (vl-scopestack-equiv ss ss-equiv) (equal (vl-paramdecl-lucidcheck x ss st) (vl-paramdecl-lucidcheck x ss-equiv st))) :rule-classes :congruence)
Theorem:
(defthm vl-paramdecl-lucidcheck-of-vl-lucidstate-fix-st (equal (vl-paramdecl-lucidcheck x ss (vl-lucidstate-fix st)) (vl-paramdecl-lucidcheck x ss st)))
Theorem:
(defthm vl-paramdecl-lucidcheck-vl-lucidstate-equiv-congruence-on-st (implies (vl-lucidstate-equiv st st-equiv) (equal (vl-paramdecl-lucidcheck x ss st) (vl-paramdecl-lucidcheck x ss st-equiv))) :rule-classes :congruence)