theorem Th49:
  n divides m implies n gcd m = n
proof
  set N = n gcd m;
  assume n divides m;
  then
A1: n divides N by NAT_D:def 5;
  N divides n by NAT_D:def 5;
  hence thesis by A1,NAT_D:5;
end;
