rintro ⟨s, Δ, a⟩
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 Γ)
A : Acc (SearchTree.Lt T Γ) ⊤
⊢ ∀ (a : SearchTree T Γ), Acc (SearchTree.Lt T Γ) a
case mk.mk
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 Γ)
A : Acc (SearchTree.Lt T Γ) ⊤
s : ℕ
Δ : Sequent L
a : SearchTreeAux T Γ s Δ
⊢ Acc (SearchTree.Lt T Γ) ⟨s, ⟨Δ, a⟩⟩