proposition: Lemma to_sem_jdg : ∀ {A B : choiceType} pre (post : postcond A B) p q, ⊢ ⦃ pre ⦄ p ≈ q ⦃ post ⦄ → r⊨ ⦃ pre ⦄ p ≈ q ⦃ post ⦄.
proof: Proof. intros A B pre post p q [h]. rewrite -lock in h. exact h. 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)