exact this.of_eq (fun p => by
  simp[Function.comp]
  induction p <;> simp[elim, *]
  { simp[List.sup_ofFn] }
  { simp[List.sup_ofFn] })
L : Language
μ : Type v
inst✝⁴ : (k : ℕ) → Primcodable (L.Func k)
inst✝³ : (k : ℕ) → Primcodable (L.Rel k)
inst✝² : UniformlyPrimcodable L.Func
inst✝¹ : UniformlyPrimcodable L.Rel
inst✝ : Primcodable μ
hr : Primrec fun p => (List.map UTerm.bv (List.ofFn p.snd.2)).sup
hb : Primrec₂ fun m n => max m n
hq : Primrec fun n => n.pred
this :
  Primrec
    (elim 0 0 (fun {k} f v => (List.map UTerm.bv (List.ofFn ⟨k, (f, v)⟩.snd.2)).sup)
      (fun {k} f v => (List.map UTerm.bv (List.ofFn ⟨k, (f, v)⟩.snd.2)).sup) (fun m n => max m n) (fun m n => max m n)
      (fun n => n.pred) fun n => n.pred)
⊢ Primrec bv
no goals