
theorem
  for L being lower-bounded antisymmetric non empty RelStr for x being
  Element of L holds Bottom L <= x
proof
  let L be lower-bounded antisymmetric non empty RelStr;
  let x be Element of L;
  {} is_<=_than x & ex_sup_of {},L by Th42;
  hence thesis by Th30;
end;
