
theorem Th13:
  for L being associative commutative well-unital distributive
  almost_left_invertible non empty doubleLoopStr, x being Element of L holds
  pow(x,0) = 1.L
proof
  let L be associative commutative well-unital distributive
  almost_left_invertible non empty doubleLoopStr, x be Element of L;
  pow(x,0) = x |^ 0 by Def2
    .= 1_L by BINOM:8;
  hence thesis;
end;
