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