proposition: Fact ra_minus_rel v e : ⟦ra_minus⟧ v e <-> e = vec_pos v pos0 - vec_pos v pos1.
proof: Proof. vec split v with n; vec split v with m; vec nil v. split. + intros H; apply ra_rel_fun with (1 := H), ra_minus_val. + intros; subst; apply ra_minus_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)