Theorem: Assignment.hasNeg_of_addPos (LeanSAT/LRAT/Assignment.lean)

State before:
assignment : Assignment
⊢ assignment.addPosAssignment.hasNegAssignment = assignment.hasNegAssignment
Tactic:
rw [hasNegAssignment, addPosAssignment]
State after:
assignment : Assignment
⊢ (match
      match assignment with
      | pos => pos
      | neg => both
      | both => both
      | unassigned => pos with
    | pos => false
    | neg => true
    | both => true
    | unassigned => false) =
    assignment.hasNegAssignment

State before:
assignment : Assignment
⊢ (match
      match assignment with
      | pos => pos
      | neg => both
      | both => both
      | unassigned => pos with
    | pos => false
    | neg => true
    | both => true
    | unassigned => false) =
    assignment.hasNegAssignment
Tactic:
cases assignment <;> simp (config := { decide := true })
State after:
no goals