(vl-modinst-lucidcheck x ss st) → new-st
Function:
(defun vl-modinst-lucidcheck (x ss st) (declare (xargs :guard (and (vl-modinst-p x) (vl-scopestack-p ss) (vl-lucidstate-p st)))) (declare (xargs :guard t)) (let ((__function__ 'vl-modinst-lucidcheck)) (declare (ignorable __function__)) (b* ((x (vl-modinst-fix x)) (ss (vl-scopestack-fix ss)) (st (vl-lucidstate-fix st))) (b* (((vl-modinst x)) (ctx (vl-lucid-ctx ss x)) (st (vl-maybe-range-lucidcheck x.range ss st ctx)) (st (vl-maybe-gatedelay-lucidcheck x.delay ss st ctx)) (st (vl-paramargs-lucidcheck x.paramargs ss st ctx)) (st (vl-arguments-lucidcheck x.portargs ss st ctx))) st))))
Theorem:
(defthm vl-lucidstate-p-of-vl-modinst-lucidcheck (b* ((new-st (vl-modinst-lucidcheck x ss st))) (vl-lucidstate-p new-st)) :rule-classes :rewrite)
Theorem:
(defthm vl-modinst-lucidcheck-of-vl-modinst-fix-x (equal (vl-modinst-lucidcheck (vl-modinst-fix x) ss st) (vl-modinst-lucidcheck x ss st)))
Theorem:
(defthm vl-modinst-lucidcheck-vl-modinst-equiv-congruence-on-x (implies (vl-modinst-equiv x x-equiv) (equal (vl-modinst-lucidcheck x ss st) (vl-modinst-lucidcheck x-equiv ss st))) :rule-classes :congruence)
Theorem:
(defthm vl-modinst-lucidcheck-of-vl-scopestack-fix-ss (equal (vl-modinst-lucidcheck x (vl-scopestack-fix ss) st) (vl-modinst-lucidcheck x ss st)))
Theorem:
(defthm vl-modinst-lucidcheck-vl-scopestack-equiv-congruence-on-ss (implies (vl-scopestack-equiv ss ss-equiv) (equal (vl-modinst-lucidcheck x ss st) (vl-modinst-lucidcheck x ss-equiv st))) :rule-classes :congruence)
Theorem:
(defthm vl-modinst-lucidcheck-of-vl-lucidstate-fix-st (equal (vl-modinst-lucidcheck x ss (vl-lucidstate-fix st)) (vl-modinst-lucidcheck x ss st)))
Theorem:
(defthm vl-modinst-lucidcheck-vl-lucidstate-equiv-congruence-on-st (implies (vl-lucidstate-equiv st st-equiv) (equal (vl-modinst-lucidcheck x ss st) (vl-modinst-lucidcheck x ss st-equiv))) :rule-classes :congruence)