PrintForm
Definitions
choice
1
Sections
AutomataTheory
Doc
At:
min
ar
wf
1
4
1.
f:
2.
n:
3.
i:
4.
0 < i
5.
i < n+1
6.
MinAr(f;i-1;n)
(i-1+1)
7.
f(n-i) = f(n)
MinAr(f;i-1;n)
(i+1)
By:
Analyze 6
Generated subgoal:
1
6.
MinAr(f;i-1;n)
7.
0
MinAr(f;i-1;n) < i-1+1
8.
f(n-i) = f(n)
MinAr(f;i-1;n)
(i+1)
About:
MinAr(f;i-1;n) < i-1+1
f(n-i) = f(n)
MinAr(f;i-1;n) 
(i+1)
(i-1+1)f(n-i) = f(n) MinAr(f;i-1;n) (i+1) MinAr(f;i-1;n) < i-1+1f(n-i) = f(n) MinAr(f;i-1;n) (i+1)
