fact: Variable (n : nat) (f : vec nat n -> nat) (af : recalg n) (Hf : forall v, ⟦af⟧ v (f v)) (Haf : prim_rec af) (g : vec nat n -> nat -> nat) (ag : recalg (S n)) (Hg : forall i v, ⟦ag⟧ (i##v) (g v i)) (Hag : prim_rec ag).
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)