reserve A,X for non empty set;
reserve f for PartFunc of [:X,X:],REAL;
reserve a for Real;

theorem Th11:
  SmallestPartition A is_finer_than {A}
proof
  let X be set;
  assume
A1: X in SmallestPartition A;
  take A;
  thus thesis by A1,TARSKI:def 1;
end;
