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