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

State before:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.BinaryInput
⊢ ⟦aig.mkOrCached input, assign⟧ =
    (⟦{ aig := aig, ref := input.lhs }, assign⟧ || ⟦{ aig := aig, ref := input.rhs }, assign⟧)
Tactic:
rw [← or_as_aig]
State after:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.BinaryInput
⊢ ⟦aig.mkOrCached input, assign⟧ =
    !(!⟦{ aig := aig, ref := input.lhs }, assign⟧ && !⟦{ aig := aig, ref := input.rhs }, assign⟧)

State before:
α : Type
inst✝² : BEq α
inst✝¹ : Hashable α
inst✝ : DecidableEq α
assign : α → Bool
aig : AIG α
input : aig.BinaryInput
⊢ ⟦aig.mkOrCached input, assign⟧ =
    !(!⟦{ aig := aig, ref := input.lhs }, assign⟧ && !⟦{ aig := aig, ref := input.rhs }, assign⟧)
Tactic:
simp [mkOrCached, LawfulOperator.denote_input_entry (f := mkConstCached)]
State after:
no goals