proposition: Lemma CCA_EVAL_equiv_true: CCA_EVAL true ≈₀ CCA_EVAL_TAG_pkg_tt ∘ TAG true.
proof: Proof. apply: eq_rel_perf_ind_eq. simplify_eq_rel m. all: apply rpost_weaken_rule with eq; last by move=> [? ?] [? ?] []. all: simplify_linking. all: ssprove_code_simpl. all: ssprove_code_simpl. all: by apply: rreflexivity_rule. Qed.
imports: Relational(OrderEnrichedCategory GenericRulesSimple) mathcomp(all_ssreflect all_algebra reals distr realsum ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice seq) Mon(SPropBase) Crypt(Axioms ChoiceAsOrd SubDistr Couplings UniformDistrLemmas FreeProbProg Theta_dens RulesStateProb pkg_core_definition choice_type pkg_composition pkg_rhl Package Prelude) extructures(ord fset fmap) Equations(Equations)