User blog comment:B1mb0w/Strong D Function Calculations/@comment-1605058-20150701125933/@comment-10262436-20150701130946

Hi. Hope you are reading the huge re-edit I just finished. Please ignore the other equation you called out because it was wrong.

This equation holds up, because the above shows that every iteration from D(2,0,n) to D(2,0,n+1) will progressively add another 1 to the f function index. I use the general rule G1 to show that D(2,0,n) is strong enough (actually stronger) to do this.

I can then use the number of iterations to get epsilon_0 as calculated in the other blogs.

P.S. There is still a minor error. Iterating D(2,0,n) doesn't add 1 to the f index. It adds one to the f exponent (number of nested functions). Therefore, I will change the blog again, and use n.n^^n instead of n^^n.