proposition: Lemma equal_f : forall {A B : Type} {f g : A -> B}, f = g -> forall x, f x = g x.
proof: Proof. intros. rewrite H. auto. Qed.
imports: Coq(Relation_Definitions Morphisms) Relational(OrderEnrichedCategory OrderEnrichedRelativeMonadExamples) Mon(SPropBase) mathcomp(all_ssreflect boolp)