Therefore the resulting derived tree can be built (non-incrementally) from only canonical trees, using substitution and adjunction.
if we build a TAG grammar G from G by removing all prediction trees, G and G describe the same set of derived trees.