proposition: Lemma ATTACK_equiv_false: ATTACK_CTXT_pkg ∘ CTXT false ≈₀ ATTACK false.
proof: Proof. apply: eq_rel_perf_ind_eq. simplify_eq_rel m. apply rpost_weaken_rule with eq; last by move=> [? ?] [? ?] []. simplify_linking. ssprove_code_simpl. ssprove_swap_lhs 0. ssprove_swap_rhs 0. ssprove_sync_eq=> sn. rewrite (@code_link_map_loop _ 'word _ (unzip2 m) tt _) /=. simplify_linking. 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)