reserve X,Y,x,y for set;
reserve A for non empty Poset;
reserve a,a1,a2,a3,b,c for Element of A;
reserve S,T for Subset of A;

theorem
  c < a iff a in UpperCone{c}
proof
  thus c < a implies a in UpperCone{c}
  proof
    assume c < a;
    then for b holds b in {c} implies b < a by TARSKI:def 1;
    hence thesis;
  end;
  assume a in UpperCone{c};
  then
A1: ex a1 st a1 = a & for a2 st a2 in {c} holds a2 < a1;
  c in {c} by TARSKI:def 1;
  hence thesis by A1;
end;
