-- Mathlib/.lake/packages/lean4/src/lean/Std/Tactic/BVDecide/LRAT/Internal/Formula/RatAddResult.lean
theorem clear_insertRat {n : Nat} (f : DefaultFormula n)
    (hf : f.ratUnits = #[] ∧ f.assignments.size = n) (units : CNF.Clause (PosFin n)) :
    clearRatUnits (f.insertRatUnits units).1 = f

Proof state:
case assignments
n : Nat
f : DefaultFormula n
hf : f.ratUnits = #[] ∧ f.assignments.size = n
units : CNF.Clause (PosFin n)
⊢ Array.foldl clearUnit (f.insertRatUnits units).1.assignments (f.insertRatUnits units).1.ratUnits = f.assignments

Tactic:
let motive := ClearInsertInductionMotive f hf.2 (insertRatUnits f units).1.ratUnits

Result:
case assignments
n : Nat
f : DefaultFormula n
hf : f.ratUnits = #[] ∧ f.assignments.size = n
units : CNF.Clause (PosFin n)
motive : Nat → Array Assignment → Prop := f.ClearInsertInductionMotive ⋯ (f.insertRatUnits units).fst.ratUnits
⊢ Array.foldl clearUnit (f.insertRatUnits units).1.assignments (f.insertRatUnits units).1.ratUnits = f.assignments

Proof state:
case assignments.intro.h₂.inr.inl
n : Nat
f : DefaultFormula n
hf : f.ratUnits = #[] ∧ f.assignments.size = n
units : CNF.Clause (PosFin n)
motive : Nat → Array Assignment → Prop := f.ClearInsertInductionMotive ⋯ (f.insertRatUnits units).fst.ratUnits
h_base : motive 0 (f.insertRatUnits units).fst.assignments
h_inductive :
  ∀ (idx : Fin (f.insertRatUnits units).fst.ratUnits.size) (assignments : Array Assignment),
    motive (↑idx) assignments → motive (↑idx + 1) (clearUnit assignments (f.insertRatUnits units).fst.ratUnits[idx])
h_size : (Array.foldl clearUnit (f.insertRatUnits units).fst.assignments (f.insertRatUnits units).fst.ratUnits).size = n
i : Nat
hi1 : i < (Array.foldl clearUnit (f.insertRatUnits units).1.assignments (f.insertRatUnits units).1.ratUnits).size
hi2 : i < f.assignments.size
i_lt_n : i < n
h :
  ∃ j b i_gt_zero,
    ↑j ≥ (f.insertRatUnits units).fst.ratUnits.size ∧
      (f.insertRatUnits units).fst.ratUnits[j] = (⟨↑⟨i, i_lt_n⟩, ⋯⟩, b) ∧
        (Array.foldl clearUnit (f.insertRatUnits units).fst.assignments
                (f.insertRatUnits units).fst.ratUnits)[↑⟨i, i_lt_n⟩] =
            addAssignment b f.assignments[↑⟨i, i_lt_n⟩] ∧
          ¬hasAssignment b f.assignments[↑⟨i, i_lt_n⟩] = true ∧
            ∀ (k : Fin (f.insertRatUnits units).fst.ratUnits.size),
              ↑k ≥ (f.insertRatUnits units).fst.ratUnits.size →
                k ≠ j → (f.insertRatUnits units).fst.ratUnits[k].fst.val ≠ ↑⟨i, i_lt_n⟩
⊢ (Array.foldl clearUnit (f.insertRatUnits units).1.assignments (f.insertRatUnits units).1.ratUnits)[i] =
    f.assignments[i]

Tactic:
omega

Result:
no goals

Proof state:
case assignments
n : Nat
f : DefaultFormula n
hf : f.ratUnits = #[] ∧ f.assignments.size = n
units : CNF.Clause (PosFin n)
⊢ { clauses := (f.insertRatUnits units).1.clauses, rupUnits := (f.insertRatUnits units).1.rupUnits, ratUnits := #[],
        assignments :=
          Array.foldl clearUnit (f.insertRatUnits units).1.assignments
            (f.insertRatUnits units).1.ratUnits }.assignments =
    f.assignments

Tactic:
simp only

Result:
case assignments
n : Nat
f : DefaultFormula n
hf : f.ratUnits = #[] ∧ f.assignments.size = n
units : CNF.Clause (PosFin n)
⊢ Array.foldl clearUnit (f.insertRatUnits units).1.assignments (f.insertRatUnits units).1.ratUnits = f.assignments