
theorem Th8:
  for T being non empty 1-sorted, N being non empty NetStr over T
  holds N is_eventually_in rng the mapping of N
proof
  let T be non empty 1-sorted, N be non empty NetStr over T;
  set i = the Element of N;
  take i;
  let j be Element of N such that
  i <= j;
  thus thesis by FUNCT_2:4;
end;
