proposition: Lemma sfuneqP (f g : {sfun aT >-> rT}) : f = g <-> f =1 g.
proof: Proof. by split=> [->//|fg]; apply/val_inj/funext. Qed.
imports: HB(structures) mathcomp(all_ssreflect ssralg ssrnum ssrint interval finmap) mathcomp(mathcomp_extra boolp classical_sets functions) mathcomp(cardinality fsbigop ) signed reals ereal topology normedtype sequences real_interval esum measure lebesgue_measure numfun