proposition: Lemma ra_ca_comp_inv k i f (gj : vec (recalg i) k) v n x : [ra_comp f gj;v] -[n>> x -> exists p w q, n = 1+p+vec_sum q /\ (forall j, [vec_pos gj j;v] -[vec_pos q j>> vec_pos w j) /\ [f;w] -[p>> x.
proof: Proof. myauto; ra_inj. exists q', w', m'; auto. Qed.
imports: Arith Eqdep_dec Undecidability.Shared(DLW.Utils.utils DLW.Vec.vec DLW.Vec.pos) Undecidability.MuRec.Util(recalg)