proposition: Corollary eq_rel_perf_ind_eq : ∀ {L₀ L₁ E} (p₀ p₁ : raw_package) `{ValidPackage L₀ Game_import E p₀} `{ValidPackage L₁ Game_import E p₁}, eq_up_to_inv E (λ '(h₀, h₁), h₀ = h₁) p₀ p₁ → p₀ ≈₀ p₁.
proof: Proof. intros L₀ L₁ E p₀ p₁ v₀ v₁ h. eapply eq_rel_perf_ind with (λ '(h₀, h₁), h₀ = h₁). - exact _. - assumption. 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 pkg_advantage pkg_invariants pkg_distr) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)