Specification of the circuit.
We use an if. An alternative is to use logand.
Function:
(defun boolean-and-spec (x y z prime) (declare (xargs :guard (and (primep prime) (pfield::fep x prime) (pfield::fep y prime) (pfield::fep z prime)))) (declare (ignore prime)) (declare (xargs :guard (and (bitp x) (bitp y)))) (let ((__function__ 'boolean-and-spec)) (declare (ignorable __function__)) (equal z (if (and (= x 1) (= y 1)) 1 0))))
Theorem:
(defthm booleanp-of-boolean-and-spec (b* ((yes/no (boolean-and-spec x y z prime))) (booleanp yes/no)) :rule-classes :rewrite)
Theorem:
(defthm bitp-z-when-boolean-and-spec (implies (and (boolean-and-spec x y z prime) (bitp x) (bitp y)) (bitp z)))