Theorem: beq_as_aig (LeanSAT/AIG/CachedGatesLemmas.lean)

State before:
a b : Bool
⊢ (!(a && !b) && !(!a && b)) = (a == b)
Tactic:
cases a <;> cases b <;> decide
State after:
no goals