Update the |ACL2|::|R| field of a code-segment-descriptor-attributesbits bit structure.
(!code-segment-descriptor-attributesbits->r r x) → new-x
Function:
(defun !code-segment-descriptor-attributesbits->r$inline (r x) (declare (xargs :guard (and (bitp r) (code-segment-descriptor-attributesbits-p x)))) (mbe :logic (b* ((r (mbe :logic (bfix r) :exec r)) (x (code-segment-descriptor-attributesbits-fix x))) (part-install r x :width 1 :low 1)) :exec (the (unsigned-byte 16) (logior (the (unsigned-byte 16) (logand (the (unsigned-byte 16) x) (the (signed-byte 3) -3))) (the (unsigned-byte 2) (ash (the (unsigned-byte 1) r) 1))))))
Theorem:
(defthm code-segment-descriptor-attributesbits-p-of-!code-segment-descriptor-attributesbits->r (b* ((new-x (!code-segment-descriptor-attributesbits->r$inline r x))) (code-segment-descriptor-attributesbits-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm !code-segment-descriptor-attributesbits->r$inline-of-bfix-r (equal (!code-segment-descriptor-attributesbits->r$inline (bfix r) x) (!code-segment-descriptor-attributesbits->r$inline r x)))
Theorem:
(defthm !code-segment-descriptor-attributesbits->r$inline-bit-equiv-congruence-on-r (implies (bit-equiv r r-equiv) (equal (!code-segment-descriptor-attributesbits->r$inline r x) (!code-segment-descriptor-attributesbits->r$inline r-equiv x))) :rule-classes :congruence)
Theorem:
(defthm !code-segment-descriptor-attributesbits->r$inline-of-code-segment-descriptor-attributesbits-fix-x (equal (!code-segment-descriptor-attributesbits->r$inline r (code-segment-descriptor-attributesbits-fix x)) (!code-segment-descriptor-attributesbits->r$inline r x)))
Theorem:
(defthm !code-segment-descriptor-attributesbits->r$inline-code-segment-descriptor-attributesbits-equiv-congruence-on-x (implies (code-segment-descriptor-attributesbits-equiv x x-equiv) (equal (!code-segment-descriptor-attributesbits->r$inline r x) (!code-segment-descriptor-attributesbits->r$inline r x-equiv))) :rule-classes :congruence)
Theorem:
(defthm !code-segment-descriptor-attributesbits->r-is-code-segment-descriptor-attributesbits (equal (!code-segment-descriptor-attributesbits->r r x) (change-code-segment-descriptor-attributesbits x :r r)))
Theorem:
(defthm code-segment-descriptor-attributesbits->r-of-!code-segment-descriptor-attributesbits->r (b* ((?new-x (!code-segment-descriptor-attributesbits->r$inline r x))) (equal (code-segment-descriptor-attributesbits->r new-x) (bfix r))))
Theorem:
(defthm !code-segment-descriptor-attributesbits->r-equiv-under-mask (b* ((?new-x (!code-segment-descriptor-attributesbits->r$inline r x))) (code-segment-descriptor-attributesbits-equiv-under-mask new-x x -3)))