PrintForm
Definitions
choice
1
Sections
AutomataTheory
Doc
At:
min
ar
alt
2
1
2
1.
f:
2.
n:
3.
i:
(n+1)
4.
f(n-i) = f(n)
5.
j:
6.
0 < j
7.
j < n-i+1
8.
MinAr(f;j-1+i;n) = MinAr(f;j-1;n-i)+i
9.
f(n-(j+i)) = f(n)
10.
f(n-i-j) = f(n-i)
j+i = MinAr(f;j-1;n-i)+i
By:
Assert (n-(j+i) = n-i-j)
THEN
RWH (HypC 11) 9
THEN
Thin 11
Generated subgoal:
1
9.
f(n-i-j) = f(n)
10.
f(n-i-j) = f(n-i)
j+i = MinAr(f;j-1;n-i)+i
About:
f(n-i-j) = f(n-i)
j+i = MinAr(f;j-1;n-i)+i
(n+1)
f(n-i-j) = f(n-i) j+i = MinAr(f;j-1;n-i)+if(n-i-j) = f(n-i) j+i = MinAr(f;j-1;n-i)+i
