-- Mathlib/.lake/packages/lean4/src/lean/Std/Tactic/BVDecide/LRAT/Internal/Formula/Lemmas.lean
theorem insert_iff {n : Nat} (f : DefaultFormula n) (c1 : DefaultClause n) (c2 : DefaultClause n) :
    c2 ∈ toList (insert f c1) ↔ c2 = c1 ∨ c2 ∈ toList f

Proof state:
case mp.h.inr.inl
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_ne_c1 : ¬c2 = c1
h : ∃ a, (a, false) ∈ f.rupUnits.toList ∧ unit (a, false) = c2 ∨ (a, true) ∈ f.rupUnits.toList ∧ unit (a, true) = c2
⊢ some c2 ∈ f.clauses.toList ∨
    (∃ a, (a, false) ∈ f.rupUnits.toList ∧ unit (a, false) = c2 ∨ (a, true) ∈ f.rupUnits.toList ∧ unit (a, true) = c2) ∨
      ∃ a, (a, false) ∈ f.ratUnits.toList ∧ unit (a, false) = c2 ∨ (a, true) ∈ f.ratUnits.toList ∧ unit (a, true) = c2

Tactic:
exact Or.inr <| Or.inl h

Result:
no goals

Proof state:
case mp
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_eq_c1 : c2 = c1
a✝ :
  some c2 ∈ (f.insert c1).clauses.toList ∨
    (∃ a,
        (a, false) ∈ (f.insert c1).rupUnits.toList ∧ unit (a, false) = c2 ∨
          (a, true) ∈ (f.insert c1).rupUnits.toList ∧ unit (a, true) = c2) ∨
      ∃ a,
        (a, false) ∈ (f.insert c1).ratUnits.toList ∧ unit (a, false) = c2 ∨
          (a, true) ∈ (f.insert c1).ratUnits.toList ∧ unit (a, true) = c2
⊢ c2 = c1 ∨
    some c2 ∈ f.clauses.toList ∨
      (∃ a,
          (a, false) ∈ f.rupUnits.toList ∧ unit (a, false) = c2 ∨ (a, true) ∈ f.rupUnits.toList ∧ unit (a, true) = c2) ∨
        ∃ a, (a, false) ∈ f.ratUnits.toList ∧ unit (a, false) = c2 ∨ (a, true) ∈ f.ratUnits.toList ∧ unit (a, true) = c2

Tactic:
exact Or.inl c2_eq_c1

Result:
no goals

Proof state:
case mpr.h
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_eq_c1 : c2 = c1
a✝ :
  c2 = c1 ∨
    some c2 ∈ f.clauses.toList ∨
      (∃ a,
          (a, false) ∈ f.rupUnits.toList ∧ unit (a, false) = c2 ∨ (a, true) ∈ f.rupUnits.toList ∧ unit (a, true) = c2) ∨
        ∃ a, (a, false) ∈ f.ratUnits.toList ∧ unit (a, false) = c2 ∨ (a, true) ∈ f.ratUnits.toList ∧ unit (a, true) = c2
⊢ some c1 ∈
    (match c1.isUnit with
        | none =>
          { clauses := f.clauses.push (some c1), rupUnits := f.rupUnits, ratUnits := f.ratUnits,
            assignments := f.assignments }
        | some (l, true) =>
          { clauses := f.clauses.push (some c1), rupUnits := f.rupUnits, ratUnits := f.ratUnits,
            assignments := f.assignments.modify l.val addPosAssignment }
        | some (l, false) =>
          { clauses := f.clauses.push (some c1), rupUnits := f.rupUnits, ratUnits := f.ratUnits,
            assignments := f.assignments.modify l.val addNegAssignment }).clauses.toList

Tactic:
split <;> simp

Result:
no goals

Proof state:
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_eq_c1 : c2 = c1
⊢ (some c2 ∈ (f.insert c1).clauses.toList ∨
      (∃ a,
          (a, false) ∈ (f.insert c1).rupUnits.toList ∧ unit (a, false) = c2 ∨
            (a, true) ∈ (f.insert c1).rupUnits.toList ∧ unit (a, true) = c2) ∨
        ∃ a,
          (a, false) ∈ (f.insert c1).ratUnits.toList ∧ unit (a, false) = c2 ∨
            (a, true) ∈ (f.insert c1).ratUnits.toList ∧ unit (a, true) = c2) ↔
    c2 = c1 ∨
      some c2 ∈ f.clauses.toList ∨
        (∃ a,
            (a, false) ∈ f.rupUnits.toList ∧ unit (a, false) = c2 ∨
              (a, true) ∈ f.rupUnits.toList ∧ unit (a, true) = c2) ∨
          ∃ a,
            (a, false) ∈ f.ratUnits.toList ∧ unit (a, false) = c2 ∨ (a, true) ∈ f.ratUnits.toList ∧ unit (a, true) = c2

Tactic:
constructor

