(vl-pp-lucidctx x &key (ps 'ps)) → ps
Function:
(defun vl-pp-lucidctx-fn (x ps) (declare (xargs :stobjs (ps))) (declare (xargs :guard (vl-lucidctx-p x))) (let ((__function__ 'vl-pp-lucidctx)) (declare (ignorable __function__)) (b* (((vl-lucidctx x))) (vl-ps-seq (vl-print "In ") (vl-print-modname x.modname) (vl-println? ", ") (vl-pp-ctxelement-summary x.elem) (vl-print " under scope: ") (vl-pp-scopestack-path x.ss)))))
Theorem:
(defthm vl-pp-lucidctx-fn-of-vl-lucidctx-fix-x (equal (vl-pp-lucidctx-fn (vl-lucidctx-fix x) ps) (vl-pp-lucidctx-fn x ps)))
Theorem:
(defthm vl-pp-lucidctx-fn-vl-lucidctx-equiv-congruence-on-x (implies (vl-lucidctx-equiv x x-equiv) (equal (vl-pp-lucidctx-fn x ps) (vl-pp-lucidctx-fn x-equiv ps))) :rule-classes :congruence)