theorem Th32: :: TREES_2:32

for p being FinSequence of NAT
for T being DecoratedTree st p in dom T holds
rng (T | p) c= rng T