
theorem Th10: :: 4.14
  for L being join-commutative join-associative Huntington non
  empty ComplLLattStr, a, b being Element of L st a` = b` holds a = b
proof
  let L be join-commutative join-associative Huntington non empty
  ComplLLattStr, a, b being Element of L;
  assume
A1: a` = b`;
  thus a = a`` by Th3
    .= b by A1,Th3;
end;
