• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
      • Gl
      • Witness-cp
      • Ccg
      • Install-not-normalized
      • Rewrite$
      • Fgl
        • Fgl-rewrite-rules
        • Fgl-function-mode
        • Fgl-object
        • Fgl-solving
        • Fgl-handling-if-then-elses
        • Fgl-getting-bits-from-objects
        • Fgl-primitive-and-meta-rules
        • Fgl-counterexamples
        • Fgl-interpreter-overview
        • Fgl-correctness-of-binding-free-variables
        • Fgl-debugging
        • Fgl-testbenches
        • Def-fgl-boolean-constraint
        • Fgl-stack
        • Fgl-rewrite-tracing
        • Def-fgl-param-thm
        • Def-fgl-thm
        • Fgl-fast-alist-support
        • Fgl-array-support
        • Advanced-equivalence-checking-with-fgl
        • Fgl-fty-support
        • Fgl-internals
          • Symbolic-arithmetic
          • Bfr
            • Bfr-eval
            • Bfrstate
              • Bfrstate-fix
              • Bfrstate-p
              • Bfrstate->mode
              • Bfrstate->bound
              • Bfr->aignet-lit
              • Bfr-p
              • Bounded-lit-fix
              • Bfr-list-fix
              • Aignet-lit->bfr
              • Variable-g-bindings
              • Bfr-listp$
              • Bfrstate>=
              • Bfr-listp-witness
              • Fgl-object-bindings-bfrlist
              • Bfr-set-var
              • Bfr-negate
              • Bfr-fix
              • Fgl-bfr-object-bindings-p
              • Bfr-mode
              • Bfr-mode-is
              • Lbfr-case
              • Bfrstate-case
              • Bfrstate-mode-is
              • Lbfr-mode-is
              • Bfr-mode-p
            • Fgl-interpreter-state
        • Removable-runes
        • Efficiency
        • Rewrite-bounds
        • Bash
        • Def-dag-measure
        • Bdd
        • Remove-hyps
        • Contextual-rewriting
        • Simp
        • Rewrite$-hyps
        • Bash-term-to-dnf
        • Use-trivial-ancestors-check
        • Minimal-runes
        • Clause-processor-tools
        • Fn-is-body
        • Without-subsumption
        • Rewrite-equiv-hint
        • Def-bounds
        • Rewrite$-context
        • Try-gl-concls
        • Hint-utils
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Bfrstate

    Bfrstate->bound

    Access the node index bound field of a bfrstate object.

    Signature
    (bfrstate->bound x) → bound
    Arguments
    x — Guard (bfrstate-p x).
    Returns
    bound — Type (natp bound).

    Definitions and Theorems

    Function: bfrstate->bound$inline

    (defun bfrstate->bound$inline (x)
      (declare (xargs :guard (bfrstate-p x)))
      (let ((__function__ 'bfrstate->bound))
        (declare (ignorable __function__))
        (ash (bfrstate-fix x) -2)))

    Theorem: natp-of-bfrstate->bound

    (defthm natp-of-bfrstate->bound
      (b* ((bound (bfrstate->bound$inline x)))
        (natp bound))
      :rule-classes :type-prescription)

    Theorem: bfrstate->bound-of-bfrstate

    (defthm bfrstate->bound-of-bfrstate
      (equal (bfrstate->bound (bfrstate mode bound))
             (nfix bound)))

    Theorem: bfrstate->bound$inline-of-bfrstate-fix-x

    (defthm bfrstate->bound$inline-of-bfrstate-fix-x
      (equal (bfrstate->bound$inline (bfrstate-fix x))
             (bfrstate->bound$inline x)))

    Theorem: bfrstate->bound$inline-bfrstate-equiv-congruence-on-x

    (defthm bfrstate->bound$inline-bfrstate-equiv-congruence-on-x
      (implies (bfrstate-equiv x x-equiv)
               (equal (bfrstate->bound$inline x)
                      (bfrstate->bound$inline x-equiv)))
      :rule-classes :congruence)