proposition: Lemma GEN_equiv_true: GEN true ≈₀ GEN_HYB_pkg 0.
proof: Proof. apply eq_rel_perf_ind_ignore with (fset [:: count_loc]). 1: by rewrite -fset1E /GEN_HYB_locs fsub1set !fset_cons !in_fsetU !in_fset1 eq_refl !Bool.orb_true_r. simplify_eq_rel m. apply: r_get_remember_rhs => count. apply: r_put_rhs. ssprove_sync=> s. ssprove_restore_mem; last by apply: r_ret. by ssprove_invariant. 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)