have : Primrec (fun x => ((WType.inversion (equivW L μ x)).1, (WType.inversion (equivW L μ x)).2.map (equivW L μ).symm)) :=
  Primrec₂.pair.comp (fst.comp $ w_inversion.comp of_equiv)
  <| list_map (snd.comp $ w_inversion.comp of_equiv) (of_equiv_symm.comp₂ Primrec₂.right)
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 μ
⊢ Primrec inversion
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 μ
this : Primrec fun x => (((equivW L μ) x).inversion.1, List.map (⇑(equivW L μ).symm) ((equivW L μ) x).inversion.2)
⊢ Primrec inversion