simp [treeₑ, Term.algebra]
Γ : Type
inst✝ : Alphabet Γ
w : Fin (RankedAlphabet.rank (RankedAlphabet.lift Γ) none) → Term (RankedAlphabet.lift Γ) Empty
hi : ∀ (a : Fin (RankedAlphabet.rank (RankedAlphabet.lift Γ) none)), ∃ a_1, treeₑ a_1 = w a
⊢ treeₑ Word.ε = app none w
Γ : Type
inst✝ : Alphabet Γ
w : Fin (RankedAlphabet.rank (RankedAlphabet.lift Γ) none) → Term (RankedAlphabet.lift Γ) Empty
hi : ∀ (a : Fin (RankedAlphabet.rank (RankedAlphabet.lift Γ) none)), ∃ a_1, treeₑ a_1 = w a
⊢ (fun x => nomatch x) = w