rcases chainSet_axL nwf r v with (hr | hr)
L : Language
inst✝³ : (k : ℕ) → DecidableEq (L.Func k)
inst✝² : (k : ℕ) → DecidableEq (L.Rel k)
inst✝¹ : (k : ℕ) → Encodable (L.Func k)
inst✝ : (k : ℕ) → Encodable (L.Rel k)
T : Theory L
Γ : Sequent L
nwf : ¬WellFounded (SearchTree.Lt T Γ)
arity✝ : ℕ
r : L.Rel arity✝
v : Fin arity✝ → Semiterm L ℕ 0
h : rel r v ∈ ⛓️
⊢ ¬(Evalf (Model.structure T Γ) Semiterm.fvar) (rel r v)
case inl
L : Language
inst✝³ : (k : ℕ) → DecidableEq (L.Func k)
inst✝² : (k : ℕ) → DecidableEq (L.Rel k)
inst✝¹ : (k : ℕ) → Encodable (L.Func k)
inst✝ : (k : ℕ) → Encodable (L.Rel k)
T : Theory L
Γ : Sequent L
nwf : ¬WellFounded (SearchTree.Lt T Γ)
arity✝ : ℕ
r : L.Rel arity✝
v : Fin arity✝ → Semiterm L ℕ 0
h : rel r v ∈ ⛓️
hr : rel r v ∉ ⛓️
⊢ ¬(Evalf (Model.structure T Γ) Semiterm.fvar) (rel r v)

case inr
L : Language
inst✝³ : (k : ℕ) → DecidableEq (L.Func k)
inst✝² : (k : ℕ) → DecidableEq (L.Rel k)
inst✝¹ : (k : ℕ) → Encodable (L.Func k)
inst✝ : (k : ℕ) → Encodable (L.Rel k)
T : Theory L
Γ : Sequent L
nwf : ¬WellFounded (SearchTree.Lt T Γ)
arity✝ : ℕ
r : L.Rel arity✝
v : Fin arity✝ → Semiterm L ℕ 0
h : rel r v ∈ ⛓️
hr : nrel r v ∉ ⛓️
⊢ ¬(Evalf (Model.structure T Γ) Semiterm.fvar) (rel r v)