Python, 63 bytes

f=lambda l,*L,a=[]:L and f(*L,a=a+[L[0]-l-b for b in[0]+a])or a

Attempt This Online!

Takes splatted input. Returns the entire double-reduction.

How?

Once one all but ignores the confusing double indexing there is an obvious rather simple recursion.