case and => rw[fintypeEquivFin_symm_zero, fintypeEquivFin_symm_one]; simp
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)
a✝¹ a✝ : UFormula L μ
⊢ (equivW L μ).symm (Bool.rec ((equivW L μ) a✝¹) ((equivW L μ) a✝) (fintypeEquivFin.symm 0)) = a✝¹ ∧
    (equivW L μ).symm (Bool.rec ((equivW L μ) a✝¹) ((equivW L μ) a✝) (fintypeEquivFin.symm 1)) = a✝
no goals