By: |
Thm* ![]() ![]() ![]() ![]() ![]() ![]() Thm* increasing(f;n) Thm* ![]() ![]() Thm* ( ![]() ![]() ![]() [T;L;n;f] THEN Inst Thm* ![]() ![]() ![]() ![]() ![]() ![]() Thm* increasing(f;n) Thm* ![]() ![]() Thm* ( ![]() ![]() ![]() [T;L;k;g] THEN ExRepD |
1 |
15. ||L2|| = n ![]() ![]() 16. sublist_occurence(T;L2;L;f) 17. L1 : T List 18. ||L1|| = k ![]() ![]() 19. sublist_occurence(T;L1;L;g) ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | 20 steps |
About:
![]() | ![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
![]() |