Proof
(related to Proposition: Filter Base)
"$\Rightarrow$"
- Assume $F$ is a filter.
- Since $F$ is a filter, it contains the intersection of any two of its elements.
- By hypothesis, $F$ contains all subsets of $X$ containing some elements of $B$.
- Thus, the intersection of any two sets of $B$ contains a set in $B$ as an element.
"$\Leftarrow$"
- Assume, the intersection of any two sets of $B$ contains a set in $B.$
- Since $F$ contains all of the subsets of $X$ containing an element of $B$, $F$ contains the intersection of any two of its elements.
- Moreover, since $B$ does not contain the empty set, so does not $F.$
- Finally, all supersets of the elements of $B$ are contained in $F$
- It follows that $F$ is a filter.
∎
Thank you to the contributors under CC BY-SA 4.0!

- Github:
-

References
Bibliography
- Steen, L.A.;Seebach J.A.Jr.: "Counterexamples in Topology", Dover Publications, Inc, 1970
- Jänich, Klaus: "Topologie", Springer, 2001, 7th Edition