I have the following problem at hand:
We have a collection $\mathcal{C} = \{l_1,\dots, l_n\}$ of $n$ line segments in the plane where each segment is contained in a line through the origin. Assuming that each triple in $\mathcal{C}$ can be intersected by a single line, prove that all segments in $\mathcal{C}$ can be intersected by a single line.
My attempt: First we notice that if two segments are on the same line then all segments are on the same line otherwise we can construct a triple that would contradict the assumption so we WLOG assume that all segments are on different lines.
Now we proceed by induction on $n$. For $n=3$ everything is clear so we continue. Assume that it holds for $3,4,\dots, n-1$. Then for every segment in $\mathcal{C}$ there is a line $p_i$ such that $p_i$ intersects all the segments except $l_i$. Now we should have that $D_0(p_i)$ is an element of intersection of the dual sets of all segments except $l_i$. Or in other words all the dual sets have a nonempty intersection. In the same time I know that dual of $l_i$ has a nonempty intersection with dual of any other two $l_j$ but I am not sure how to finish the proof.
Alternate idea: Let $X_i$ be the set of lines intersecting $l_i$. Then by our assumption each three $X_i$ intersect we can apply Helly theorem.
My problem with both ideas is that they do not use the fact that segments are on lines through the origin and this is definetly not true for line segments in general case.
Notation: $D_0(l)$ is a point $a$ such that $\langle x,a \rangle = 1$ for every $x\in l$.