proposition: Fact sss_compute_fun P st1 st2 st3 : out_code (fst st2) P -> out_code (fst st3) P -> P // st1 ->> st2 -> P // st1 ->> st3 -> st2 = st3.
proof: Proof. Proof using sss_fun. intros ? ? (a & H1) (b & H2). revert H1 H2; apply sss_steps_stop_fun; auto. Qed.
imports: List Arith Lia Undecidability.Shared.Libs.DLW(Utils.utils Code.subcode)