proposition: Lemma indic_mfun_subproof (D : set aT) (mD : measurable D) : @isMeasurableFun d aT rT (mindic mD).
proof: Proof. split=> mA /= B mB; rewrite preimage_indic. case: ifPn => B1; case: ifPn => B0 //. - by rewrite setIT. - exact: measurableI. - by apply: measurableI => //; apply: measurableC. - by rewrite setI0. 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