PrintForm Definitions exponent Sections AutomataTheory Doc

At: auto2 lemma 6 1 1 1 1 1 2 1 1 1 1 1 1 1 2 2 1 1 1

1. n:
2. 0 < n
3. T: Type
4. R: TProp
5. f: nT
6. Bij(n; T; f)
7. t:T. Dec(R(t))
8. b: T
9. b = f(n-1)

a:(n-1). f(a) = b {t:T| t = f(n-1) }

By: Analyze 6

Generated subgoal:

16. Inj(n; T; f)
7. Surj(n; T; f)
8. t:T. Dec(R(t))
9. b: T
10. b = f(n-1)
a:(n-1). f(a) = b {t:T| t = f(n-1) }


About:
existsnatural_numbersubtractequalsetapply
intless_thanuniversefunctionpropall