In article <firstname.lastname@example.org>, WM <email@example.com> wrote:
> On 5 Apr., 23:54, Virgil <vir...@ligriv.com> wrote: > > > > If not, how do you prove its finiteness? > > > > By finding its largest member. > > Find the largest line of the list > > 1 > 1, 2 > 1, 2, 3 > ... > > that cannot be removed without changing the union of the remaining > lines. > > Regards, WM
What makes you think that there is such a line?
As far as I can see removing any one line alone from the union of all lines has no effect on the union.
So which lines does WM claim satisfy his criterion? --