PrintForm Definitions finite sets Sections AutomataTheory Doc

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

a2:{s:S| t:T. f(t) = s }. f@0(a1) = f@0(a2) x,y:T//(f(x) = f(y)) a1 = a2
By: UnivCD
Generated subgoal:

110. a2: {s:S| t:T. f(t) = s }
11. f@0(a1) = f@0(a2) x,y:T//(f(x) = f(y))
a1 = a2

About:
allsetexistsequalapply
impliesquotientuniversefunction