(vl-pp-lucidval x &key (ps 'ps)) → ps
Function:
(defun vl-pp-lucidval-fn (x ps) (declare (xargs :stobjs (ps))) (declare (xargs :guard (vl-lucidval-p x))) (let ((__function__ 'vl-pp-lucidval)) (declare (ignorable __function__)) (b* (((vl-lucidval x))) (vl-ps-seq (vl-print "Used: ") (if x.used (vl-pp-lucidocclist (mergesort x.used)) (vl-print "never")) (vl-print "; Set: ") (if x.set (vl-pp-lucidocclist (mergesort x.set)) (vl-print "never")) (if x.errors (vl-cw "; Errors: ~x0~%" x.errors) ps)))))
Theorem:
(defthm vl-pp-lucidval-fn-of-vl-lucidval-fix-x (equal (vl-pp-lucidval-fn (vl-lucidval-fix x) ps) (vl-pp-lucidval-fn x ps)))
Theorem:
(defthm vl-pp-lucidval-fn-vl-lucidval-equiv-congruence-on-x (implies (vl-lucidval-equiv x x-equiv) (equal (vl-pp-lucidval-fn x ps) (vl-pp-lucidval-fn x-equiv ps))) :rule-classes :congruence)