proposition: Fact ra_decomp_lr_val n : ⟦ra_decomp_l⟧ (n##vec_nil) (decomp_l n) /\ ⟦ra_decomp_r⟧ (n##vec_nil) (decomp_r n).
proof: Proof. destruct (ra_decomp_r_rel n) as (b & H1 & a & H2 & H3). rewrite (decomp_lr_spec n) in H3. apply decomp_uniq in H3; destruct H3; subst a b; auto. Qed.
imports: Arith Lia Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_nat gcd crt sums) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.MuRec.Util(recalg recomp prim_min ra_utils)