PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
inv
of
fin
is
fin
1
1
2
2
1
2
1
1
2
2
1
2
1.
T:
Type
2.
S:
Type
3.
f:
T
S
4.
Fin(S)
5.
s:S. Dec(
t:T. f(t) = s)
6.
EquivRel x,y:T. f(x) = f(y)
7.
f@0:
{s:S|
t:T. f(t) = s }
T
8.
s:{s:S|
t:T. f(t) = s }. f(f@0(s)) = s
9.
b:
x,y:T//(f(x) = f(y))
t:T. f(t) = f(b)
By:
CSquash
Generated subgoals:
1
(
t:T. f(t) = f(b))
Prop
2
f(b)
S
3
(
t:T. f(t) = f(b))
About:
(
t:T. f(t) = f(b)) 
Prop f(b) S 
(t:T. f(t) = f(b))
S
s:S. Dec(t:T. f(t) = s)t:T. f(t) = s }Ts:{s:S| t:T. f(t) = s }. f(f@0(s)) = s t:T. f(t) = f(b) (t:T. f(t) = f(b)) Prop f(b) S (t:T. f(t) = f(b))
