theorem
  m <= n & n > 0 implies (A*) |^ (m, n) = A*
proof
  assume that
A1: m <= n and
A2: n > 0;
  <%>E in A* by FLANG_1:48;
  hence (A*) |^ (m, n) = (A*) |^ n by A1,Th34
    .= A* by A2,FLANG_1:66;
end;
