simp only [Bool.not_eq_true] at performRupAdd_success
case neg
α : Type u_1
β : Type u_2
σ : Type u_3
inst✝² : DecidableEq α
inst✝¹ : Clause α β
inst✝ : Formula α β σ
f : σ
f_readyForRupAdd : readyForRupAdd f
f_readyForRatAdd : readyForRatAdd f
action✝ : Action β α
id✝ : Nat
c : β
rupHints : Array Nat
aWellFormed : wellFormedAction (Action.addRup id✝ c rupHints)
incrementalChecker_res_unsat : unsatisfiable α (incrementalLRATChecker f (Action.addRup id✝ c rupHints)).fst
incrementalChecker_res :
  (if (performRupAdd f c rupHints).snd = true then ((performRupAdd f c rupHints).fst, out_of_proof)
      else ((performRupAdd f c rupHints).fst, rup_failure)).snd =
    out_of_proof
performRupAdd_success : ¬(performRupAdd f c rupHints).snd = true
⊢ unsatisfiable α f
case neg
α : Type u_1
β : Type u_2
σ : Type u_3
inst✝² : DecidableEq α
inst✝¹ : Clause α β
inst✝ : Formula α β σ
f : σ
f_readyForRupAdd : readyForRupAdd f
f_readyForRatAdd : readyForRatAdd f
action✝ : Action β α
id✝ : Nat
c : β
rupHints : Array Nat
aWellFormed : wellFormedAction (Action.addRup id✝ c rupHints)
incrementalChecker_res_unsat : unsatisfiable α (incrementalLRATChecker f (Action.addRup id✝ c rupHints)).fst
incrementalChecker_res :
  (if (performRupAdd f c rupHints).snd = true then ((performRupAdd f c rupHints).fst, out_of_proof)
      else ((performRupAdd f c rupHints).fst, rup_failure)).snd =
    out_of_proof
performRupAdd_success : (performRupAdd f c rupHints).snd = false
⊢ unsatisfiable α f