rcases this
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 Γ)
σ : Sentence L
h : σ ∈ T
Δ : Sequent L
this : Δ ≺[Code.id σ] ⛓️[(encode (Code.id σ)).pair 0]
hΔ : ⛓️[(encode (Code.id σ)).pair 0 + 1] = Δ
⊢ ~Rew.emb.hom σ ∈ ⛓️
case id
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 Γ)
σ : Sentence L
h hσ✝ : σ ∈ T
hΔ : ⛓️[(encode (Code.id σ)).pair 0 + 1] = ~Rew.emb.hom σ :: ⛓️[(encode (Code.id σ)).pair 0]
⊢ ~Rew.emb.hom σ ∈ ⛓️

case idRefl
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 Γ)
σ : Sentence L
h : σ ∈ T
hσ✝ : σ ∉ T
hΔ : ⛓️[(encode (Code.id σ)).pair 0 + 1] = ⛓️[(encode (Code.id σ)).pair 0]
⊢ ~Rew.emb.hom σ ∈ ⛓️