exact this.of_eq <| fun f ⟨t₁, t₂⟩ => by
  simp[funcL]
  funext i; cases i using Fin.cases <;> simp
L : Language
μ : Type v
α : Type u_1
inst✝³ : Primcodable α
inst✝² : Primcodable μ
inst✝¹ : (k : ℕ) → Primcodable (L.Func k)
inst✝ : UniformlyPrimcodable L.Func
n : ℕ
this : Primrec₂ fun f t => funcL ⟨2, f⟩ [t.1, t.2]
⊢ Primrec₂ fun a b => some (func a ![b.1, b.2])
no goals