fact: Variable (n : nat) (f : nat -> nat) (af : recalg 1) (Hf : forall v e, ⟦af⟧ v e <-> e = f (vec_head v)) (Haf : prim_rec af).
imports: Arith List Lia Undecidability.Shared.Libs.DLW(utils_tac utils_nat utils_list gcd crt sums finite pos vec) Undecidability.MuRec.Util(recalg recomp prim_min)