proposition: Lemma neq_pos : ∀ (q : nat) (a b : Zp_finZmodType q), a != b → a - b != 0.
proof: Proof. intros q a b. apply contraPneq => H_eq. assert (H : (a - b == 0)). { by rewrite H_eq. } rewrite subr_eq0 in H. apply reflection_nonsense in H. rewrite H. unfold not => contra. rewrite eq_refl in contra. discriminate. 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 SigmaProtocol) Coq(Utf8) extructures(ord fset fmap) Equations(Equations)