• 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
            • Pbfr-depends-on
            • Bfr-varname-p
            • Bfr-varname-fix
            • Bfr-to-param-space
            • Bfr-depends-on
            • Aig-var-fix
            • Bfr-reasoning
            • Bfr-andc2
            • Bfr-andc1
            • Bfr-unparam-env
            • Bfr-set-var
            • Bfr-nor
              • Bfr-nand
              • Bfr-mode
              • Bfr-equiv
              • Bfr-xor
              • Bfr-iff
              • Bfr-eval
              • Bfr-param-env
              • Bfr-lookup
              • Bfr-env-equiv
              • Bfr-and
              • Bfr-var
              • Bfr-or
              • Bfr-not
              • Bfr-ite
              • Bdd-mode-or-p-true
              • Aig-mode-or-p-true
              • Bfr-case
            • Def-gl-boolean-constraint
            • Gl-mbe
            • Bvec
            • 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
    • Bfr

    Bfr-nor

    (bfr-nor x y) constructs the NOR of these BFRs.

    Signature
    (bfr-nor x y) → *

    Definitions and Theorems

    Function: bfr-nor

    (defun bfr-nor (x y)
      (declare (xargs :guard t))
      (let ((__function__ 'bfr-nor))
        (declare (ignorable __function__))
        (mbe :logic
             (bfr-case :bdd (acl2::q-nor x y)
                       :aig (acl2::aig-nor x y))
             :exec
             (if (and (booleanp x) (booleanp y))
                 (not (or x y))
               (bfr-case :bdd (acl2::q-nor x y)
                         :aig (acl2::aig-nor x y))))))

    Theorem: bfr-eval-bfr-nor

    (defthm bfr-eval-bfr-nor
      (equal (bfr-eval (bfr-nor x y) env)
             (not (or (bfr-eval x env)
                      (bfr-eval y env)))))

    Theorem: bfr-equiv-implies-bfr-equiv-bfr-nor-1

    (defthm bfr-equiv-implies-bfr-equiv-bfr-nor-1
      (implies (bfr-equiv x x-equiv)
               (bfr-equiv (bfr-nor x y)
                          (bfr-nor x-equiv y)))
      :rule-classes (:congruence))

    Theorem: bfr-equiv-implies-bfr-equiv-bfr-nor-2

    (defthm bfr-equiv-implies-bfr-equiv-bfr-nor-2
      (implies (bfr-equiv y y-equiv)
               (bfr-equiv (bfr-nor x y)
                          (bfr-nor x y-equiv)))
      :rule-classes (:congruence))