proposition: Lemma ots_real_vs_rnd_equiv_true : Aux ∘ DH_real ≈₀ ots_real_vs_rnd true.
proof: Proof. eapply eq_rel_perf_ind_eq. simplify_eq_rel m. all: ssprove_code_simpl. - eapply rpost_weaken_rule. 1: eapply rreflexivity_rule. move => [a1 h1] [a2 h2] [Heqa Heqh]. intuition auto. - ssprove_sync_eq. intro count. ssprove_sync_eq. ssprove_sync_eq. move => /eqP e. subst. ssprove_sync_eq. intro a. ssprove_swap_lhs 0%N. ssprove_sync_eq. ssprove_swap_lhs 0%N. ssprove_sync_eq. ssprove_sync_eq. intro b. rewrite !otf_fto. simpl. eapply r_ret. intuition eauto. f_equal. f_equal. rewrite group_prodC. f_equal. apply expgM. Qed.
imports: Relational(OrderEnrichedCategory GenericRulesSimple) mathcomp(all_ssreflect all_algebra reals distr realsum fingroup.fingroup solvable.cyclic prime ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice seq) Mon(SPropBase) Crypt(Axioms ChoiceAsOrd SubDistr Couplings UniformDistrLemmas FreeProbProg Theta_dens RulesStateProb UniformStateProb pkg_core_definition choice_type pkg_composition pkg_rhl Package Prelude AsymScheme) Coq(Utf8) extructures(ord fset fmap) Equations(Equations)