theorem
  L is lower-bounded implies Bottom L in I
proof
  assume L is lower-bounded;
  then Top (L.:) = Bottom L & L.: is upper-bounded by LATTICE2:48,61;
  then Bottom L in I.: by FILTER_0:11;
  hence thesis;
end;
