
theorem
  for t being DecoratedTree, p being Node of t holds t|p is root iff p
  in Leaves dom t
proof
  let t be DecoratedTree, p be Node of t;
A1: dom (t|p) = (dom t)|p by TREES_2:def 10;
  thus thesis by A1,Th5;
end;
