PrintForm Definitions finite sets Sections AutomataTheory Doc

At: fin is decid 1 1 1 1 1 1 1 1

1. T: Type
2. n:
3. f: nT
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
9. f(a) = x

Dec(x = y)

By: Witness5 y

Generated subgoal:

15. x: T
6. y: T
7. a: n
8. f(a) = x
9. a:n. f(a) = y
Dec(x = y)


About:
equaluniversefunctionnatural_numberallimpliesapplyexists