theorem
  L is lower-bounded implies (.p.> = [#Bottom L,p#]
proof
  assume
A1: L is lower-bounded;
  let q;
A2: q in (.p.> iff q [= p by Th28;
  Bottom L [= p & Bottom L [= q by A1;
  hence thesis by A2,Th62;
end;
