reserve X,x for set;
reserve k,m,n for Element of NAT,
  p,q,r,s,r9,s9 for Element of HP-WFF,
  T1,T2 for Tree;
reserve T1,T2 for DecoratedTree;

theorem Th6:
  for x being set, T1, T2 holds (x-tree (T1,T2)).{} = x
proof
  let x be set, T1, T2;
  x-tree (T1,T2) = x-tree<*T1,T2*> by TREES_4:def 6;
  hence thesis by TREES_4:def 4;
end;
