contradiction
case h
Γ : Type
inst✝ : Alphabet Γ
w : (stringAlgebra Γ).carrier⋆RankedAlphabet.rank (RankedAlphabet.lift Γ) none
val✝ : Nat
h : val✝ < 0
⊢ (nomatch { val := val✝, isLt := h }) = treeₑ (w { val := val✝, isLt := h })
no goals