reserve i,s,t,m,n,k for Nat,
        c,d,e for Element of NAT,
        fn for FinSequence of NAT,
        x,y for Integer;

theorem
  1 <= m implies RelPrimes(m) <> {}
proof
  assume A1:1<=m;
  m gcd 1 = 1 by NEWTON:51;
  then m,1 are_coprime by INT_2:def 3;
  then 1 in RelPrimes(m) by A1;
  hence thesis;
end;
