proposition: Lemma TAG_equiv_false: TAG_EVAL_pkg_ff ∘ EVAL true ≈₀ TAG false.
proof: Proof. apply: eq_rel_perf_ind_eq. simplify_eq_rel m. all: apply rpost_weaken_rule with eq; last by move=> [? ?] [? ?] []. 2: case: m => [m t]. all: simplify_linking. all: ssprove_sync_eq=> S. 1: ssprove_sync_eq. 1: case => [k|]. 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)