proposition: Lemma dynkinU G : dynkin G -> (forall F : (set T)^nat, trivIset setT F -> (forall n, G (F n)) -> G (\bigcup_k F k)).
proof: Proof. by case. Qed.
imports: mathcomp(all_ssreflect all_algebra finmap) mathcomp(mathcomp_extra boolp classical_sets functions) mathcomp(cardinality fsbigop ) reals ereal signed topology normedtype sequences esum numfun HB(structures)