proposition: Lemma Reduction : ∀ (M : raw_package) (G : GamePair) A b, `| Pr (A ∘ (M ∘ (G b))) true | = `| Pr ((A ∘ M) ∘ (G b)) true |.
proof: Proof. intros M G A b. rewrite link_assoc. reflexivity. Qed.
imports: Coq(Utf8) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) mathcomp(ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice reals distr seq all_algebra fintype realsum) extructures(ord fset fmap) Mon(SPropBase) Crypt(Prelude Axioms ChoiceAsOrd SubDistr Couplings RulesStateProb UniformStateProb UniformDistrLemmas StateTransfThetaDens StateTransformingLaxMorph choice_type pkg_core_definition pkg_notation pkg_tactics pkg_composition pkg_heap pkg_semantics pkg_lookup) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)