Theorem: LO.FirstOrder.Semiterm.funcL_primrec' (Logic/FirstOrder/Computability/Term.lean)

State before:
L : Language
μ : Type v
α : Type u_1
inst✝³ : Primcodable α
inst✝² : Primcodable μ
inst✝¹ : (k : ℕ) → Primcodable (L.Func k)
inst✝ : UniformlyPrimcodable L.Func
n k : ℕ
⊢ ∀ (a : L.Func k) (b : List (Semiterm L μ n)), funcL ⟨k, a⟩ b = funcL ⟨k, a⟩ b
Tactic:
simp[funcL]
State after:
no goals