reserve m, n for Nat;

theorem Th26:
  m is square-free & n divides m implies n is square-free
proof
  assume that
A1: m is square-free and
A2: n divides m;
  ex x being Nat st m = n * x by A2,NAT_D:def 3;
  hence thesis by A1,Th25;
end;
