theorem Th30:
  UFilter BL.Bottom BL = {}
proof
  assume
A1: UFilter BL.Bottom BL <> {};
  set x = the Element of UFilter BL.Bottom BL;
  ex F st F=x & F is being_ultrafilter & Bottom BL in F by A1,Th17;
  hence contradiction by Th29;
end;
