(bfr-nor x y) constructs the NOR of these BFRs.
(bfr-nor x y) → *
Function:
(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:
(defthm bfr-eval-bfr-nor (equal (bfr-eval (bfr-nor x y) env) (not (or (bfr-eval x env) (bfr-eval y env)))))
Theorem:
(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:
(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))