• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Community
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Math
      • 100-theorems
      • Arithmetic
      • Bit-vectors
        • Sparseint
          • Sparseint-impl
            • Sparseint$-binary-bitop-width
            • Sparseint$-plus-width
            • Sparseint$-binary-bitop-offset
            • Sparseint$-binary-bitop-int-width
            • Sparseint$-plus-int-width
            • Sum-with-cin
            • Sparseint$-plus-offset
            • Sparseint$-binary-bitop-int
            • Sparseint$-finalize-concat
            • Sparseint$-plus-int
            • Sparseint$-binary-bittest-width
            • Sparseint$-binary-bittest-int-width
              • Sparseint$-trailing-0-count-width
              • Sparseint$-height
              • Int-to-sparseint$-rec
              • Carry-out
              • Sparseint$-compare-width
              • Sparseint$-binary-bittest-offset
              • Sparseint$-equal-width
              • Sparseint$-binary-bittest-int
              • Sparseint$-compare-int-width
              • Sparseint$-bitcount-width
              • Sparseint$-unary-bittest-width
              • Sparseint$-rightshift-rec
              • Sparseint$-equal-int-width
              • Sparseint$-trailing-0-count-rec
              • Sparseint$-unary-bitop
              • Sparseint$-concatenate
              • Sparseint$-length-width-rec
              • Sparseint$-sign-ext
              • Sparseint$-binary-bitop
              • Binary-bitop
              • Sparseint$-compare-offset
              • Sparseint$-unary-bittest-offset
              • Sparseint$-equal-offset
              • Sparseint$-truncate
              • Sparseint$-mergeable-leaves-p
              • Carry-out-bit
              • Sparseint$-truncate-height
              • Sparseint$-compare-int
              • Sparseint$-binary-bittest
              • Sparseint$-equal-int
              • Sparseint$-rightshift
              • Sparseint$-leaves-mergeable-p
              • Sparseint$-plus
              • Unary-bitop
              • Sparseint$-bitcount-rec
              • Within-1
              • Sparseint$
              • Binary-bitop-cofactor2
              • Binary-bitop-cofactor1
              • Sparseint$-compare
              • Sparseint$-unary-bittest
              • Sparseint$-height-correct-exec
              • Sparseint$-equal
              • Sparseint$-bitnot
              • Sparseint$-unary-minus
              • Sparseint$-bit
              • Int-to-sparseint$
              • Binary-bittest
              • Sparseint$-length-rec
              • Sparseint$-val
              • Binary-bitop-swap
              • Compare
              • Sparseint$-real-height
              • Sparseint$-height-correctp
              • Sparseint$-length
            • Sparseint-p
            • Sparseint-binary-bittest
            • Sparseint-concatenate
            • Sparseint-binary-bitop
            • Sparseint-bitite
            • Sparseint-fix
            • Sparseint$-binary-minus
            • Sparseint-trailing-1-count-from
            • Sparseint-trailing-0-count-from
            • Sparseint-equal
            • Sparseint-test-bitorc2
            • Sparseint-test-bitorc1
            • Sparseint-test-bitnand
            • Sparseint-test-bitandc2
            • Sparseint-test-bitandc1
            • Sparseint-test-bitand
            • Sparseint-rightshift
            • Sparseint-bitcount-from
            • Sparseint-test-bitxor
            • Sparseint-test-bitor
            • Sparseint-test-bitnor
            • Sparseint-test-biteqv
            • Sparseint-compare
            • Sparseint-binary-minus
            • Sparseint-sign-ext
            • Sparseint-plus
            • Sparseint-bitandc2
            • Sparseint-bitandc1
            • Sparseint-bitand
            • Sparseint$-leaf-bitlimit
            • Sparseint-bitxor
            • Sparseint-bitorc2
            • Sparseint-bitorc1
            • Sparseint-bitor
            • Sparseint-bitnor
            • Sparseint-bitnand
            • Sparseint-biteqv
            • Sparseint-ash
            • Sparseint-<
            • Sparseint-bit
            • Sparseint-trailing-1-count
            • Sparseint-trailing-0-count
            • Sparseint-unary-minus
            • Sparseint-length
            • Sparseint-bitnot
            • Sparseint-bitcount
            • Int-to-sparseint
            • Sparseint-val
          • Bitops
          • Bv
          • Ihs
          • Rtl
        • Algebra
      • Testing-utilities
    • Sparseint-impl

    Sparseint$-binary-bittest-int-width

    Signature
    (sparseint$-binary-bittest-int-width op width offset x y) 
      → 
    test
    Arguments
    op — Guard (integerp op).
    width — Guard (posp width).
    offset — Guard (natp offset).
    x — Guard (sparseint$-p x).
    y — Guard (integerp y).
    Returns
    test — Type (booleanp test).

    Definitions and Theorems

    Function: sparseint$-binary-bittest-int-width

    (defun sparseint$-binary-bittest-int-width (op width offset x y)
     (declare (type (unsigned-byte 4) op))
     (declare (xargs :guard (and (integerp op)
                                 (posp width)
                                 (natp offset)
                                 (sparseint$-p x)
                                 (integerp y))))
     (let ((__function__ 'sparseint$-binary-bittest-int-width))
      (declare (ignorable __function__))
      (b*
        ((width (lposfix width))
         (offset (lnfix offset))
         (y (lifix y))
         ((when (or (eql y 0) (eql y -1)))
          (b* ((cofactor (binary-bitop-cofactor2 op (- y))))
            (sparseint$-unary-bittest-width cofactor width offset x))))
       (sparseint$-case
            x :leaf
            (binary-bittest op
                            (bignum-logext width (logtail offset x.val))
                            (bignum-logext width y))
            :concat
            (b* (((when (<= x.width offset))
                  (sparseint$-binary-bittest-int-width
                       op width (- offset x.width)
                       x.msbs y))
                 (width1 (- x.width offset))
                 ((when (<= width width1))
                  (sparseint$-binary-bittest-int-width
                       op width offset x.lsbs y)))
              (or (sparseint$-binary-bittest-int-width
                       op width1
                       offset x.lsbs (bignum-logext width1 y))
                  (sparseint$-binary-bittest-int-width
                       op (- width width1)
                       0 x.msbs (logtail width1 y))))))))

    Theorem: booleanp-of-sparseint$-binary-bittest-int-width

    (defthm booleanp-of-sparseint$-binary-bittest-int-width
     (b*
      ((test (sparseint$-binary-bittest-int-width op width offset x y)))
      (booleanp test))
     :rule-classes :type-prescription)

    Theorem: sparseint$-val-of-sparseint$-binary-bittest-int-width

    (defthm sparseint$-val-of-sparseint$-binary-bittest-int-width
      (b*
       ((?test
             (sparseint$-binary-bittest-int-width op width offset x y)))
       (equal
            test
            (binary-bittest op
                            (logext width
                                    (logtail offset (sparseint$-val x)))
                            (logext width y)))))

    Theorem: sparseint$-binary-bittest-int-width-of-ifix-op

    (defthm sparseint$-binary-bittest-int-width-of-ifix-op
      (equal (sparseint$-binary-bittest-int-width (ifix op)
                                                  width offset x y)
             (sparseint$-binary-bittest-int-width op width offset x y)))

    Theorem: sparseint$-binary-bittest-int-width-int-equiv-congruence-on-op

    (defthm
         sparseint$-binary-bittest-int-width-int-equiv-congruence-on-op
     (implies
      (int-equiv op op-equiv)
      (equal
       (sparseint$-binary-bittest-int-width op width offset x y)
       (sparseint$-binary-bittest-int-width op-equiv width offset x y)))
     :rule-classes :congruence)

    Theorem: sparseint$-binary-bittest-int-width-of-pos-fix-width

    (defthm sparseint$-binary-bittest-int-width-of-pos-fix-width
      (equal (sparseint$-binary-bittest-int-width op (pos-fix width)
                                                  offset x y)
             (sparseint$-binary-bittest-int-width op width offset x y)))

    Theorem: sparseint$-binary-bittest-int-width-pos-equiv-congruence-on-width

    (defthm
      sparseint$-binary-bittest-int-width-pos-equiv-congruence-on-width
     (implies
      (pos-equiv width width-equiv)
      (equal
       (sparseint$-binary-bittest-int-width op width offset x y)
       (sparseint$-binary-bittest-int-width op width-equiv offset x y)))
     :rule-classes :congruence)

    Theorem: sparseint$-binary-bittest-int-width-of-nfix-offset

    (defthm sparseint$-binary-bittest-int-width-of-nfix-offset
      (equal (sparseint$-binary-bittest-int-width op width (nfix offset)
                                                  x y)
             (sparseint$-binary-bittest-int-width op width offset x y)))

    Theorem: sparseint$-binary-bittest-int-width-nat-equiv-congruence-on-offset

    (defthm
     sparseint$-binary-bittest-int-width-nat-equiv-congruence-on-offset
     (implies
      (nat-equiv offset offset-equiv)
      (equal
       (sparseint$-binary-bittest-int-width op width offset x y)
       (sparseint$-binary-bittest-int-width op width offset-equiv x y)))
     :rule-classes :congruence)

    Theorem: sparseint$-binary-bittest-int-width-of-sparseint$-fix-x

    (defthm sparseint$-binary-bittest-int-width-of-sparseint$-fix-x
      (equal (sparseint$-binary-bittest-int-width
                  op width offset (sparseint$-fix x)
                  y)
             (sparseint$-binary-bittest-int-width op width offset x y)))

    Theorem: sparseint$-binary-bittest-int-width-sparseint$-equiv-congruence-on-x

    (defthm
     sparseint$-binary-bittest-int-width-sparseint$-equiv-congruence-on-x
     (implies
      (sparseint$-equiv x x-equiv)
      (equal
       (sparseint$-binary-bittest-int-width op width offset x y)
       (sparseint$-binary-bittest-int-width op width offset x-equiv y)))
     :rule-classes :congruence)

    Theorem: sparseint$-binary-bittest-int-width-of-ifix-y

    (defthm sparseint$-binary-bittest-int-width-of-ifix-y
     (equal
        (sparseint$-binary-bittest-int-width op width offset x (ifix y))
        (sparseint$-binary-bittest-int-width op width offset x y)))

    Theorem: sparseint$-binary-bittest-int-width-int-equiv-congruence-on-y

    (defthm
          sparseint$-binary-bittest-int-width-int-equiv-congruence-on-y
     (implies
      (int-equiv y y-equiv)
      (equal
       (sparseint$-binary-bittest-int-width op width offset x y)
       (sparseint$-binary-bittest-int-width op width offset x y-equiv)))
     :rule-classes :congruence)