PrintForm Definitions exponent Sections AutomataTheory Doc

At: auto2 lemma 6 1 1 1 1 1 2 1 1 1 1 1 2 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. t:{t:T| t = f(n-1) }. R(t)

Dec(t:T. R(t))

By: Unfold `decidable` 0

Generated subgoal:

1 (t:T. R(t)) (t:T. R(t))


About:
existsapplyintless_thannatural_numberuniversefunction
propallsetequalsubtractor