reserve x,y,z for object, X,Y for set,
  i,k,n for Nat,
  p,q,r,s for FinSequence,
  w for FinSequence of NAT,
  f for Function;

theorem Th30:
  <*x*> is DTree-yielding iff x is DecoratedTree
proof
A1: x is DecoratedTree iff {x} is constituted-DTrees by Th14;
  rng <*x*> = {x} by FINSEQ_1:39;
  hence thesis by A1;
end;
