
theorem Th6: :: 4.12
  for L being join-commutative join-associative join-idempotent
  Huntington non empty ComplLLattStr holds L is upper-bounded
proof
  let L be join-commutative join-associative join-idempotent Huntington non
  empty ComplLLattStr;
  consider c being Element of L such that
A1: for a being Element of L holds c + a = c & a + a` = c by Th5;
  for a being Element of L holds a + c = c & a + a` = c by A1;
  hence thesis by A1;
end;
