simp [RankedAlphabet.lift] at h
case h
Γ : 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
val✝ : Nat
h : val✝ < RankedAlphabet.rank (RankedAlphabet.lift Γ) none
⊢ (nomatch { val := val✝, isLt := h }) = w { val := val✝, isLt := h }
case h
Γ : 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
val✝ : Nat
h : val✝ < 0
⊢ (nomatch { val := val✝, isLt := h }) = w { val := val✝, isLt := h }