Because the maximal depth of a lexical node in an elementary tree of G 1 is 2, we deduce that every tree generated by G 1 contains a lexical node with depth at most 2.
all lexical nodes in the tree t 1 have depth 3.