Theorem: AIG.mem_def (LeanSAT/AIG/Lemmas.lean)

State before:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
aig : AIG α
a : α
⊢ (a ∈ aig) = (Decl.atom a ∈ aig.decls)
Tactic:
simp [Membership.mem, mem]
State after:
no goals