A definition of a filter:
Given a non-empty set $S$, a filter $F$ on $S$ is a non-empty collection of subsets of $S$ that satisfy
(i) $\emptyset\notin F$
(ii) If $A_1,A_2\in F$ then $A_1\cap A_1\in F$
(iii) If $A\subset B$ and $A\in F$, then $B\in F$
Now given $f:X\to Y$ a function between two topological spaces, a filter $F$ on $X$, one defines
$f(F)=\{B\subset Y:f^{-1}(B)\in F\}$
It's easy to see that this defines a filter, but later on there is another definition given in terms of filter basis:
$f(F)$ is a filter on $Y$ generated by the basis $G=\{f(A):A\in F\}$
I don't understand how these two definitions are equivalent.
Given $B\in f(F)$ in a sense of first definition, $f^{-1}(B)\in F$. But $B=f(f^{-1}(B))$ and hence $B\in G$. So in fact $f(F)\subset G$; but the filter generated by $G$ must contain $G$, so in fact if the two definitions agree then $f(F)=G$.
But I don't see how $G$ is necessarily a filter itself: there is no guarantee that interseion of two sets in $G$ is again in $G$, because images do not commute under intersections in general.
Given $A,B \in F$, then $D = f(A \cap B) \subset f(A) \cap f(B)$. Since $D \in G$,
this shows that $G$ is down directed which is sufficient for $G$ to be a
filter base.