1-Proved the theorem about having two disconnected partitions of a dependency graph and how it transforms the bound into their addition\r\n2-Proved a lemma on one parent and two children based on the lemma described previously and the child-parent lemma\r\n3-Cannot prove theorem 4 in R&G. Found a counter example for it that needs mechanisation