proposition: Lemma isfilter_finite_intersection_and : isfilter_finite_intersection → isfilter_and.
proof: Proof. intros Hand A B Fa Fb. rewrite <- finite_intersection_and. apply Hand. intros m. induction m as [m Hm]. induction m as [ | m _]. - exact Fa. - exact Fb. Qed.
imports: UniMath.Foundations.Preamble UniMath.MoreFoundations.Tactics UniMath.Topology.Prelim UniMath.MoreFoundations.PartA