• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
      • Gl
        • Term-level-reasoning
        • Glmc
        • Other-resources
        • Optimization
        • Reference
          • Def-gl-thm
          • Shape-specs
          • Symbolic-objects
          • Gl-aside
          • Def-gl-param-thm
          • Symbolic-arithmetic
          • Bfr
          • Def-gl-boolean-constraint
          • Gl-mbe
          • Bvec
            • Scdr
            • Bfr-list->s
            • Bfr-eval-list
            • Bfr-scons
            • Bfr-ucons
              • Bfr-list->u
              • Bfr-sterm
              • Bfr-snorm
              • Pbfr-list-depends-on
              • V2i
              • N2v
              • V2n
              • S-endp
              • I2v
              • First/rest/end
              • Bool->sign
            • Flex-bindings
            • Auto-bindings
            • Gl-interp
            • Gl-set-uninterpreted
            • Def-gl-clause-processor
            • Def-glcp-ctrex-rewrite
            • ACL2::always-equal
            • Gl-hint
            • Def-gl-rewrite
            • Def-gl-branch-merge
            • Gl-force-check
            • Gl-concretize
            • Gl-assert
            • Gl-param-thm
            • Gl-simplify-satlink-mode
            • Gl-satlink-mode
            • Gl-bdd-mode
            • Gl-aig-bddify-mode
            • Gl-fraig-satlink-mode
          • Debugging
          • Basic-tutorial
        • Witness-cp
        • Ccg
        • Install-not-normalized
        • Rewrite$
        • Fgl
        • 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
    • Bvec

    Bfr-ucons

    Like logcons for unsigned bvecs.

    Signature
    (bfr-ucons b x) → new-x
    Arguments
    x — Guard (true-listp x).
    Returns
    new-x — Type (true-listp new-x).

    Definitions and Theorems

    Function: bfr-ucons

    (defun bfr-ucons (b x)
      (declare (xargs :guard (true-listp x)))
      (let ((__function__ 'bfr-ucons))
        (declare (ignorable __function__))
        (if (and (atom x) (not b))
            nil
          (cons b (llist-fix x)))))

    Theorem: true-listp-of-bfr-ucons

    (defthm true-listp-of-bfr-ucons
      (b* ((new-x (bfr-ucons b x)))
        (true-listp new-x))
      :rule-classes :type-prescription)

    Theorem: bfr-list->u-of-bfr-ucons

    (defthm bfr-list->u-of-bfr-ucons
      (equal (bfr-list->u (bfr-ucons b x) env)
             (logcons (bool->bit (bfr-eval b env))
                      (bfr-list->u x env))))

    Theorem: pbfr-list-depends-on-of-bfr-ucons

    (defthm pbfr-list-depends-on-of-bfr-ucons
      (implies (and (not (pbfr-depends-on k p b))
                    (not (pbfr-list-depends-on k p x)))
               (not (pbfr-list-depends-on k p (bfr-ucons b x)))))

    Theorem: bfr-ucons-of-list-fix

    (defthm bfr-ucons-of-list-fix
      (equal (bfr-ucons b (list-fix x))
             (bfr-ucons b x)))