fact: Definition eq_up_to_inv (E : Interface) (I : precond) (p₀ p₁ : raw_package) := ∀ (id : ident) (S T : choice_type) (x : S), (id, (S, T)) \in E → ⊢ ⦃ λ '(s₀, s₁), I (s₀, s₁) ⦄ get_op_default p₀ (id, (S, T)) x ≈ get_op_default p₁ (id, (S, T)) x ⦃ λ '(b₀, s₀) '(b₁, s₁), b₀ = b₁ ∧ I (s₀, s₁) ⦄.
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)