And of bitps, complementing the second.
Function:
(defun b-andc2$inline (i j) (declare (xargs :guard (and (bitp i) (bitp j)))) (let ((__function__ 'b-andc2)) (declare (ignorable __function__)) (mbe :logic (if (zbp i) 0 (if (zbp j) 1 0)) :exec (the (unsigned-byte 1) (logandc2 (the (unsigned-byte 1) i) (the (unsigned-byte 1) j))))))
Theorem:
(defthm bitp-of-b-andc2 (b* ((bit (b-andc2$inline i j))) (bitp bit)) :rule-classes :type-prescription)