theorem
  ord a>1 & a=b|^k implies k<>0
proof
  assume that
A1: ord a>1 and
A2: a=b|^k & k=0;
  a=1_G by A2,GROUP_1:25;
  hence contradiction by A1,GROUP_1:42;
end;
