		Search-engine friendly clone of the ACL2 documentation.

Bfr-andc1

(bfr-andc1 x y) constructs the ANDC1 of these BFRs.

Signature
(bfr-andc1 x y) → *

Definitions and Theorems

Function: bfr-andc1

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

Theorem: bfr-eval-bfr-andc1

(defthm bfr-eval-bfr-andc1
  (equal (bfr-eval (bfr-andc1 x y) env)
         (and (not (bfr-eval x env))
              (bfr-eval y env))))

Theorem: bfr-equiv-implies-bfr-equiv-bfr-andc1-1

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

Theorem: bfr-equiv-implies-bfr-equiv-bfr-andc1-2

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