theorem Th1:
  0 <= a & a <= b implies |.a.| <= |.b.|
proof
  assume that
A1: 0 <= a and
A2: a <= b;
  |.a.| = a by A1,ABSVALUE:def 1;
  hence thesis by A1,A2,ABSVALUE:def 1;
end;
