proposition: Fact ra_prim_min_rel v e : ⟦ra_prim_min⟧ v e <-> e = prim_min (f (vec_tail v)) (vec_head v).
proof: Proof. Proof using Hf. vec split v with a. split. + intros H; apply ra_rel_fun with (1 := H), ra_prim_min_val. + intros; subst; apply ra_prim_min_val. Qed.
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)