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. n:
2. 0 < n
3. T: Type
4. R: TProp
5. f: nT
6. Bij(n; T; f)
7. t:T. Dec(R(t))

Surj((n-1); {t:T| t = f(n-1) }; f)

By: Unfold `surject` 0

Generated subgoal:

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


About:
natural_numbersubtractsetequalapplyint
less_thanuniversefunctionpropallexists