Result:
case mp
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_eq_c1 : c2 = c1
⊢ (some c2 ∈ (f.insert c1).clauses.toList ∨
      (∃ a,
          (a, false) ∈ (f.insert c1).rupUnits.toList ∧ unit (a, false) = c2 ∨
            (a, true) ∈ (f.insert c1).rupUnits.toList ∧ unit (a, true) = c2) ∨
        ∃ a,
          (a, false) ∈ (f.insert c1).ratUnits.toList ∧ unit (a, false) = c2 ∨
            (a, true) ∈ (f.insert c1).ratUnits.toList ∧ unit (a, true) = c2) →
    c2 = c1 ∨
      some c2 ∈ f.clauses.toList ∨
        (∃ a,
            (a, false) ∈ f.rupUnits.toList ∧ unit (a, false) = c2 ∨
              (a, true) ∈ f.rupUnits.toList ∧ unit (a, true) = c2) ∨
          ∃ a,
            (a, false) ∈ f.ratUnits.toList ∧ unit (a, false) = c2 ∨ (a, true) ∈ f.ratUnits.toList ∧ unit (a, true) = c2

case mpr
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_eq_c1 : c2 = c1
⊢ (c2 = c1 ∨
      some c2 ∈ f.clauses.toList ∨
        (∃ a,
            (a, false) ∈ f.rupUnits.toList ∧ unit (a, false) = c2 ∨
              (a, true) ∈ f.rupUnits.toList ∧ unit (a, true) = c2) ∨
          ∃ a,
            (a, false) ∈ f.ratUnits.toList ∧ unit (a, false) = c2 ∨
              (a, true) ∈ f.ratUnits.toList ∧ unit (a, true) = c2) →
    some c2 ∈ (f.insert c1).clauses.toList ∨
      (∃ a,
          (a, false) ∈ (f.insert c1).rupUnits.toList ∧ unit (a, false) = c2 ∨
            (a, true) ∈ (f.insert c1).rupUnits.toList ∧ unit (a, true) = c2) ∨
        ∃ a,
          (a, false) ∈ (f.insert c1).ratUnits.toList ∧ unit (a, false) = c2 ∨
            (a, true) ∈ (f.insert c1).ratUnits.toList ∧ unit (a, true) = c2

Proof state:
case mp.h.inl.h
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_ne_c1 : ¬c2 = c1
h :
  some c2 ∈
    (match c1.isUnit with
        | none =>
          { clauses := f.clauses.push (some c1), rupUnits := f.rupUnits, ratUnits := f.ratUnits,
            assignments := f.assignments }
        | some (l, true) =>
          { clauses := f.clauses.push (some c1), rupUnits := f.rupUnits, ratUnits := f.ratUnits,
            assignments := f.assignments.modify l.val addPosAssignment }
        | some (l, false) =>
          { clauses := f.clauses.push (some c1), rupUnits := f.rupUnits, ratUnits := f.ratUnits,
            assignments := f.assignments.modify l.val addNegAssignment }).clauses.toList
⊢ some c2 ∈ f.clauses.toList

Tactic:
split at h

Result:
case mp.h.inl.h.h_1
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_ne_c1 : ¬c2 = c1
x✝ : Option (Literal (PosFin n))
heq✝ : c1.isUnit = none
h :
  some c2 ∈
    { clauses := f.clauses.push (some c1), rupUnits := f.rupUnits, ratUnits := f.ratUnits,
          assignments := f.assignments }.clauses.toList
⊢ some c2 ∈ f.clauses.toList

case mp.h.inl.h.h_2
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_ne_c1 : ¬c2 = c1
x✝ : Option (Literal (PosFin n))
l✝ : PosFin n
heq✝ : c1.isUnit = some (l✝, true)
h :
  some c2 ∈
    { clauses := f.clauses.push (some c1), rupUnits := f.rupUnits, ratUnits := f.ratUnits,
          assignments := f.assignments.modify l✝.val addPosAssignment }.clauses.toList
⊢ some c2 ∈ f.clauses.toList

case mp.h.inl.h.h_3
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_ne_c1 : ¬c2 = c1
x✝ : Option (Literal (PosFin n))
l✝ : PosFin n
heq✝ : c1.isUnit = some (l✝, false)
h :
  some c2 ∈
    { clauses := f.clauses.push (some c1), rupUnits := f.rupUnits, ratUnits := f.ratUnits,
          assignments := f.assignments.modify l✝.val addNegAssignment }.clauses.toList
⊢ some c2 ∈ f.clauses.toList

Proof state:
case mp.h.inl.h.h_3.inr
n : Nat
f : DefaultFormula n
c1 c2 : DefaultClause n
c2_ne_c1 : ¬c2 = c1
x✝ : Option (Literal (PosFin n))
l✝ : PosFin n
heq✝ : c1.isUnit = some (l✝, false)
h : c2 = c1
⊢ some c2 ∈ f.clauses.toList

Tactic:
exact False.elim <| c2_ne_c1 h

Result:
no goals