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