Update the |X86ISA|::|UNKNOWNBITS| field of a code-segment-descriptor-attributesbits bit structure.
(!code-segment-descriptor-attributesbits->unknownbits unknownbits x) → new-x
Function:
(defun !code-segment-descriptor-attributesbits->unknownbits$inline (unknownbits x) (declare (xargs :guard (and (4bits-p unknownbits) (code-segment-descriptor-attributesbits-p x)))) (mbe :logic (b* ((unknownbits (mbe :logic (4bits-fix unknownbits) :exec unknownbits)) (x (code-segment-descriptor-attributesbits-fix x))) (part-install unknownbits x :width 4 :low 12)) :exec (the (unsigned-byte 16) (logior (the (unsigned-byte 16) (logand (the (unsigned-byte 16) x) (the (signed-byte 17) -61441))) (the (unsigned-byte 16) (ash (the (unsigned-byte 4) unknownbits) 12))))))
Theorem:
(defthm code-segment-descriptor-attributesbits-p-of-!code-segment-descriptor-attributesbits->unknownbits (b* ((new-x (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits x))) (code-segment-descriptor-attributesbits-p new-x)) :rule-classes :rewrite)
Theorem:
(defthm !code-segment-descriptor-attributesbits->unknownbits$inline-of-4bits-fix-unknownbits (equal (!code-segment-descriptor-attributesbits->unknownbits$inline (4bits-fix unknownbits) x) (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits x)))
Theorem:
(defthm !code-segment-descriptor-attributesbits->unknownbits$inline-4bits-equiv-congruence-on-unknownbits (implies (4bits-equiv unknownbits unknownbits-equiv) (equal (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits x) (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits-equiv x))) :rule-classes :congruence)
Theorem:
(defthm !code-segment-descriptor-attributesbits->unknownbits$inline-of-code-segment-descriptor-attributesbits-fix-x (equal (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits (code-segment-descriptor-attributesbits-fix x)) (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits x)))
Theorem:
(defthm !code-segment-descriptor-attributesbits->unknownbits$inline-code-segment-descriptor-attributesbits-equiv-congruence-on-x (implies (code-segment-descriptor-attributesbits-equiv x x-equiv) (equal (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits x) (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits x-equiv))) :rule-classes :congruence)
Theorem:
(defthm !code-segment-descriptor-attributesbits->unknownbits-is-code-segment-descriptor-attributesbits (equal (!code-segment-descriptor-attributesbits->unknownbits unknownbits x) (change-code-segment-descriptor-attributesbits x :unknownbits unknownbits)))
Theorem:
(defthm code-segment-descriptor-attributesbits->unknownbits-of-!code-segment-descriptor-attributesbits->unknownbits (b* ((?new-x (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits x))) (equal (code-segment-descriptor-attributesbits->unknownbits new-x) (4bits-fix unknownbits))))
Theorem:
(defthm !code-segment-descriptor-attributesbits->unknownbits-equiv-under-mask (b* ((?new-x (!code-segment-descriptor-attributesbits->unknownbits$inline unknownbits x))) (code-segment-descriptor-attributesbits-equiv-under-mask new-x x 4095)))