next c pivot rupHints ratHints =>
by_cases performRatAdd_success : (performRatAdd f c pivot rupHints ratHints).2
. simp only [performRatAdd_success, ite_true] at incrementalChecker_success
. simp only [performRatAdd_success, ite_false] at incrementalChecker_success
case left.h_3
α : Type u_1
β : Type u_2
σ : Type u_3
inst✝² : DecidableEq α
inst✝¹ : Clause α β
inst✝ : Formula α β σ
f : σ
f_readyForRupAdd : readyForRupAdd f
f_readyForRatAdd : readyForRatAdd f
p : α → Bool
pf : p ⊨ f
action✝ : Action β α
id✝ : Nat
c✝ : β
pivot✝ : Literal α
rupHints✝ : Array Nat
ratHints✝ : Array (Nat × Array Nat)
aWellFormed : wellFormedAction (Action.addRat id✝ c✝ pivot✝ rupHints✝ ratHints✝)
incrementalChecker_success :
  (if (performRatAdd f c✝ pivot✝ rupHints✝ ratHints✝).snd = true then
        ((performRatAdd f c✝ pivot✝ rupHints✝ ratHints✝).fst, out_of_proof)
      else ((performRatAdd f c✝ pivot✝ rupHints✝ ratHints✝).fst, rup_failure)).snd =
    success
⊢ False
no goals