{ funext i; congr }
case pos
L : Language
μ : Type v
inst✝² : Primcodable μ
inst✝¹ : (k : ℕ) → Primcodable (L.Func k)
inst✝ : UniformlyPrimcodable L.Func
this✝ : Primrec₂ fun a l => Option.map (⇑(equivW L μ).symm) (WType.mkL a (List.map (⇑(equivW L μ)) l))
this :
  Primrec₂ fun f l => Option.map (⇑(equivW L μ).symm) (WType.mkL (Sum.inr (Sum.inr f)) (List.map (⇑(equivW L μ)) l))
x✝ : (k : ℕ) × L.Func k
l : List (UTerm L μ)
k : ℕ
f : L.Func k
hl : l.length = k
⊢ (fun i => l.get ⟨↑i, ⋯⟩) = fun i => l.get (Fin.cast ⋯ i)
no goals