IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
permute double sum1 1. n : 2. m : 3. f : nm 4. p : nn 5. q : mm 6. Bij(n; n; p)
7. Bij(m; m; q)
sum(sum(f(p(x),q(y)) | y < m) | x < n) = sum(sum(f(x,y) | y < m) | x < n)
By:
Inst
Thm*n:, f:(n), p:(nn).
Thm* Bij(n; n; p) sum(f(p(x)) | x < n) = sum(f(x) | x < n)
[n;x.sum(f(x,q(y)) | y < m);p]
8. sum((x.sum(f(x,q(y)) | y < m))(p(x)) | x < n)
8. =
8. sum((x.sum(f(x,q(y)) | y < m))(x) | x < n)
sum(sum(f(p(x),q(y)) | y < m) | x < n) = sum(sum(f(x,y) | y < m) | x < n)
3 steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html