theorem
  t <> t9 implies not t,t9 are_c=-comparable
proof
  assume
A1: t <> t9;
  (tree_of_subformulae(F)).t = G & (tree_of_subformulae(F)).t9 = G by Def5;
  hence thesis by A1,Th18;
end;
