PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
inv
of
fin
is
fin
1
1
2
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)
{s:S|
t:T. f(t) = s } ~ (x,y:T//(f(x) = f(y)))
By:
RWH (RevLemmaC
Thm*
(
f:(A
B). Bij(A; B; f))
(A ~ B)) 0
Generated subgoal:
1
f1:({s:S|
t:T. f(t) = s }
(x,y:T//(f(x) = f(y)))). Bij({s:S|
t:T. f(t) = s }; x,y:T//(f(x) = f(y)); f1)
About: