• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • 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$-truncate

    Signature
    (sparseint$-truncate width x) → new-x
    Arguments
    width — Guard (posp width).
    x — Guard (sparseint$-p x).
    Returns
    new-x — Type (sparseint$-p new-x).

    Definitions and Theorems

    Function: sparseint$-truncate

    (defun sparseint$-truncate (width x)
      (declare (xargs :guard (and (posp width) (sparseint$-p x))))
      (let ((__function__ 'sparseint$-truncate))
        (declare (ignorable __function__))
        (sparseint$-case x :leaf (sparseint$-fix x)
                         :concat
                         (if (< x.width (lposfix width))
                             (sparseint$-fix x)
                           (sparseint$-truncate width x.lsbs)))))

    Theorem: sparseint$-p-of-sparseint$-truncate

    (defthm sparseint$-p-of-sparseint$-truncate
      (b* ((new-x (sparseint$-truncate width x)))
        (sparseint$-p new-x))
      :rule-classes :rewrite)

    Theorem: loghead-of-sparseint$-truncate

    (defthm loghead-of-sparseint$-truncate
      (b* ((?new-x (sparseint$-truncate width x)))
        (implies (equal width1 (pos-fix width))
                 (equal (loghead width1 (sparseint$-val new-x))
                        (loghead width1 (sparseint$-val x))))))

    Theorem: logapp-of-sparseint$-truncate

    (defthm logapp-of-sparseint$-truncate
      (b* ((?new-x (sparseint$-truncate width x)))
        (implies (equal width1 (pos-fix width))
                 (equal (logapp width1 (sparseint$-val new-x) y)
                        (logapp width1 (sparseint$-val x) y)))))

    Theorem: sparseint$-height-correctp-of-sparseint$-truncate

    (defthm sparseint$-height-correctp-of-sparseint$-truncate
      (b* ((?new-x (sparseint$-truncate width x)))
        (implies (sparseint$-height-correctp x)
                 (sparseint$-height-correctp new-x))))

    Theorem: height-of-sparseint$-truncate

    (defthm height-of-sparseint$-truncate
      (b* ((?new-x (sparseint$-truncate width x)))
        (<= (sparseint$-height new-x)
            (sparseint$-height x)))
      :rule-classes :linear)

    Theorem: sparseint$-truncate-of-pos-fix-width

    (defthm sparseint$-truncate-of-pos-fix-width
      (equal (sparseint$-truncate (pos-fix width) x)
             (sparseint$-truncate width x)))

    Theorem: sparseint$-truncate-pos-equiv-congruence-on-width

    (defthm sparseint$-truncate-pos-equiv-congruence-on-width
      (implies (pos-equiv width width-equiv)
               (equal (sparseint$-truncate width x)
                      (sparseint$-truncate width-equiv x)))
      :rule-classes :congruence)

    Theorem: sparseint$-truncate-of-sparseint$-fix-x

    (defthm sparseint$-truncate-of-sparseint$-fix-x
      (equal (sparseint$-truncate width (sparseint$-fix x))
             (sparseint$-truncate width x)))

    Theorem: sparseint$-truncate-sparseint$-equiv-congruence-on-x

    (defthm sparseint$-truncate-sparseint$-equiv-congruence-on-x
      (implies (sparseint$-equiv x x-equiv)
               (equal (sparseint$-truncate width x)
                      (sparseint$-truncate width x-equiv)))
      :rule-classes :congruence)