We report an elementary proof of the inequality T(n) >= n-2 for the number of triangles formed by a generic arrangement of n lines in the Euclidean plane recently given by S. Felsner and K. Kriegel. If time permits, we will present another argument by these same authors to show that for _arbitrary_ arrangements the best that can be said is that T(n) >= 2n/3. The arguments are particularly interesting in that they apply to arrangements of pseudolines, not just to arrangements of lines.