theorem Th40:
  N-most X c= LSeg(N-min X, N-max X)
proof
  let x be object;
  assume
A1: x in N-most X;
  then reconsider p = x as Point of TOP-REAL 2;
A2: p`1 <=(N-max X)`1 by A1,Th39;
A3: (N-min X)`2 = (N-max X)`2 by Th37;
  p`2 = (N-min X)`2 & (N-min X)`1 <= p`1 by A1,Th39;
  hence thesis by A3,A2,GOBOARD7:8;
end;
