proposition: Fact ra_cst_n_rel n x v e : ⟦ra_cst_n n x⟧ v e <-> e = x.
proof: Proof. split. + intros H; apply ra_rel_fun with (1 := H), ra_cst_n_val. + intro; subst; apply ra_cst_n_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)