PrintForm
Definitions
choice
1
Sections
AutomataTheory
Doc
At:
min
arg
unique
1
1.
f:
2.
n:
3.
k:
4.
f(n) = f(k)
n-MinAr(f;n;n) = k-MinAr(f;k;k)
By:
Decide (k < n)
Generated subgoals:
1
5.
k < n
n-MinAr(f;n;n) = k-MinAr(f;k;k)
2
5.
k < n
n-MinAr(f;n;n) = k-MinAr(f;k;k)
About:
n-MinAr(f;n;n) = k-MinAr(f;k;k) 
k < n n-MinAr(f;n;n) = k-MinAr(f;k;k) 
n-MinAr(f;n;n) = k-MinAr(f;k;k) n-MinAr(f;n;n) = k-MinAr(f;k;k) k < n n-MinAr(f;n;n) = k-MinAr(f;k;k) 
