PrintForm Definitions finite sets Sections AutomataTheory Doc

At: inv of fin is fin 1 1 2 2 1 2
1. T: Type
2. S: Type
3. f: TS
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. (s,t. f(t) = s)(s,t) }T). s:{s:S| t:T. (s,t. f(t) = s)(s,t) }. (s,t. f(t) = s)(s,f@0(s))

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)
By: Reduce 7
Generated subgoal:

17. f@0:({s:S| t:T. f(t) = s }T). s:{s:S| t:T. f(t) = s }. f(f@0(s)) = s
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:
existsfunctionsetequalapply
quotientuniversealllambda