Rank | Theorem | Name |
4 | Thm* n: , f:( n  ), p:( n  n).
Thm* Bij( n; n; p)  sum(f(p(x)) | x < n) = sum(f(x) | x < n) | [permute_sum] |
cites the following: |
3 | Thm* k: , p:( k  k). Bij( k; k; p)  ( L: (k-1) List. p = compose_flips(L)) | [permute_by_flips] |
0 | Thm* n: , f,g:( n  ).
Thm* ( i: n. f(i) = g(i))  sum(f(x) | x < n) = sum(g(x) | x < n) | [sum_functionality] |
1 | Thm* n: , f:( n  ), i: (n-1). sum(f((i, i+1)(x)) | x < n) = sum(f(x) | x < n) | [sum_switch] |