• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
      • Gl
      • Esim
      • Vl2014
      • Sv
        • Svex-stvs
        • Svex-decomposition-methodology
        • Sv-versus-esim
        • Svex-decomp
        • Svex-compose-dfs
        • Svex-compilation
        • Moddb
        • Svmods
          • Address
          • Wire
          • Module
          • Lhs
            • Lhs.lisp
              • Lhs-vars-normorderedp
              • Lhs-norm
              • Lhatom-normorderedp
              • Lhs-normp
              • Svex-lhsrewrite-aux
              • Lhs-concat
              • Lhs-check-masks
              • Lhrange-combine
              • Svexarr-vars-aux
              • Assigns-check-masks
              • Svex->lhs-range
              • Svex-lhs-preproc-blkrev
              • Svarlist-boundedp-badguy
              • Driverlist-rest-after-strength
              • Aliases-normorderedp
              • Lhs-rsh
              • Lhs-cons
              • Svarlist-boundedp
              • Lhs-bitproj
              • Lhs-vars
              • Driver
              • Svex-override
              • Make-simple-lhs
              • Lhssvex-range-p
              • Lhs-override
              • Lhs-first-aux
              • Lhrange-combinable-dec
              • Lhrange-bitproj
              • Lhatom
              • Driverlist-values-of-strength
              • Lhs-rest-aux
              • Lhs-rest
              • Aliases-normorderedp-aux
              • Svexarr-vars
              • Lhsarr-to-svexarr
              • Svexarr-vars-witness-aux
              • Lhbit
              • Svex-lhsrewrite
              • Svar-boundedp
                • Lhs-decomp-aux
                • Svex->lhs-bound
                • Aliases-vars-aux
                • Svexarr
                • Svexarr-vars-witness
                • Svar-set-index
                • Lhsarr
                • Lhs-override-vars
                • Lhatom-eval-zero
                • Lhatom-bitproj
                • Lhrange-nextbit
                • Lhrange-combinable
                • Driverlist->svex
                • Svexlist-resolve
                • Lhs->svex-zero
                • Lhs-overridelist-vars
                • Lhs-overridelist-keys
                • Lhbit-eval
                • Driverlist-vars
                • Assigns-vars
                • Svex-int
                • Lhssvex-bounded-p
                • Lhslist-vars
                • Lhs-decomp
                • Lhatom-vars
                • Svar-map-vars
                • Lhssvex-unbounded-p
                • Lhspairs-vars
                • Lhs-width
                • Aliases-vars
                • Lhs-first
                • Svar-index
                • Assigns
                • Svar-indexedp
                • Lhspairs
                • Svex-overridelist
                • Lhslist
                • Lhs-overridelist
                • Driverlist
                • Svex-lhs-preproc
                • Svexarr-fix
                • Lhsarr-fix
              • Lhs-p
              • Lhs-fix
              • Lhrange
              • Lhs-eval-zx
              • Lhs-equiv
              • Lhs-eval
              • Lhs->svex
            • Path
            • Svar-add-namespace
            • Design
            • Modinst
            • Lhs-add-namespace
            • Modalist
            • Path-add-namespace
            • Modname->submodnames
            • Name
            • Constraintlist-addr-p
            • Svex-alist-addr-p
            • Svar-map-addr-p
            • Lhspairs-addr-p
            • Modname
            • Assigns-addr-p
            • Lhs-addr-p
            • Lhatom-addr-p
            • Modhier-list-measure
            • Attributes
            • Modhier-measure
            • Modhier-list-measure-aux
            • Modhier-loopfreelist-p
            • Modhier-loopfree-p
          • Svstmt
          • Sv-tutorial
          • Expressions
          • Symbolic-test-vector
          • Vl-to-svex
        • Fgl
        • Vwsim
        • Vl
        • X86isa
        • Svl
        • Rtl
      • Software-verification
      • Math
      • Testing-utilities
    • Lhs.lisp

    Svar-boundedp

    Signature
    (svar-boundedp x bound) → *
    Arguments
    x — Guard (svar-p x).
    bound — Guard (natp bound).

    Definitions and Theorems

    Function: svar-boundedp

    (defun svar-boundedp (x bound)
      (declare (xargs :guard (and (svar-p x) (natp bound))))
      (let ((__function__ 'svar-boundedp))
        (declare (ignorable __function__))
        (and (svar-indexedp x)
             (b* ((i (svar-index x)))
               (< i (lnfix bound))))))

    Theorem: svar-boundedp-of-svar-fix-x

    (defthm svar-boundedp-of-svar-fix-x
      (equal (svar-boundedp (svar-fix x) bound)
             (svar-boundedp x bound)))

    Theorem: svar-boundedp-svar-equiv-congruence-on-x

    (defthm svar-boundedp-svar-equiv-congruence-on-x
      (implies (svar-equiv x x-equiv)
               (equal (svar-boundedp x bound)
                      (svar-boundedp x-equiv bound)))
      :rule-classes :congruence)

    Theorem: svar-boundedp-of-nfix-bound

    (defthm svar-boundedp-of-nfix-bound
      (equal (svar-boundedp x (nfix bound))
             (svar-boundedp x bound)))

    Theorem: svar-boundedp-nat-equiv-congruence-on-bound

    (defthm svar-boundedp-nat-equiv-congruence-on-bound
      (implies (nat-equiv bound bound-equiv)
               (equal (svar-boundedp x bound)
                      (svar-boundedp x bound-equiv)))
      :rule-classes :congruence)

    Theorem: svar-boundedp-of-greater

    (defthm svar-boundedp-of-greater
      (implies (and (svar-boundedp x bound1)
                    (<= (nfix bound1) (nfix bound2)))
               (svar-boundedp x bound2)))

    Theorem: svar-boundedp-implies-svar-indexedp

    (defthm svar-boundedp-implies-svar-indexedp
      (implies (svar-boundedp x bound)
               (and (svar-indexedp x)
                    (< (svar-index x) (nfix bound))
                    (implies (natp bound)
                             (< (svar-index x) (nfix bound)))))
      :rule-classes :forward-chaining)

    Theorem: svar-boundedp-of-svar-set-index

    (defthm svar-boundedp-of-svar-set-index
      (iff (svar-boundedp (svar-set-index x idx)
                          bound)
           (< (nfix idx) (nfix bound))))