proposition: Lemma eq_rel_perf_ind : ∀ {L₀ L₁ E} (p₀ p₁ : raw_package) (inv : precond) `{ValidPackage L₀ Game_import E p₀} `{ValidPackage L₁ Game_import E p₁}, Invariant L₀ L₁ inv → eq_up_to_inv E inv p₀ p₁ → p₀ ≈₀ p₁.
proof: Proof. intros L₀ L₁ E p₀ p₁ inv v₀ v₁ [? ?] he. intros LA A vA hd₀ hd₁. eapply eq_upto_inv_perf_ind. 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 pkg_advantage pkg_invariants pkg_distr) Equations.Prop.DepElim Equations(Equations) Crypt(FreeProbProg)