reserve n, k, r, m, i, j for Nat;

theorem Th2:
  for n being odd Integer holds (-1) to_power n = -1
proof
  let n be odd Integer;
  (-1) to_power n = -(1 to_power n) by POWER:48
    .= -1 by POWER:26;
  hence thesis;
end;
