Lemmas about lognot from the logops-lemmas book.
Theorem:
(defthm lognot-lognot (implies (case-split (integerp i)) (equal (lognot (lognot i)) i)))
Theorem:
(defthm cancel-equal-lognot (equal (equal (lognot i) (lognot j)) (equal (ifix i) (ifix j))) :rule-classes ((:rewrite) (:rewrite :corollary (implies (and (syntaxp (constant-syntaxp j)) (integerp j)) (equal (equal (lognot i) j) (equal (ifix i) (lognot j)))))))