(vl-pp-lucidstate x &key (ps 'ps)) → ps
Function:
(defun vl-pp-lucidstate-fn (x ps) (declare (xargs :stobjs (ps))) (declare (xargs :guard (vl-lucidstate-p x))) (let ((__function__ 'vl-pp-lucidstate)) (declare (ignorable __function__)) (b* (((vl-lucidstate x))) (vl-ps-seq (vl-println "lucidstate {") (vl-pp-luciddb x.db) (vl-println "}")))))
Theorem:
(defthm vl-pp-lucidstate-fn-of-vl-lucidstate-fix-x (equal (vl-pp-lucidstate-fn (vl-lucidstate-fix x) ps) (vl-pp-lucidstate-fn x ps)))
Theorem:
(defthm vl-pp-lucidstate-fn-vl-lucidstate-equiv-congruence-on-x (implies (vl-lucidstate-equiv x x-equiv) (equal (vl-pp-lucidstate-fn x ps) (vl-pp-lucidstate-fn x-equiv ps))) :rule-classes :congruence)