case neg φ =>
  cases orule'
  case neg φ' =>
    simp_all
    subst c_in
    subst precond_eq
    if φ = φ'
    then simp_all
    else simp_all
  all_goals aesop
α : Formula
R L : Finset Formula
α_in_R : α ∈ R
c : TNode
Rcond' : Finset Formula
R_cond_in : Rcond' ⊆ R
ress : List (Finset Formula)
L_cond_in : ∅ ⊆ L
orule' : OneSidedLocalRule Rcond' ress
c_in : c ∈ applyLocalRule (LocalRule.oneSidedR orule') (L, R)
φ : Formula
precond_eq : {~~φ} = {α}
⊢ α ∈ c.2 ∨ ∃ res ∈ [{φ}], res ⊆ c.2
no goals