proposition: Lemma SHARE_equiv: SHARE true ≈₀ SHARE false.
proof: Proof. apply: eq_rel_perf_ind_eq. simplify_eq_rel m. apply rpost_weaken_rule with eq; last by move=> [? ?] [? ?] []. case: m => [[ml mr] U]. destruct (t <= size _) eqn:Heq. 1: by apply: rreflexivity_rule. apply negbT in Heq. rewrite -ltnNge ltnS in Heq. apply: r_uniform_bij => [|q]. 1: { apply: (bij_share_bij (domm U) ml mr) => //. by apply: uniq_fset. } rewrite sec_share_bij ?uniq_fset //. 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)