proposition: Lemma adv_equiv_sym : ∀ L₀ L₁ E G₀ G₁ h₀ h₁ ε, @adv_equiv L₀ L₁ E G₀ G₁ h₀ h₁ ε → adv_equiv G₁ G₀ ε.
proof: Proof. intros L₀ L₁ E G₀ G₁ h₀ h₁ ε h. intros LA A hA hd₁ hd₀. rewrite Advantage_sym. eapply h. all: eauto. 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)