PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
fin
is
decid
1
1
1
1
1
1
1
1.
T:
Type
2.
n:
3.
f:
n
T
4.
a1,a2:
n. f(a1) = f(a2)
a1 = a2
5.
b:T.
a:
n. f(a) = b
6.
x:
T
7.
y:
T
8.
a:
n. f(a) = x
Dec(x = y)
By:
Analyze 8
Generated subgoal:
1
8.
a:
n
9.
f(a) = x
Dec(x = y)
About:
n
Dec(x = y)n
T
a1,a2:n. f(a1) = f(a2) 
a1 = a2b:T. 
a:n. f(a) = ba:n. f(a) = x Dec(x = y)n Dec(x = y)
