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