reserve x,y,X for set;

theorem Th1:
  for X being non empty set for F being proper Filter of BoolePoset
  X for A being set st A in F holds A is not empty
proof
  let X be non empty set;
  Bottom BoolePoset X = {} by YELLOW_1:18;
  hence thesis by WAYBEL_7:4;
end;
