An $r$-rooted digraph is a flame if for each non-root vertex $v$, there is a set of edge-disjoint directed paths from $r$ to $v$ that covers all ingoing edges of $v$. The study of flames was initiated by Lovász, who showed that in a finite rooted digraph, the edge-minimal subgraphs that preserve all local edge-connectivities from the root are always flames. It is known that the edge sets of the flame subgraphs of any finite rooted digraph form a greedoid. Szeszlér showed recently that if the digraph is acyclic, then the bases of this greedoid are the bases of a matroid. We show that a suitable formulation of Szeszlér's theorem is valid for infinite digraphs under the additional assumption that there are no backward-infinite directed paths (which assumption is indeed essential). We also prove that the ''correct'' infinite generalisation of Lovász's theorem also holds for this class of digraphs.