In article <firstname.lastname@example.org>, WM <email@example.com> wrote:
> On 6 Apr., 21:40, William Hughes <wpihug...@gmail.com> wrote: > > On Apr 6, 7:30 pm, WM <mueck...@rz.fh-augsburg.de> wrote: > > > > > On 6 Apr., 19:02, William Hughes <wpihug...@gmail.com> wrote: > > > > > > > > Tell me which E you want to use. I will > > > > > > name an element that is in D\E. > > > > > > > I will not leave any line that has a follower, i.e., I will use all > > > > > finite lines (given that "all lines" is a meaningful notion for > > > > > infinite sets.) > > > > > > You cannot. E has a largest element. The set of all finite > > > > lines does not.- > > > > > You contradict yourself. > > > > Nope. "any finite subset of D can be removed", > > Any line that has a follower can be removed. > Proof: The follower contains everything that the union of its > predecessors contain. > If there are infinitely many lines with followers, then infinitely > many lines can be removed. That's how mathematics works.
And infinitely many lines can be removed, but only as long as for every line removed one leaves behind at least one following line.
And to do this requires leaving behind infinitely many lines. Any set of infinitely many lines will do, but no set of less than infinitely many lines is sufficient.
This point seems to be one of the many pons asinora that WM is incapable of crossing. > > Please stop your unfounded talking