proposition: Lemma code_link_par_right : ∀ A I L L' E (v : raw_code A) p1 p2, Parable p1 p2 → ValidCode L E v → ValidPackage L' I E p2 → code_link v (par p1 p2) = code_link v p2.
proof: Proof. intros A I L L' E v p1 p2 h hv hp1. rewrite par_commut. eapply code_link_par_left. all: eauto. Qed.
imports: Coq(Utf8) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) mathcomp(ssreflect eqtype choice seq ssrfun ssrbool ssrnat) extructures(ord fset fmap) Mon(SPropBase) Crypt(Prelude Axioms ChoiceAsOrd StateTransformingLaxMorph choice_type pkg_core_definition RulesStateProb) Equations(Equations)