Theorem: LRAT.DefaultFormula.performRatCheck_preserves_formula
Proof state before:
n : Nat
f : DefaultFormula n
hf : f.ratUnits = #[] ∧ f.assignments.size = n
p : Literal (PosFin n)
ratHint : Nat × Array Nat
⊢ (match f.clauses[ratHint.fst]! with
      | some c =>
        if
            ({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                      assignments := f.assignments }.insertRatUnits
                  (c.delete p).negate).snd =
              true then
          (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                      assignments := f.assignments }.insertRatUnits
                  (c.delete p).negate).fst.clearRatUnits,
            true)
        else
          if
              (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c.delete p).negate).fst.performRupCheck
                          ratHint.snd).2.2.snd =
                  true ∨
                (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c.delete p).negate).fst.performRupCheck
                          ratHint.snd).2.2.fst =
                  false then
            ({
                  clauses :=
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c.delete p).negate).fst.performRupCheck
                          ratHint.snd).1.clauses,
                  rupUnits :=
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c.delete p).negate).fst.performRupCheck
                          ratHint.snd).1.rupUnits,
                  ratUnits :=
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c.delete p).negate).fst.performRupCheck
                          ratHint.snd).1.ratUnits,
                  assignments :=
                    restoreAssignments
                      (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                      assignments := f.assignments }.insertRatUnits
                                  (c.delete p).negate).fst.performRupCheck
                            ratHint.snd).1.assignments
                      (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                      assignments := f.assignments }.insertRatUnits
                                  (c.delete p).negate).fst.performRupCheck
                            ratHint.snd).2.fst }.clearRatUnits,
              false)
          else
            ({
                  clauses :=
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c.delete p).negate).fst.performRupCheck
                          ratHint.snd).1.clauses,
                  rupUnits :=
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c.delete p).negate).fst.performRupCheck
                          ratHint.snd).1.rupUnits,
                  ratUnits :=
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c.delete p).negate).fst.performRupCheck
                          ratHint.snd).1.ratUnits,
                  assignments :=
                    restoreAssignments
                      (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                      assignments := f.assignments }.insertRatUnits
                                  (c.delete p).negate).fst.performRupCheck
                            ratHint.snd).1.assignments
                      (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                      assignments := f.assignments }.insertRatUnits
                                  (c.delete p).negate).fst.performRupCheck
                            ratHint.snd).2.fst }.clearRatUnits,
              true)
      | none =>
        ({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits, assignments := f.assignments },
          false)).fst =
    f
Tactic:
split
Proof state after:
case h_1
n : Nat
f : DefaultFormula n
hf : f.ratUnits = #[] ∧ f.assignments.size = n
p : Literal (PosFin n)
ratHint : Nat × Array Nat
x✝ : Option (DefaultClause n)
c✝ : DefaultClause n
heq✝ : f.clauses[ratHint.fst]! = some c✝
⊢ (if
          ({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                    assignments := f.assignments }.insertRatUnits
                (c✝.delete p).negate).snd =
            true then
        (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                    assignments := f.assignments }.insertRatUnits
                (c✝.delete p).negate).fst.clearRatUnits,
          true)
      else
        if
            (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                  assignments := f.assignments }.insertRatUnits
                              (c✝.delete p).negate).fst.performRupCheck
                        ratHint.snd).2.2.snd =
                true ∨
              (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                  assignments := f.assignments }.insertRatUnits
                              (c✝.delete p).negate).fst.performRupCheck
                        ratHint.snd).2.2.fst =
                false then
          ({
                clauses :=
                  (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                  assignments := f.assignments }.insertRatUnits
                              (c✝.delete p).negate).fst.performRupCheck
                        ratHint.snd).1.clauses,
                rupUnits :=
                  (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                  assignments := f.assignments }.insertRatUnits
                              (c✝.delete p).negate).fst.performRupCheck
                        ratHint.snd).1.rupUnits,
                ratUnits :=
                  (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                  assignments := f.assignments }.insertRatUnits
                              (c✝.delete p).negate).fst.performRupCheck
                        ratHint.snd).1.ratUnits,
                assignments :=
                  restoreAssignments
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c✝.delete p).negate).fst.performRupCheck
                          ratHint.snd).1.assignments
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c✝.delete p).negate).fst.performRupCheck
                          ratHint.snd).2.fst }.clearRatUnits,
            false)
        else
          ({
                clauses :=
                  (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                  assignments := f.assignments }.insertRatUnits
                              (c✝.delete p).negate).fst.performRupCheck
                        ratHint.snd).1.clauses,
                rupUnits :=
                  (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                  assignments := f.assignments }.insertRatUnits
                              (c✝.delete p).negate).fst.performRupCheck
                        ratHint.snd).1.rupUnits,
                ratUnits :=
                  (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                  assignments := f.assignments }.insertRatUnits
                              (c✝.delete p).negate).fst.performRupCheck
                        ratHint.snd).1.ratUnits,
                assignments :=
                  restoreAssignments
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c✝.delete p).negate).fst.performRupCheck
                          ratHint.snd).1.assignments
                    (({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits,
                                    assignments := f.assignments }.insertRatUnits
                                (c✝.delete p).negate).fst.performRupCheck
                          ratHint.snd).2.fst }.clearRatUnits,
            true)).fst =
    f

case h_2
n : Nat
f : DefaultFormula n
hf : f.ratUnits = #[] ∧ f.assignments.size = n
p : Literal (PosFin n)
ratHint : Nat × Array Nat
x✝ : Option (DefaultClause n)
heq✝ : f.clauses[ratHint.fst]! = none
⊢ ({ clauses := f.clauses, rupUnits := f.rupUnits, ratUnits := f.ratUnits, assignments := f.assignments }, false).fst =
    f