proposition: Lemma filterbase_genetated : filterbase = filtergenerated base.
proof: Proof. apply funextfun ; intros P. apply hPropUnivalence. - apply hinhfun. intros A. exists (singletonSequence (pr1 A)). split. + intros m ; simpl. exact (pr1 (pr2 A)). + intros x Ax. apply (pr2 (pr2 A)). simple refine (Ax _). now exists 0%nat. - apply hinhuniv. intros L. generalize (base_finite_intersection (pr1 L) (pr1 (pr2 L))). apply hinhfun. intros A. exists (pr1 A) ; split. + exact (pr1 (pr2 A)). + intros x Ax. now apply (pr2 (pr2 L)), (pr2 (pr2 A)). Qed.
imports: UniMath.Foundations.Preamble UniMath.MoreFoundations.Tactics UniMath.Topology.Prelim UniMath.MoreFoundations.PartA