		Search-engine friendly clone of the ACL2 documentation.

Cr0bits

!cr0bits->mp

Update the |X86ISA|::|MP| field of a cr0bits bit structure.

Signature
(!cr0bits->mp mp x) → new-x
Arguments: mp — Guard (bitp mp).; x — Guard (cr0bits-p x).
Returns: new-x — Type (cr0bits-p new-x).

Definitions and Theorems

Function: !cr0bits->mp$inline

(defun !cr0bits->mp$inline (mp x)
 (declare (xargs :guard (and (bitp mp) (cr0bits-p x))))
 (mbe
     :logic
     (b* ((mp (mbe :logic (bfix mp) :exec mp))
          (x (cr0bits-fix x)))
       (part-install mp x :width 1 :low 1))
     :exec (the (unsigned-byte 32)
                (logior (the (unsigned-byte 32)
                             (logand (the (unsigned-byte 32) x)
                                     (the (signed-byte 3) -3)))
                        (the (unsigned-byte 2)
                             (ash (the (unsigned-byte 1) mp) 1))))))

Theorem: cr0bits-p-of-!cr0bits->mp

(defthm cr0bits-p-of-!cr0bits->mp
  (b* ((new-x (!cr0bits->mp$inline mp x)))
    (cr0bits-p new-x))
  :rule-classes :rewrite)

Theorem: !cr0bits->mp$inline-of-bfix-mp

(defthm !cr0bits->mp$inline-of-bfix-mp
  (equal (!cr0bits->mp$inline (bfix mp) x)
         (!cr0bits->mp$inline mp x)))

Theorem: !cr0bits->mp$inline-bit-equiv-congruence-on-mp

(defthm !cr0bits->mp$inline-bit-equiv-congruence-on-mp
  (implies (bit-equiv mp mp-equiv)
           (equal (!cr0bits->mp$inline mp x)
                  (!cr0bits->mp$inline mp-equiv x)))
  :rule-classes :congruence)

Theorem: !cr0bits->mp$inline-of-cr0bits-fix-x

(defthm !cr0bits->mp$inline-of-cr0bits-fix-x
  (equal (!cr0bits->mp$inline mp (cr0bits-fix x))
         (!cr0bits->mp$inline mp x)))

Theorem: !cr0bits->mp$inline-cr0bits-equiv-congruence-on-x

(defthm !cr0bits->mp$inline-cr0bits-equiv-congruence-on-x
  (implies (cr0bits-equiv x x-equiv)
           (equal (!cr0bits->mp$inline mp x)
                  (!cr0bits->mp$inline mp x-equiv)))
  :rule-classes :congruence)

Theorem: !cr0bits->mp-is-cr0bits

(defthm !cr0bits->mp-is-cr0bits
  (equal (!cr0bits->mp mp x)
         (change-cr0bits x :mp mp)))

Theorem: cr0bits->mp-of-!cr0bits->mp

(defthm cr0bits->mp-of-!cr0bits->mp
  (b* ((?new-x (!cr0bits->mp$inline mp x)))
    (equal (cr0bits->mp new-x) (bfix mp))))

Theorem: !cr0bits->mp-equiv-under-mask

(defthm !cr0bits->mp-equiv-under-mask
  (b* ((?new-x (!cr0bits->mp$inline mp x)))
    (cr0bits-equiv-under-mask new-x x -3)))